RIMS-1852 A Solution to the Random Assignment Problem with a Matroidal Family of Goods

Problems of allocating indivisible goods to agents in an efficient and fair manner without money have long been investigated in the literature. The random assignment problem is one of them, where we are given a fixed feasible (available) set of indivisible goods and a profile of ordinal preferences over the goods, one for each agent, and we determine an assignment of goods to agents in a randomized way using lotteries. A seminal paper of Bogomolnaia and Moulin (2001) shows a probabilistic serial mechanism to give an efficient and envy-free solution to the assignment problem. In this paper we consider an extension of the random assignment problem to the case where we are given a family B of feasible sets of indivisible goods. In particular we consider the case where B is a family of bases of a matroid. Under the agents’ ordinal preferences over goods we show an extension of the probabilistic serial mechanism to give an efficient and envy-free solution that probabilistically makes a choice of a member (a base) of the family and its assignment to agents. The theory of submodular optimization plays a crucial rôle in the extension.

[1]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[2]  Vijay V. Vazirani,et al.  Allocation of Divisible Goods Under Lexicographic Preferences , 2012, FSTTCS.

[3]  Anna Bogomolnaia,et al.  Random assignment: Redefining the serial rule , 2015, J. Econ. Theory.

[4]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

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

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

[7]  Eun Jeong Heo.  Probabilistic assignment problem with multi-unit demands: A generalization of the serial rule and its characterization , 2014 .

[8]  IwataSatoru,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001 .

[9]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[10]  Eun Jeong Heo,et al.  Probabilistic Assignment of Objects: Characterizing the Serial Rule , 2011, J. Econ. Theory.

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

[12]  S. Fujishige.  ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS , 1978 .

[13]  James G. Oxley,et al.  Matroid theory , 1992 .

[14]  Paul R. Milgrom,et al.  Designing Random Allocation Mechanisms: Theory and Applications , 2013 .

[15]  Satoru Fujishige,et al.  Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector , 1980, Math. Oper. Res..

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

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

[18]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[19]  Kiyohito Nagano,et al.  A strongly polynomial algorithm for line search in submodular polyhedra , 2007, Discret. Optim..

[20]  Atila Abdulkadiroglu,et al.  RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .

[21]  James B. Orlin,et al.  A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization , 2007, IPCO.

[22]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[23]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..