The existence and efficiency of PMMS allocations

DOI10.1016/J.TCS.2024.114388MaRDI QIDQ6201323zbMATH OpenFDO

Authors Sijia Dai, Xinru Guo, Huahua Miao, Guichen Gao, Yicheng Xu, Yong Zhang

Publication date 20 February 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114388

zbMATH Keywords

fair divisionpairwise maximin share

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Almost envy-freeness with general valuations
• Exact and approximation algorithms for PMMS under identical constraints
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• No justified complaints: on fair sharing of multiple resources
• Optimal bounds on the price of fairness for indivisible goods
• The efficiency of fair division
• The Nash Social Welfare Function
• The price of fairness
• The price of fairness for indivisible goods

Cited in

(1)

• Finding fair and efficient allocations of indivisible chores

This page was built for publication: The existence and efficiency of PMMS allocations

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