A Tight Negative Example for MMS Fair Allocations
Authors:
- 1 January 2022
- book chapter
- Published by Springer Nature
- p. 355-372
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- An Algorithmic Framework for Approximating Maximin Share Allocation of Chores2021
- An Improved Approximation Algorithm for Maximin Shares2020
- Approximation Algorithms for Maximin Fair DivisionACM Transactions on Economics and Computation, 2020
- On maximin share allocations in matroidsTheoretical Computer Science, 2019
- Fair Allocation of Indivisible Goods2018
- Fair EnoughJournal of the ACM, 2018
- Approximation Algorithms for Computing Maximin Share AllocationsACM Transactions on Algorithms, 2017
- Algorithms for Max-Min Share Fair Allocation of Indivisible ChoresProceedings of the AAAI Conference on Artificial Intelligence, 2017
- Characterizing conflicts in fair division of indivisible goods using a scale of criteriaAutonomous Agents and Multi-Agent Systems, 2015
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011