Author:
Aziz Haris,Bouveret Sylvain,Caragiannis Ioannis,Giagkousi Ira,Lang Jérôme
Abstract
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.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. EFX Allocation to Chores over Small Graph;Combinatorial Optimization and Applications;2023-12-09
2. Toward A Logical Theory Of Fairness and Bias;Theory and Practice of Logic Programming;2023-07
3. The Theory of Fair Allocation Under Structured Set Constraints;Ethics in Artificial Intelligence: Bias, Fairness and Beyond;2023
4. On Reachable Assignments Under Dichotomous Preferences;PRIMA 2022: Principles and Practice of Multi-Agent Systems;2022-11-12
5. Computing Envy-Freeable Allocations with Limited Subsidies;Web and Internet Economics;2022