Fair Division of Mixed Divisible and Indivisible Goods

We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods setting. In this work, we propose a new fairness notion envy-freeness for mixed goods (EFM), which is a direct generalization of both EF and EF1 to the mixed goods setting. We prove that an EFM allocation always exists for any number of agents. We also propose efficient algorithms to compute an EFM allocation for two agents and for $n$ agents with piecewise linear valuations over the divisible goods. Finally, we relax the envy-free requirement, instead asking for $\epsilon$-envy-freeness for mixed goods ($\epsilon$-EFM), and present an algorithm that finds an $\epsilon$-EFM allocation in time polynomial in the number of agents, the number of indivisible goods, and $1/\epsilon$.

[1]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[2]  Ariel D. Procaccia,et al.  Fair enough: guaranteeing approximate maximin shares , 2014, EC.

[3]  Ariel D. Procaccia,et al.  Truth, justice, and cake cutting , 2010, Games Econ. Behav..

[4]  W. Stromquist.  How to Cut a Cake Fairly , 1980 .

[5]  Mohammad Ghodsi,et al.  Fair Allocation of Indivisible Goods: Improvements and Generalizations , 2017, EC.

[6]  Kirk Pruhs,et al.  Balanced Allocations of Cake , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[7]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[8]  Ariel D. Procaccia.  Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.

[9]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[10]  Ariel D. Procaccia,et al.  A Lower Bound for Equitable Cake Cutting , 2017, EC.

[11]  D. Gale,et al.  Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .

[12]  Erel Segal-Halevi,et al.  Monotonicity and competitive equilibrium in cake-cutting , 2015 .

[13]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[14]  Haris Aziz,et al.  A discrete and bounded envy-free cake cutting protocol for four agents , 2015, STOC.

[15]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

[16]  D. Weller,et al.  Fair division of a measurable space , 1985 .

[17]  Ning Chen,et al.  Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.

[18]  Simina Brânzei,et al.  The Query Complexity of Cake Cutting , 2017, NeurIPS.

[19]  Nisarg Shah,et al.  Fair Division with Subsidy , 2019, SAGT.

[20]  Evangelos Markakis,et al.  Approximation Algorithms for Computing Maximin Share Allocations , 2015, ICALP.

[21]  George R. Feiwel,et al.  Arrow and the foundations of the theory of economic policy , 1987 .

[22]  Kurt Mehlhorn,et al.  EFX Exists for Three Agents , 2020, EC.

[23]  Flip Klijn,et al.  An algorithm for envy-free allocations in an economy with indivisible objects and money , 2000, Soc. Choice Welf..

[24]  F. Su.  Rental Harmony: Sperner's Lemma in Fair Division , 1999 .

[25]  H. Moulin.  Fair Division in the Internet Age , 2019, Annual Review of Economics.

[26]  Jugal Garg,et al.  An Improved Approximation Algorithm for Maximin Shares , 2019, EC.

[27]  Shimon Even,et al.  A note on cake cutting , 1984, Discret. Appl. Math..

[28]  Eric Maskin.  On the Fair Allocation of Indivisible Goods , 1987 .

[29]  Yann Chevaleyre,et al.  Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.

[30]  William Thomson,et al.  Introduction to the Theory of Fair Allocation , 2016, Handbook of Computational Social Choice.

[31]  Katarína Cechlárová,et al.  On the computability of equitable divisions , 2012, Discret. Optim..

[32]  Haris Aziz,et al.  A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[33]  Hans Reijnierse,et al.  Envy-free and Pareto efficient allocations in economies with indivisible goods and money , 2002, Math. Soc. Sci..

[34]  Tim Roughgarden,et al.  Almost Envy-Freeness with General Valuations , 2017, SODA.

[35]  Xiaohui Bei,et al.  Truthful fair division without free disposal , 2018, Social Choice and Welfare.