Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve
23 Nov 2022
TL;DR: In this article , the authors presented an exact characterization of the achievable envy, efficiency and leftover resources pairs, showing that any algorithm achieving low envy must suffer from poor inefficiency and vice versa.
read more
Abstract: Optimizing Mobile Food Pantry Operations Under Demand Uncertainty Managing complex systems often involves making trade-offs between different objectives. A common example is seeking fairness guarantees in sequential resource allocation problems. For example, mobile food pantries are tasked with allocating resources under demand uncertainty with the goal of simultaneously minimizing inefficiency (leftover resources) and envy (deviations in allocations). In this work, we tackle a problem established from a partnership with the Food Bank of the Southern Tier in optimizing their mobile food-pantry operations. We provide an exact characterization of the achievable (envy, efficiency) pairs, showing that any algorithm achieving low envy must suffer from poor inefficiency and vice versa. We complement this exact characterization with a simple algorithm capable of achieving any desired point along the trade-off curve.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Fairness Maximization among Offline Agents in Online-Matching Markets.
TL;DR: In this article, the authors proposed online matching algorithms which optimize for either individual or group-level fairness among offline agents in OMMs, which achieved online competitive ratios at least 0.725 for individual fairness maximization (IFM) and 0.719 for group fairness maximisation (GFM), respectively.
5
Fair Assortment Planning
Qinyi Chen,Negin Golrezaei,Fransisca Susan,Edy Baskoro +3 more
TL;DR: Fair assortment planning involves optimizing the allocation of items into different assortment sets based on customer demand and other factors.
Fair resource allocation for demands with sharp lower tail inequalities
TL;DR: It is shown that for many common demand distributions satisfying sharp lower-tail inequalities, a natural allocation that provides resources proportional to each group's average demand performs very well and is approximately fair and efficient.
2
Regulating Discriminatory Pricing in the Presence of Tacit Collusion
Zongsen Yang,Xiao Lei,Pin Gao +2 more
TL;DR: This study examines the interplay between fairness regulation and tacit collusion in algorithmic pricing, finding that strict fairness can inadvertently support collusive behavior, while mild fairness can prevent market collusion and optimize welfare.
1
•Posted Content
Online Market Equilibrium with Application to Fair Division.
TL;DR: In this article, the authors focus on the case of online Fisher markets, where individuals have linear, additive utility and items drawn from a distribution arrive one at a time in an online setting, and provide a dynamics which converges to these equilibria asymptotically.
References
•Book
Dynamic Programming and Optimal Control
Dimitri P. Bertsekas
- 01 May 1995
TL;DR: The leading and most up-to-date textbook on the far-ranging algorithmic methododogy of Dynamic Programming, which can be used for optimal control, Markovian decision problems, planning and sequential decision making under uncertainty, and discrete/combinatorial optimization.
Inherent Trade-Offs in the Fair Determination of Risk Scores
Jon Kleinberg,Sendhil Mullainathan,Manish Raghavan +2 more
- 01 Jan 2017
TL;DR: Some of the ways in which key notions of fairness are incompatible with each other are suggested, and hence a framework for thinking about the trade-offs between them is provided.
1.5K
Dominant resource fairness: fair allocation of multiple resource types
Ali Ghodsi,Matei Zaharia,Benjamin Hindman,Andy Konwinski,Scott Shenker,Ion Stoica +5 more
- 30 Mar 2011
TL;DR: Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types, is proposed, and it is shown that it leads to better throughput and fairness than the slot-based fair sharing schemes in current cluster schedulers.
1.3K
•Book
Fair Division and Collective Welfare
Hervé Moulin
- 24 Jan 2003
TL;DR: This book discusses three cardinal interpretations of collective welfare: Bentham's "utilitarian" proposal to maximize the sum of individual utilities, the Nash product, and the egalitarian leximin ordering.
1K