Envy-free relaxations for goods, chores, and mixed items
DOI10.1016/J.TCS.2024.114596zbMATH Open1541.91113MaRDI QIDQ6548959FDOQ6548959
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)
Recommendations
fair divisionenvy-freenessindivisible itemsnon-additive utility functionnon-monotone utility function
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Utility theory (91B16) Boolean functions (06E30)
Cites Work
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Almost envy-freeness with general valuations
- The efficiency of fair division
- On the fair division of a heterogeneous commodity
- Fair assignment of indivisible objects under ordinal preferences
- A Little Charity Guarantees Almost Envy-Freeness
- Near fairness in matroids
- Dividing bads under additive utilities
- Maximum Nash welfare and other stories about EFX
- Finding fair and efficient allocations when valuations don't add up
- Almost envy-freeness in group resource allocation
- On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Cited In (2)
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)
