An improved approximation algorithm for maximin shares
- 1 November 2021
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 300
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CCF-1942321)
This publication has 9 references indexed in Scilit:
- How to Be Helpful to Multiple People at OnceCognitive Science, 2020
- Fair Allocation of Indivisible Goods to Asymmetric AgentsJournal of Artificial Intelligence Research, 2019
- On maximin share allocations in matroidsTheoretical Computer Science, 2019
- Fair EnoughJournal of the ACM, 2018
- Approximation Algorithms for Computing Maximin Share AllocationsACM Transactions on Algorithms, 2017
- Characterizing conflicts in fair division of indivisible goods using a scale of criteriaAutonomous Agents and Multi-Agent Systems, 2015
- Equilibrium pricing with positive externalitiesTheoretical Computer Science, 2013
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- A polynomial-time approximation scheme for maximizing the minimum machine completion timeOperations Research Letters, 1997