On maximin share allocations in matroids
Authors:
- Laurent GourvèsLGLaurent Gourvès
- Jérôme MonnotJMJérôme Monnot
- 1 January 2019
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 754, 50-64
Abstract
No abstract availableKeywords
Funding Information
- CoCoRICo-CoDec (ANR-14-CE24-0007-01)
This publication has 10 references indexed in Scilit:
- Worst case compromises in matroids with applications to the allocation of indivisible goodsTheoretical Computer Science, 2015
- 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
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible GoodsSIAM Journal on Computing, 2010
- A polynomial-time approximation scheme for maximizing the minimum machine completion timeOperations Research Letters, 1997
- Equitable distribution of indivisible objectsMathematical Social Sciences, 1988
- Partitioning General Probability MeasuresThe Annals of Probability, 1987
- Some Abstract Pivot AlgorithmsSIAM Journal on Applied Mathematics, 1975
- An exchange theorem for bases of matroidsJournal of Combinatorial Theory, Series B, 1974
- Comments on bases in dependence structuresBulletin of the Australian Mathematical Society, 1969