Nash Welfare and Round Robin Share

We study a problem in which a decision must be made on multiple social issues simultaneously. We define three new notions of fairness based on guarantees provided by naive round-robin decision-making mechanisms -- one that can only be achieved by exploiting randomized mechanisms, and two weaker notions that can be achieved by deterministic mechanisms. Finally, we examine whether the Nash Bargaining Solution satisfies our fairness notions.

[1]  Ariel D. Procaccia,et al.  Preference Elicitation For Participatory Budgeting , 2017, AAAI.

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

[3]  Hans Reijnierse,et al.  On finding an envy-free Pareto-optimal division , 1998, Math. Program..

[4]  V. Vazirani.  Algorithmic Game Theory: Combinatorial Algorithms for Market Equilibria , 2007 .

[5]  Ariel D. Procaccia,et al.  Leximin Allocations in the Real World , 2015, EC.

[6]  Haris Aziz,et al.  A Generalization of Probabilistic Serial to Randomized Social Choice , 2014, AAAI.

[7]  Kamesh Munagala,et al.  The Core of the Participatory Budgeting Problem , 2016, WINE.

[8]  Matthias G. Raith,et al.  Bidding for envy-freeness: A procedural approach to n-player fair-division problems , 2002, Soc. Choice Welf..

[9]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[10]  Richard Cole,et al.  Approximating the Nash Social Welfare with Indivisible Items , 2015, SECO.

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

[12]  Lirong Xia,et al.  Voting in Combinatorial Domains , 2016, Handbook of Computational Social Choice.

[13]  Euiwoong Lee,et al.  APX-hardness of maximizing Nash social welfare with indivisible items , 2015, Inf. Process. Lett..

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

[15]  Felix Brandt,et al.  On Popular Random Assignments , 2013, SAGT.

[16]  Steven J. Brams,et al.  The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..

[17]  Ariel D. Procaccia,et al.  The Distortion of Cardinal Preferences in Voting , 2006, CIA.

[18]  Craig Boutilier,et al.  Optimal social choice functions: a utilitarian view , 2012, EC '12.

[19]  Burt L. Monroe,et al.  Fully Proportional Representation , 1995, American Political Science Review.

[20]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[21]  Ulrich Endriss,et al.  Compactly representing utility functions using weighted goals and the max aggregator , 2010, Artif. Intell..

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

[23]  D. Foley.  Resource allocation and the public sector , 1967 .

[24]  Richard Stong,et al.  Collective choice under dichotomous preferences , 2005, J. Econ. Theory.

[25]  John R. Chamberlin,et al.  Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule , 1983, American Political Science Review.

[26]  Ulrich Endriss,et al.  Nash Social Welfare in Multiagent Resource Allocation , 2009, AMEC/TADA.