Consensus Halving for Sets of Items

Consensus halving refers to the problem of dividing a resource into two parts so that every agent values both parts equally. Prior work has shown that when the resource is represented by an interval, a consensus halving with at most $n$ cuts always exists, but is hard to compute even for agents with simple valuation functions. In this paper, we study consensus halving in a natural setting where the resource consists of a set of items without a linear ordering. When agents have additive utilities, we present a polynomial-time algorithm that computes a consensus halving with at most $n$ cuts, and show that $n$ cuts are almost surely necessary when the agents' utilities are drawn from probabilistic distributions. On the other hand, we show that for a simple class of monotonic utilities, the problem already becomes PPAD-hard. Furthermore, we compare and contrast consensus halving with the more general problem of consensus $k$-splitting, where we wish to divide the resource into $k$ parts in possibly unequal ratios, and provide some consequences of our results on the problem of computing small agreeable sets.

[1]  Warut Suksompong.  Assigning a Small Agreeable Set of Indivisible Items to Multiple Players , 2016, IJCAI.

[2]  Warut Suksompong,et al.  Approximate maximin shares for groups of agents , 2017, Math. Soc. Sci..

[3]  Paul W. Goldberg,et al.  Hardness Results for Consensus-Halving , 2016, MFCS.

[4]  Paul W. Goldberg,et al.  Consensus halving is PPA-complete , 2017, STOC.

[5]  Alexandros Hollender,et al.  A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting , 2020, SODA.

[6]  Pasin Manurangsi,et al.  Asymptotic existence of fair divisions for groups , 2017, Math. Soc. Sci..

[7]  Tim Roughgarden,et al.  Twenty Lectures on Algorithmic Game Theory , 2016, Bull. EATCS.

[8]  A. K. Austin,et al.  Sharing a Cake , 1982, The Mathematical Gazette.

[9]  Francis Edward Su,et al.  Consensus-halving via theorems of Borsuk-Ulam and Tucker , 2003, Math. Soc. Sci..

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

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

[12]  Steven J. Brams,et al.  The win-win solution - guaranteeing fair shares to everybody , 1999 .

[13]  Warut Suksompong,et al.  Almost Envy-Freeness in Group Resource Allocation , 2019, IJCAI.

[14]  CaragiannisIoannis,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2019 .

[15]  John R. Rice,et al.  A moment problem in ₁ approximation , 1965 .

[16]  Xiaotie Deng,et al.  Settling the complexity of computing two-player Nash equilibria , 2007, JACM.

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

[18]  Pasin Manurangsi,et al.  Computing an Approximately Optimal Agreeable Set of Items , 2016, IJCAI.

[19]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[20]  Toby Walsh,et al.  Fair allocation of indivisible goods and chores , 2019, Autonomous Agents and Multi-Agent Systems.

[21]  Aviad Rubinstein,et al.  Inapproximability of Nash Equilibrium , 2014, STOC.

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

[23]  Octav Onicescu,et al.  Un théorème d'existence , 1975 .

[24]  Douglas R. Woodall,et al.  Sets on Which Several Measures Agree , 1985 .

[25]  Erel Segal-Halevi,et al.  Proportional Cake-Cutting among Families , 2015, 1510.03903.

[26]  Paul G. Spirakis,et al.  Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem , 2019, ICALP.

[27]  Noga Alon,et al.  Efficient Splitting of Measures and Necklaces , 2020, ArXiv.

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

[29]  N. Alon,et al.  The Borsuk-Ulam theorem and bisection of necklaces , 1986 .

[30]  Ariel D. Procaccia,et al.  Fairly Allocating Many Goods with Few Queries , 2018, AAAI.

[31]  Vittorio Bilò,et al.  Almost Envy-Free Allocations with Connected Bundles , 2018, ITCS.

[32]  Sven Seuken,et al.  Monotonic and Non-Monotonic Solution Concepts for Generalized Circuits , 2019, ArXiv.

[33]  Alexandros Hollender,et al.  Consensus-Halving: Does It Ever Get Easier? , 2020, EC.

[34]  Paul W. Goldberg,et al.  The complexity of splitting necklaces and bisecting ham sandwiches , 2018, STOC.

[35]  Laurent Gourvès,et al.  Agreeable sets with matroidal constraints , 2018, J. Comb. Optim..

[36]  Hervé Moulin,et al.  Competitive Division of a Mixed Manna , 2017, ArXiv.

[37]  Charles H. Goldberg,et al.  Bisection of Circle Colorings , 1985 .

[38]  Erel Segal-Halevi,et al.  Fairly Dividing a Cake after Some Parts Were Burnt in the Oven , 2017, AAMAS.