Knowledge, Fairness, and Social Constraints

In the context of fair allocation of indivisible items, fairness concepts often compare the satisfaction of an agent to the satisfaction she would have from items that are not allocated to her: in particular, envy-freeness requires that no agent prefers the share of someone else to her own share. We argue that these notions could also be defined relative to the knowledge that an agent has on how the items that she does not receive are distributed among other agents. We define a family of epistemic notions of envy-freeness, parameterized by a social graph, where an agent observes the share of her neighbours but not of her non-neighbours. We also define an intermediate notion between envy-freeness and proportionality, also parameterized by a social graph. These weaker notions of envy-freeness are useful when seeking a fair allocation, since envy-freeness is often too strong. We position these notions with respect to known ones, thus revealing new rich hierarchies of fairness concepts. Finally, we present a very general framework that covers all the existing and many new fairness concepts.

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

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

[3]  Jon M. Kleinberg,et al.  Fair Division via Social Comparison , 2016, AAMAS.

[4]  Jörg Rothe,et al.  Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..

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

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

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

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

[9]  Yann Chevaleyre,et al.  Distributed fair allocation of indivisible goods , 2017, Artif. Intell..

[10]  Sylvain Bouveret,et al.  Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.

[11]  Edith Elkind,et al.  Fair Division of a Graph , 2017, IJCAI.

[12]  Youming Qiao,et al.  Networked Fairness in Cake Cutting , 2017, IJCAI.

[13]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.

[14]  Yiling Chen,et al.  Ignorance is Often Bliss : Envy with Incomplete Information , 2017 .

[15]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .

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