Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem

DOI10.1016/j.artint.2023.104049OpenAlexW4389454822MaRDI QIDQ6152666

Saeed Seddighin, Masoud Seddighin

Publication date: 13 February 2024

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2023.104049

zbMATH Keywords

fairnessapproximationsubadditivitymaximin-shareXOS

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating Nash social welfare under binary XOS and binary subadditive valuations
• The fair division of hereditary set systems
• Maximin share guarantee for goods with positive externalities
• Approximate competitive equilibrium with generic budget
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
• Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
• How to Cut A Cake Fairly
• Approximation Algorithms for Computing Maximin Share Allocations
• Fair Enough
• An Envy-Free Cake Division Protocol
• Almost Envy-Freeness with General Valuations
• On Maximizing Welfare When Utility Functions Are Subadditive
• Approximating Nash social welfare under rado valuations
• On Fair Division under Heterogeneous Matroid Constraints
• Fair division of indivisible goods: recent progress and open questions

This page was built for publication: Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem