SearcharxivSearch

arXiv subjects

Alexander P. Zimin

Publications and source records attributed to Alexander P. Zimin.

7 recordsLinked to original sources

Bunching and Taxing Multidimensional Skills

We characterize optimal policy in a multidimensional nonlinear taxation model with bunching. We develop an empirically relevant model with cognitive and manual skills, firm heterogeneity, and labor market sorting. We first derive two conditions for the optimality of taxes that take into account bunching. The first condition $-$ a stochastic dominance optimal tax condition $-$ shows that at the optimum the schedule of benefits dominates the schedule of distortions in terms of second-order stochastic dominance. The second condition $-$ a global optimal tax formula $-$ provides a representation that balances the local costs and benefits of optimal taxation while explicitly accounting for global incentive constraints. Second, we use Legendre transformations to represent our problem as a linear program. This linearization allows us to solve the model quantitatively and to precisely characterize bunching. At an optimum, 10 percent of workers is bunched. We introduce two notions of bunching $-$ blunt bunching and targeted bunching. Blunt bunching constitutes 30 percent of all bunching, occurs at the lowest regions of cognitive and manual skills, and lumps the allocations of these workers resulting in a significant distortion. Targeted bunching constitutes 70 percent of all bunching and recognizes the workers' comparative advantage. The planner separates workers on their dominant skill and bunches them on their weaker skill, thus mitigating distortions along the dominant skill dimension.

econ.GN

Sorting with Teams

We fully solve a sorting problem with heterogeneous firms and multiple heterogeneous workers whose skills are imperfect substitutes. We show that optimal sorting, which we call mixed and countermonotonic, is comprised of two regions. In the first region, mediocre firms sort with mediocre workers and coworkers such that the output losses are equal across all these teams (mixing). In the second region, a high skill worker sorts with low skill coworkers and a high productivity firm (countermonotonicity). We characterize the equilibrium wages and firm values. Quantitatively, our model can generate the dispersion of earnings within and across US firms.

econ.GN

Beckmann's approach to multi-item multi-bidder auctions

We consider the problem of revenue-maximizing Bayesian auction design with several bidders having independent private values over several items. We show that it can be reduced to the problem of continuous optimal transportation introduced by Beckmann (1952) where the optimal transportation flow generalizes the concept of ironed virtual valuations to the multi-item setting. We establish the strong duality between the two problems and the existence of solutions. The results rely on insights from majorization and optimal transportation theories and on the characterization of feasible interim mechanisms by Hart and Reny (2015).

econ.TH

On existence of measure with given marginals supported on a hyperplane

Let $\{μ_k\}_{k = 1}^N$ be absolutely continuous probability measures on the real line such that every measure $μ_k$ is supported on the segment $[l_k, r_k]$ and the density function of $μ_k$ is nonincreasing on that segment for all $k$. We prove that if $\mathbb{E}(μ_1) + \dots + \mathbb{E}(μ_N) = C$ and if $r_k - l_k \le C - (l_1 + \dots + l_N)$ for all $k$, then there exists a transport plan with given marginals supported on the hyperplane $\{x_1 + \dots + x_N = C\}$. This transport plan is an optimal solution of the multimarginal Monge-Kantorovich problem for the repulsive harmonic cost function $\sum_{i, j = 1}^N-(x_i - x_j)^2$.

math.PR

The multistochastic Monge-Kantorovich problem

The multistsochastic Monge--Kantorovich problem on the product $X = \prod_{i=1}^n X_i$ of $n$ spaces is a generalization of the multimarginal Monge--Kantorovich problem. For a given integer number $1 \le k<n$ we consider the minimization problem $\int c d π\to \inf$ of the space of measures with fixed projections onto every $X_{i_1} \times \dots \times X_{i_k}$ for arbitrary set of $k$ indices $\{i_1, \dots, i_k\} \subset \{1, \dots, n\}$. In this paper we study basic properties of the multistochastic problem, including well-posedness, existence of a dual solution, boundedness and continuity of a dual solution.

math.FA

An explicit solution for a multimarginal mass transportation problem

We construct an explicit solution for the multimarginal transportation problem on the unit cube $[0,1]^3$ with the cost function $xyz$ and one-dimensional uniform projections. We show that the primal problem is concentrated on a set with non-constant local dimension and admits many solutions, whereas the solution to the corresponding dual problem is unique (up to addition of constants).

math.OC

On multistochastic Monge-Kantorovich problem, bitwise operations, and fractals

The multistochastic $ (n,k)$-Monge--Kantorovich problem on a product space $\prod_{i=1}^n X_i$ is an extension of the classical Monge--Kantorovich problem. This problem is considered on the space of measures with fixed projections onto $X_{i_1} \times \ldots \times X_{i_k}$ for all $k$-tuples $\{i_1, \ldots, i_k\} \subset \{1, \ldots, n\}$ for a given $1 \le k < n$. In our paper we study well-posedness of the primal and the corresponding dual problem. Our central result describes a solution $π$ to the following important model case: $n=3, k=2, X_i = [0,1]$, the cost function $c(x,y,z) = xyz$, and the corresponding two--dimensional projections are Lebesgue measures on $[0,1]^2$. We prove, in particular, that the mapping $(x,y) \to x \oplus y$, where $\oplus$ is the bitwise addition (xor- or Nim-addition) on $[0,1] \cong \mathbb{Z}_2^{\infty}$, is the corresponding optimal transportation. In particular, the support of $π$ is the Sierpiński tetrahedron. In addition, we describe a solution to the corresponding dual problem.

math.FA