Exact and approximation algorithms for PMMS under identical constraints

DOI10.1007/978-3-031-20350-3_26MaRDI QIDQ6111969zbMATH OpenFDO

Authors Sijia Dai, Guichen Gao, Xinru Guo, Yong Zhang

Publication date 4 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20350-3_26

zbMATH Keywords

fair divisionmaximum Nash social welfarepairwise maximin share

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Almost envy-freeness with general valuations
• APX-hardness of maximizing Nash social welfare with indivisible items
• Competitive algorithms for unbounded one-way trading
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• Fair enough: guaranteeing approximate maximin shares
• 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
• The Nash Social Welfare Function

Cited in

(1)

• The existence and efficiency of PMMS allocations

This page was built for publication: Exact and approximation algorithms for PMMS under identical constraints

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