Approximating maximin share allocations

DOI10.4230/OASICS.SOSA.2019.20MaRDI QIDQ6593576zbMATH OpenFDO

Authors Jugal Garg, Peter McGlaughlin, Setareh Taki

Publication date 26 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.SOSA.2019.20

zbMATH Keywords

approximation algorithmfair divisionmaximin share

Mathematics Subject Classification ID

Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Approximation algorithms for computing maximin share allocations
• Approximation Algorithms for Computing Maximin Share Allocations
• An improved approximation algorithm for maximin shares
• Fair enough: guaranteeing approximate maximin shares
• On maximin share allocations in matroids

Cited in

(10)

• A tight negative example for MMS fair allocations
• Ordinal Maximin Share Approximation for Goods
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
• On best-of-both-worlds fair-share allocations
• Maximin fair allocation of indivisible items under cost utilities
• Restricted existence and approximation algorithms for PMMS
• The budgeted maximin share allocation problem
• Maximin share allocation under knapsack constraints
• EFX exists for three agents
• Approximating proportional and maximin allocations on d-claw-free graphs

This page was built for publication: Approximating maximin share allocations

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