Improved approximation of maximin share fair allocation under generalized assignment constraints

DOI10.1007/978-981-96-8312-3_25MaRDI QIDQ6897265zbMATH OpenFDO

Authors Bo Li, Md Habibur Rahman Sifat, Ankang Sun

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-8312-3_25

zbMATH Keywords

fair divisionmaximin sharegeneralized assignment constraint

Mathematics Subject Classification ID

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

Cites work

• A tight negative example for MMS fair allocations
• An improved approximation algorithm for maximin shares
• Breaking the 3/4 barrier for approximate maximin share
• Fair allocation of indivisible goods: beyond additive valuations
• Fair enough: guaranteeing approximate maximin shares
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem

This page was built for publication: Improved approximation of maximin share fair allocation under generalized assignment constraints

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