Probabilistic Assignment of Objects: Characterizing the Serial Rule

We study the problem of assigning a set of objects to a set of agents, when each agent receives one object and has strict preferences over the objects. In the absence of monetary transfers, we focus on the probabilistic rules, which take the ordinal preferences as input. We characterize the serial rule, proposed by Bogomolnaia and Moulin (2001) [2]: it is the only rule satisfying sd efficiency, sd no-envy, and bounded invariance. A special representation of feasible assignment matrices by means of consumption processes is the key to the simple and intuitive proof of our main result.

[1]  Allan Gibbard,et al.  Straightforwardness of Game Forms with Lotteries as Outcomes , 1978 .

[3]  Yeon-Koo Che,et al.  Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms , 2008 .

[4]  R. Zeckhauser,et al.  The Efficient Allocation of Individuals to Positions , 1979, Journal of Political Economy.

[5]  M. Utku Ünver,et al.  Two axiomatic approaches to the probabilistic serial mechanism , 2014 .

[6]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[7]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[8]  Fuhito Kojima,et al.  Random assignment of multiple indivisible objects , 2009, Math. Soc. Sci..

[9]  Onur Kesten,et al.  Why do popular mechanisms lack efficiency in random environments? , 2009, J. Econ. Theory.

[10]  Jay Sethuraman,et al.  House allocation with fractional endowments , 2011, Int. J. Game Theory.

[11]  Daisuke Hirata,et al.  Characterizations of the Probabilistic Serial Mechanism , 2011 .

[12]  H. Moulin,et al.  A simple random assignment problem with a unique solution , 2002 .

[13]  A. Gibbard.  Manipulation of Schemes That Mix Voting with Chance , 1977 .

[14]  Hervé Moulin,et al.  A New Solution to the Random Assignment Problem , 2001, J. Econ. Theory.

[15]  M. Satterthwaite,et al.  Strategy-Proof Allocation Mechanisms at Differentiable Points , 1981 .

[16]  Lin Zhou.  On a conjecture by gale about one-sided matching problems , 1990 .

[17]  M. Ünver,et al.  Fair and Efficient Assignment via the Probabilistic Serial Mechanism , 2011 .

[18]  Onur Kesten,et al.  The Probabilistic Serial Assignment Mechanism , 2010 .

[19]  Jay Sethuraman,et al.  A solution to the random assignment problem on the full preference domain , 2006, J. Econ. Theory.