Computing fair and efficient allocations with few utility values

DOI10.1007/978-3-030-85947-3_23zbMath1490.91115OpenAlexW3199007867MaRDI QIDQ2670939

Jugal Garg, Aniket Murhekar

Publication date: 1 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85947-3_23

zbMATH Keywords

EFXNash welfareEQXfair and efficient allocation

Mathematics Subject Classification ID

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

Related Items (3)

Fair division of indivisible goods: recent progress and open questions ⋮ Approximately EFX allocations for indivisible chores ⋮ Computing fair and efficient allocations with few utility values

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing Nash product social welfare in allocating indivisible goods
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• APX-hardness of maximizing Nash social welfare with indivisible items
• Efficient reallocation under additive and responsive preferences
• Maximum Nash welfare and other stories about EFX
• Approximating the Nash Social Welfare with Indivisible Items
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• On fair division for indivisible items
• Improving Nash Social Welfare Approximations
• On (1,∊)-Restricted Assignment Makespan Minimization
• Random Matching Under Dichotomous Preferences
• Sur la division pragmatique

This page was built for publication: Computing fair and efficient allocations with few utility values