EFX Allocations for Indivisible Chores: Matching-Based Approach
- 4 September 2023
- book chapter
- Published by Springer Nature
- p. 257-270
Abstract
No abstract availableKeywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Envy-free Chore Division for An Arbitrary Number of Agents2018
- A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents2016
- The Unreasonable Fairness of Maximum Nash Welfare2016
- Handbook of Computational Social Choice2016
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- On approximately fair allocations of indivisible goods2004
- Cake-Cutting Algorithms1998
- Fair Division1996
- Dividing a cake fairlyJournal of Mathematical Analysis and Applications, 1980
- Sur la division pragmatiqueEconometrica, 1949