skip to main content
10.1145/2764468.2764495acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
research-article

Dynamic Fair Division with Minimal Disruptions

Published: 15 June 2015 Publication History

Abstract

In this paper we present an analysis of dynamic fair division of a divisible resource, with arrivals and departures of agents. Our key requirement is that we wish to disrupt the allocation of at most a small number of existing agents whenever a new agent arrives. We construct optimal recursive mechanisms to compute the allocations and provide tight analytic bounds. Our analysis relies on a linear programming formulation and a reduction of the feasible region of the LP into a class of "harmonic allocations", which play a key role in the trade-off between the fairness of current allocations and the fairness of potential future allocations. We show that there exist mechanisms that are optimal with respect to fairness and are also Pareto efficient, which is of fundamental importance in computing applications, as system designers loathe to waste resources. In addition, our mechanisms satisfy a number of other desirable game theoretic properties.

References

[1]
Alon, N. 1987. Splitting necklaces. Advances in Mathematics 63, 3, 247--253.
[2]
Bhattacharya, A. A., Culler, D., Friedman, E., Ghodsi, A., Shenker, S., and Stoica, I. 2013. Hierarchical scheduling for diverse datacenter workloads. In Proceedings of the 4th Annual Symposium on Cloud Computing. SOCC '13. ACM, New York, NY, USA, 4:1--4:15.
[3]
Brams, S. J. and Taylor, A. D. 1995. An envy-free cake division protocol. American Mathematical Monthly, 9--18.
[4]
Brams, S. J. and Taylor, A. D. 1996. Fair Division: From cake-cutting to dispute resolution. Cambridge University Press.
[5]
Dolev, D., Feitelson, D. G., Halpern, J. Y., Kupferman, R., and Linial, N. 2012. No justified complaints: On fair sharing of multiple resources. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ITCS '12. ACM, New York, NY, USA, 68--75.
[6]
Dubins, L. E. and Spanier, E. H. 1961. How to cut a cake fairly. American mathematical monthly, 1--17.
[7]
Feldman, M., Fiat, A., Leonardi, S., and Sankowski, P. 2012. Revenue maximizing envy-free multi-unit auctions with budgets. In ACM Conference on Electronic Commerce, EC '12, Valencia, Spain, June 4--8, 2012. 532--549.
[8]
Friedman, E., Ghodsi, A., and Psomas, C.-A. 2014. Strategyproof allocation of discrete jobs on multiple machines. In Proceedings of the fifteenth ACM conference on Economics and computation. ACM, 529--546.
[9]
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., and Stoica, I. 2011. Dominant resource fairness: Fair allocation of multiple resource types. In Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation. NSDI'11. USENIX Association, Berkeley, CA, USA, 24--24.
[10]
Gutman, A. and Nisan, N. 2012. Fair allocation without trade. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 2. International Foundation for Autonomous Agents and Multiagent Systems, 719--728.
[11]
Kalai, E. and Smorodinsky, M. 1975. Other solutions to nash's bargaining problem. Econometrica: Journal of the Econometric Society, 513--518.
[12]
Kash, I., Procaccia, A. D., and Shah, N. 2013. No agent left behind: Dynamic fair division of multiple resources. In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, 351--358.
[13]
Milojicić, D. S., Douglis, F., Paindaveine, Y., Wheeler, R., and Zhou, S. 2000. Process migration. ACM Computing Surveys (CSUR) 32, 3, 241--299.
[14]
Parkes, D. C., Procaccia, A. D., and Shah, N. 2012. Beyond dominant resource fairness: Extensions, limitations, and indivisibilities. In Proceedings of the 13th ACM Conference on Electronic Commerce. EC '12. ACM, New York, NY, USA, 808--825.
[15]
Pazner, E. A. and Schmeidler, D. 1978. Egalitarian equivalent allocations: A new concept of economic equity. The Quarterly Journal of Economics, 671--687.
[16]
Steinhaus, H. 1948. The problem of fair division. Econometrica 16, 1.
[17]
Stromquist, W. 1980. How to cut a cake fairly. American Mathematical Monthly, 640--644.
[18]
Walsh, T. 2011. Online cake cutting. In Algorithmic Decision Theory. Springer, 292--305.
[19]
Wang, W., Li, B., and Liang, B. 2014. Dominant resource fairness in cloud computing systems with heterogeneous servers. In INFOCOM, 2014 Proceedings IEEE. IEEE, 583--591.

Cited By

View all
  • (2024)Near-Optimal Online Resource Allocation in the Random-Order ModelProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663113(2219-2221)Online publication date: 6-May-2024
  • (2024)Online Fair Allocation of Perishable ResourcesSSRN Electronic Journal10.2139/ssrn.4739232Online publication date: 2024
  • (2024)Incentives in Dominant Resource Fair Allocation Under Dynamic DemandsAlgorithmic Game Theory10.1007/978-3-031-71033-9_7(108-125)Online publication date: 31-Aug-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
EC '15: Proceedings of the Sixteenth ACM Conference on Economics and Computation
June 2015
852 pages
ISBN:9781450334105
DOI:10.1145/2764468
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 June 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. economics
  2. fair division
  3. resource allocation
  4. theory

Qualifiers

  • Research-article

Funding Sources

Conference

EC '15
Sponsor:
EC '15: ACM Conference on Economics and Computation
June 15 - 19, 2015
Oregon, Portland, USA

Acceptance Rates

EC '15 Paper Acceptance Rate 72 of 220 submissions, 33%;
Overall Acceptance Rate 664 of 2,389 submissions, 28%

Upcoming Conference

EC '25
The 25th ACM Conference on Economics and Computation
July 7 - 11, 2025
Stanford , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)17
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Near-Optimal Online Resource Allocation in the Random-Order ModelProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663113(2219-2221)Online publication date: 6-May-2024
  • (2024)Online Fair Allocation of Perishable ResourcesSSRN Electronic Journal10.2139/ssrn.4739232Online publication date: 2024
  • (2024)Incentives in Dominant Resource Fair Allocation Under Dynamic DemandsAlgorithmic Game Theory10.1007/978-3-031-71033-9_7(108-125)Online publication date: 31-Aug-2024
  • (2023)Fair Multi-Resource Allocation in Heterogeneous Servers With an External Resource TypeIEEE/ACM Transactions on Networking10.1109/TNET.2022.321342631:3(1244-1262)Online publication date: Jun-2023
  • (2023)On slots’ schedulingEconomic Theory10.1007/s00199-023-01508-x77:3(653-674)Online publication date: 28-Jul-2023
  • (2022)Dynamic fair division with partial informationProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3600538(3703-3715)Online publication date: 28-Nov-2022
  • (2020)Dynamic Weighted Fairness with Minimal DisruptionsACM SIGMETRICS Performance Evaluation Review10.1145/3410048.341005248:1(5-6)Online publication date: 9-Jul-2020
  • (2020)Dynamic Weighted Fairness with Minimal DisruptionsAbstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems10.1145/3393691.3394184(5-6)Online publication date: 8-Jun-2020
  • (2020)Dynamic Weighted Fairness with Minimal DisruptionsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/33794854:1(1-18)Online publication date: 27-May-2020
  • (2020)Incremental Throughput Allocation of Heterogeneous Storage With No Disruptions in Dynamic SettingIEEE Transactions on Computers10.1109/TC.2019.296338569:5(679-698)Online publication date: 1-May-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media