Envy-free relaxations for goods, chores, and mixed items

DOI10.1016/J.TCS.2024.114596MaRDI QIDQ6548959zbMATH OpenFDO

Authors Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino

Publication date 3 June 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114596

zbMATH Keywords

envy-freenessfair divisionindivisible itemsnon-additive utility functionnon-monotone utility function

Mathematics Subject Classification ID

Boolean functions (06E30) Utility theory (91B16) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Generalized binary utility functions and fair allocations
• On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
• Approximately EFX allocations for indivisible chores
• Almost envy-freeness with general valuations
• Fair division of mixed divisible and indivisible goods

Cites work

• A Little Charity Guarantees Almost Envy-Freeness
• Almost envy-freeness in group resource allocation
• Almost envy-freeness with general valuations
• Dividing bads under additive utilities
• Fair assignment of indivisible objects under ordinal preferences
• Finding fair and efficient allocations when valuations don't add up
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Maximum Nash welfare and other stories about EFX
• Near fairness in matroids
• On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
• On the fair division of a heterogeneous commodity
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• The efficiency of fair division

Cited in

(5)

• On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
• Fair division with two-sided preferences
• Fairness under equal-sized bundles: impossibility results and approximation guarantees
• Finding fair and efficient allocations of indivisible chores
• Extending EFX allocations to further multi-graph classes

This page was built for publication: Envy-free relaxations for goods, chores, and mixed items

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