Fair and efficient online allocations

DOI10.1287/OPRE.2022.0332MaRDI QIDQ6598905zbMATH OpenFDO

Authors Gerdus Benadè, Aleksandr M. Kazachkov, Ariel D. Procaccia, Alexandros Psomas, David Zeng

Publication date 5 September 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2022.0332

zbMATH Keywords

fair divisionfairness-efficiency trade-offonline allocation

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve
• Online max-min fair allocation
• Almost envy-freeness with general valuations
• Almost envy-freeness with general valuations

Cited in

(6)

• Almost envy-free repeated matching in two-sided markets
• Simultaneously achieving ex-ante and ex-post fairness
• Individual fairness in advertising auctions through inverse proportionality
• Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve
• Repeatedly matching items to agents fairly and efficiently
• Best of both worlds: ex ante and ex post fairness in resource allocation

This page was built for publication: Fair and efficient online allocations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6598905)