No agent left behind: Dynamic fair division of multiple resources

Journal of Artificial Intelligence Research

Volumn 51, Issue , 2014, Pages 579-603

  Kash, Ian ^a   Procaccia, Ariel D ^b   Shah, Nisarg ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MULTI AGENT SYSTEMS; RESOURCE ALLOCATION;

COMPUTATIONAL RESOURCES; CONCEPTUAL LEVELS; DYNAMIC RESOURCE ALLOCATIONS; DYNAMIC SETTINGS; FAIR DIVISIONS; FAIR RESOURCE ALLOCATION; MULTIPLE RESOURCES; TECHNICAL LEVELS;

DYNAMICS;

EID: 84914820748     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.4405     Document Type: Article

References (19)

1. Brams, S. J., & Taylor, A. D. (1996). Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press.
2. Chen, Y., Lai, J. K., Parkes, D. C., & Procaccia, A. D. (2010). Truth, justice, and cake cutting. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI), pp. 756-761.
3. Chevaleyre, Y., Dunne, P. E., Endriss, U., Lang, J., Lemaître, M., Maudet, N., Padget, J., Phelps, S., Rodrîguez-Aguilar, J. A., & Sousa, P. (2006). Issues in multiagent resource allocation. Informatica, 30, 3-31.
4. Chevaleyre, Y., Endriss, U., Estivie, S., & Maudet, N. (2007). Reaching envy-free states in distributed negotiation settings. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1239-1244.
5. Demers, A., Keshav, S., & Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. In Proceedings of the ACM Symposium on Communications Architectures & Protocols (SIGCOMM), pp. 1-12.
6. Dolev, D., Feitelson, D. G., Halpern, J. Y., Kupferman, R., & Linial, N. (2012). No justified complaints: On fair sharing of multiple resources. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS), pp. 68-75.
7. Ghodsi, A., Sekar, V., Zaharia, M., & Stoica, I. (2012). Multi-resource fair queueing for packet processing. In Proceedings of the ACM Symposium on Communications Architectures & Protocols (SIGCOMM), pp. 1-12.
8. Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., & 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), pp. 24-37.
9. Ghodsi, A., Zaharia, M., Shenker, S., & Stoica, I. (2013). Choosy: Max-min fair sharing for data-center jobs with constraints. In Proceedings of the 8th ACM European Conference on Computer Systems (EUROSYS), pp. 365-378.
10. Gutman, A., & Nisan, N. (2012). Fair allocation without trade. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 719-728.
11. Hellerstein, J. L. (2010). Google cluster data. Google research blog. Posted at http://googleresearch.blogspot.com/2010/01/google-cluster-data.html.
12. Joe-Wong, C., Sen, S., Lan, T., & Chiang, M. (2012). Multi-resource allocation: Fairness-efficiency tradeoffs in a unifying framework. In Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM), pp. 1206-1214.
13. Li, J., & Xue, J. (2013). Egalitarian division under Leontief preferences. Economic Theory, 54(3), 597-622.
14. Moulin, H. (2003). Fair Division and Collective Welfare. MIT Press.
15. Moulin, H., & Stong, R. (2002). Fair queuing and other probabilistic allocation methods. Mathematics of Operations Research, 27 (1), 1-30.
16. Parkes, D. C., Procaccia, A. D., & Shah, N. (2014). Beyond Dominant Resource Fairness: Extensions, limitations, and indivisibilities. ACM Transactions on Economics and Computation. Forthcoming.
17. Procaccia, A. D. (2009). Thou shalt covet thy neighbor's cake. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 239-244.
18. Walsh, T. (2011). Online cake cutting. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT), pp. 292-305.
19. Zahedi, S. M., & Lee, B. C. (2014). REF: Resource elasticity fairness with sharing incentives for multiprocessors. In Proceedings of the 19th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 145-160.