How to Make Envy Vanish Over Time
Authors:
Open Access
- 11 June 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 593-610
Abstract
No abstract availableFunding Information
- Office of Naval Research (N00014-16-1-3075 and N00014-17-1-2428)
- John Simon Guggenheim Memorial Foundation
- National Science Foundation (IIS-1350598, IIS-1714140, CCF-1525932, and CCF-1733556)
- Alfred P. Sloan Foundation
This publication has 12 references indexed in Scilit:
- Controlled Dynamic Fair Division2017
- The Unreasonable Fairness of Maximum Nash Welfare2016
- Beyond Dominant Resource FairnessACM Transactions on Economics and Computation, 2015
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit ProblemsFoundations and Trends in Machine Learning, 2012
- On approximately fair allocations of indivisible goods2004
- Rental Harmony: Sperner's Lemma in Fair DivisionThe American Mathematical Monthly, 1999
- Fair Division1996
- On the power of randomization in on-line algorithmsAlgorithmica, 1994
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Balancing gamesJournal of Combinatorial Theory, Series B, 1977