Exact and approximation algorithms for PMMS under identical constraints

DOI10.1007/978-3-031-20350-3_26MaRDI QIDQ6111969

Yong Zhang, Sijia Dai, Guichen Gao, Xinru Guo

Publication date: 4 August 2023

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

zbMATH Keywords

fair divisionmaximum Nash social welfarepairwise maximin share

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The existence and efficiency of PMMS allocations

Cites Work

• Competitive algorithms for unbounded one-way trading
• APX-hardness of maximizing Nash social welfare with indivisible items
• Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
• No justified complaints
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• The Nash Social Welfare Function
• Fair Enough
• Almost Envy-Freeness with General Valuations

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