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]  Ariel D. Procaccia.  Cake Cutting Algorithms , 2016, Handbook of Computational Social Choice.

[2]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..

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

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

[5]  Xiaohui Bei,et al.  Fair Division of Mixed Divisible and Indivisible Goods , 2019, AAAI.

[6]  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).

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

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

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

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

[11]  K. Mehlhorn,et al.  EFX Exists for Three Agents , 2020, EC.

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

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

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

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

[16]  Ariel D. Procaccia.  An answer to fair division's most enigmatic question: technical perspective , 2020, Commun. ACM.

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

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

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

[20]  Alexander Rubchinsky,et al.  Brams-Taylor model of fair division for divisible and indivisible items , 2010, Math. Soc. Sci..

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

[22]  Eric Budish.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2011, Journal of Political Economy.

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

[24]  Xiaohui Bei,et al.  Maximin Fairness with Mixed Divisible and Indivisible Goods , 2020, ArXiv.

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

[26]  Alexandros Hollender,et al.  Maximum Nash Welfare and Other Stories About EFX , 2020, IJCAI.

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

[28]  Xiaohui Bei,et al.  Truthful fair division without free disposal , 2020, Social choice and welfare.

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

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

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

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

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

[34]  Erel Segal-Halevi,et al.  Fair Division with Minimal Sharing , 2019, ArXiv.

[35]  Rohit Vaish,et al.  Finding Fair and Efficient Allocations , 2017, EC.

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

[37]  Tim Roughgarden,et al.  Almost Envy-Freeness with General Valuations , 2020, SIAM J. Discret. Math..

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

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

[40]  Adrian Vetta,et al.  One Dollar Each Eliminates Envy , 2019, EC.