{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,15]],"date-time":"2026-11-15T23:46:09Z","timestamp":1794786369377,"version":"4.9.1"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031710322","type":"print"},{"value":"9783031710339","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_7","type":"book-chapter","created":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T20:02:17Z","timestamp":1725307337000},"page":"108-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Incentives in\u00a0Dominant Resource Fair Allocation Under Dynamic Demands"],"prefix":"10.1007","author":[{"given":"Giannis","family":"Fikioris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rachit","family":"Agarwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-030-29908-8_42","volume-title":"PRICAI 2019: Trends in Artificial Intelligence","author":"M Aleksandrov","year":"2019","unstructured":"Aleksandrov, M., Walsh, T.: Strategy-proofness, envy-freeness and pareto efficiency in online fair division with additive utilities. In: Nayak, A.C., Sharma, A. (eds.) PRICAI 2019. LNCS (LNAI), vol. 11670, pp. 527\u2013541. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29908-8_42"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alizadeh, M., et al.: Data center TCP (DCTCP). In: Proceedings of the ACM SIGCOMM 2010 Conference (2010)","DOI":"10.1145\/1851182.1851192"},{"key":"7_CR3","unstructured":"Archer, A., Papadimitriou, C.H., Talwar, K., Tardos, \u00c9.: An approximate truthful mechanism for combinatorial auctions with single parameter agents. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, USA, 12\u201314 January 2003 (2003)"},{"issue":"1","key":"7_CR4","first-page":"81","volume":"86","author":"EM Azevedo","year":"2018","unstructured":"Azevedo, E.M., Budish, E.: Strategy-proofness in the large. Rev. Econ. Stud. 86(1), 81\u2013116 (2018)","journal-title":"Rev. Econ. Stud."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Balcan, M., Sandholm, T., Vitercik, E.: Estimating approximate incentive compatibility. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, 24\u201328 June 2019 (2019)","DOI":"10.1145\/3328526.3329628"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1287\/opre.2022.2359","volume":"72","author":"SR Balseiro","year":"2024","unstructured":"Balseiro, S.R., Besbes, O., Castro, F.: Mechanism design under approximate incentive compatibility. Oper. Res. 72(1), 355\u2013372 (2024)","journal-title":"Oper. Res."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bei, X., Huang, Z.: Bayesian incentive compatibility via fractional assignments. In: Randall, D. (ed.) Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011. SIAM (2011)","DOI":"10.1137\/1.9781611973082.57"},{"key":"7_CR8","unstructured":"Boutin, E., et al.: Apollo: scalable and coordinated scheduling for cloud-scale computing. In: Flinn, J., Levy, H. (eds.) 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2014, Broomfield, CO, USA, 6\u20138 October 2014. USENIX Association (2014)"},{"key":"7_CR9","unstructured":"Chaubal, C.: The architecture of VMWare ESXi. VMware White Paper (7) (2008)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Anwar, A., Duan, X.: Analyzing Alibaba\u2019s co-located datacenter workloads. In: 2018 IEEE International Conference on Big Data (Big Data). IEEE (2018)","DOI":"10.1109\/BigData.2018.8622518"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0169-7552(89)90019-6","volume":"17","author":"DM Chiu","year":"1989","unstructured":"Chiu, D.M., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Comput. Netw. ISDN Syst. 17(1), 1\u201314 (1989)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"7_CR12","unstructured":"Dekel, O., Fischer, F.A., Procaccia, A.D.: Incentive compatible regression learning. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, 20\u201322 January 2008 (2008)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Fischer, F.A., Jirapinyo, P., Lai, J.K., Lubin, B., Parkes, D.C.: Payment rules through discriminant-based classifiers. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, 4\u20138 June 2012 (2012)","DOI":"10.1145\/2229012.2229048"},{"key":"7_CR14","unstructured":"D\u00fctting, P., Roughgarden, T., Talgam-Cohen, I.: The complexity of contracts. In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5\u20138 January 2020. SIAM (2020)"},{"key":"7_CR15","unstructured":"Fikioris, G., Agarwal, R., Tardos, \u00c9.: Incentives in dominant resource fair allocation under dynamic demands (2022). https:\/\/arxiv.org\/abs\/2109.12401"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Freeman, R., Zahedi, S.M., Conitzer, V., Lee, B.C.: Dynamic proportional sharing: a game-theoretic approach. In: Proceedings of the ACM on Measurement and Analysis of Computing Systems (2018)","DOI":"10.1145\/3219617.3219631"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Friedman, E.J., Psomas, C., Vardi, S.: Dynamic fair division with minimal disruptions. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC 2015, Portland, OR, USA, 15\u201319 June 2015. ACM (2015)","DOI":"10.1145\/2764468.2764495"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Friedman, E.J., Psomas, C., Vardi, S.: Controlled dynamic fair division. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, Cambridge, MA, USA, 26\u201330 June 2017. ACM (2017)","DOI":"10.1145\/3033274.3085123"},{"key":"7_CR19","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: Andersen, D.G., Ratnasamy, S. (eds.) Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2011, Boston, MA, USA, 30 March\u20131 April 2011 (2011)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., Akella, A.: Multi-resource packing for cluster schedulers. In: ACM SIGCOMM 2014 Conference, SIGCOMM 2014, Chicago, IL, USA, 17\u201322 August 2014 (2014)","DOI":"10.1145\/2619239.2626334"},{"key":"7_CR21","unstructured":"Grandl, R., Chowdhury, M., Akella, A., Ananthanarayanan, G.: Altruistic scheduling in multi-resource clusters. In: 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2016, Savannah, GA, USA, 2\u20134 November 2016 (2016)"},{"key":"7_CR22","unstructured":"Grandl, R., Kandula, S., Rao, S., Akella, A., Kulkarni, J.: GRAPHENE: packing and dependency-aware scheduling for data-parallel clusters. In: 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2016, Savannah, GA, USA, 2\u20134 November 2016 (2016)"},{"key":"7_CR23","unstructured":"Harada, M.: The ad exchanges place in a first-price world (2018)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Taggart, S.: Sample complexity for non-truthful mechanisms. In: Karlin, A., Immorlica, N., Johari, R. (eds.) Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, 24\u201328 June 2019. ACM (2019)","DOI":"10.1145\/3328526.3329632"},{"key":"7_CR25","unstructured":"Hindman, B., et al.: Mesos: a platform for fine-grained resource sharing in the data center. In: Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2011, Boston, MA, USA, 30 March\u20131 April 2011 (2011)"},{"key":"7_CR26","unstructured":"Hossain, R.: Sharing is caring: dynamic mechanism for shared resource ownership. In: Elkind, E., Veloso, M., Agmon, N., Taylor, M.E. (eds.) Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2019, Montreal, QC, Canada, 13\u201317 May 2019. International Foundation for Autonomous Agents and Multiagent Systems (2019)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B., Munagala, K., Pruhs, K.: Dynamic weighted fairness with minimal disruptions. In: Abstracts of the 2020 SIGMETRICS\/Performance Joint International Conference on Measurement and Modeling of Computer Systems, Boston, MA, USA, 8\u201312 June 2020. ACM (2020)","DOI":"10.1145\/3393691.3394184"},{"key":"7_CR28","unstructured":"Kandasamy, K., Sela, G., Gonzalez, J.E., Jordan, M.I., Stoica, I.: Online learning demands in max-min fairness. CoRR (2020)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Kanoria, Y., Nazerzadeh, H.: Incentive-compatible learning of reserve prices for repeated auctions. In: Companion of The 2019 World Wide Web Conference, WWW 2019, San Francisco, CA, USA, 13\u201317 May 2019. ACM (2019)","DOI":"10.1145\/3308560.3316526"},{"key":"7_CR30","unstructured":"Kash, I.A., Procaccia, A.D., Shah, N.: No agent left behind: dynamic fair division of multiple resources. In: Gini, M.L., Shehory, O., Ito, T., Jonker, C.M. (eds.) International Conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2013, Saint Paul, MN, USA, 6\u201310 May 2013. IFAAMAS (2013)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Kothari, A., Parkes, D.C., Suri, S.: Approximately-strategyproof and tractable multi-unit auctions. In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, 9\u201312 June 2003 (2003)","DOI":"10.1145\/779928.779948"},{"key":"7_CR32","unstructured":"Krishna, V.: Auction Theory. Academic Press (2009)"},{"key":"7_CR33","unstructured":"KVM: Main page\u2014KVM (2016)"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Li, B., Li, W., Li, Y.: Dynamic fair division problem with general valuations. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018 (2018)","DOI":"10.24963\/ijcai.2018\/52"},{"issue":"9","key":"7_CR35","first-page":"1021","volume":"103","author":"B Lubin","year":"2012","unstructured":"Lubin, B., Parkes, D.C.: Approximate strategyproofness. Curr. Sci. 103(9), 1021\u20131032 (2012)","journal-title":"Curr. Sci."},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Mennle, T., Seuken, S.: An axiomatic approach to characterizing and relaxing strategyproofness of one-sided matching mechanisms. In: ACM Conference on Economics and Computation, EC 2014, Stanford , CA, USA, 8\u201312 June 2014 (2014)","DOI":"10.1145\/2600057.2602885"},{"issue":"2","key":"7_CR37","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1111\/j.1465-7295.2010.00357.x","volume":"49","author":"P Milgrom","year":"2011","unstructured":"Milgrom, P.: Critical issues in the practice of market design. Econ. Inq. 49(2), 311\u2013320 (2011)","journal-title":"Econ. Inq."},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Parkes, D.C., Procaccia, A.D., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, 4\u20138 June 2012. ACM (2012)","DOI":"10.1145\/2229012.2229075"},{"key":"7_CR39","unstructured":"Parkin, R.: A year in first-price (2018)"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Reiss, C., Tumanov, A., Ganger, G.R., Katz, R.H., Kozuch, M.A.: Heterogeneity and dynamicity of clouds at scale: Google trace analysis. In: Proceedings of the Third ACM Symposium on Cloud Computing (2012)","DOI":"10.1145\/2391229.2391236"},{"issue":"7","key":"7_CR41","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TC.2020.3006007","volume":"70","author":"H Sadok","year":"2021","unstructured":"Sadok, H., Campista, M.E.M., Costa, L.H.M.K.: Stateful DRF: considering the past in a multi-resource allocation. IEEE Trans. Comput. 70(7), 1094\u20131105 (2021)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR42","unstructured":"Shue, D., Freedman, M.J., Shaikh, A.: Performance isolation and fairness for multi-tenant cloud storage. In: Thekkath, C., Vahdat, A. (eds.) 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2012, Hollywood, CA, USA, 8\u201310 October 2012 (2012)"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Vavilapalli, V.K., et al.: Apache hadoop yarn: yet another resource negotiator. In: Proceedings of the 4th Annual Symposium on Cloud Computing (2013)","DOI":"10.1145\/2523616.2523633"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Verbitski, A., et al.: Amazon aurora: design considerations for high throughput cloud-native relational databases. In: Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, 14\u201319 May 2017. ACM (2017)","DOI":"10.1145\/3035918.3056101"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Verma, A., Pedrosa, L., Korupolu, M.R., Oppenheimer, D., Tune, E., Wilkes, J.: Large-scale cluster management at Google with Borg. In: Proceedings of the European Conference on Computer Systems (EuroSys), Bordeaux, France (2015)","DOI":"10.1145\/2741948.2741964"},{"key":"7_CR46","unstructured":"Vuppalapati, M., Fikioris, G., Agarwal, R., Cidon, A., Khandelwal, A., Tardos, \u00c9.: Karma: resource allocation for dynamic demands. In: 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2023) (2023)"},{"key":"7_CR47","unstructured":"Vuppalapati, M., Miron, J., Agarwal, R., Truong, D., Motivala, A., Cruanes, T.: Building an elastic query engine on disaggregated storage. In: 17th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2020, Santa Clara, CA, USA, 25\u201327 February 2020. USENIX Association (2020)"},{"key":"7_CR48","unstructured":"Vuppalapati, M., Miron, J., Agarwal, R., Truong, D., Motivala, A., Cruanes, T.: Building an elastic query engine on disaggregated storage. In: Bhagwan, R., Porter, G. (eds.) 17th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2020, Santa Clara, CA, USA, 25\u201327 February 2020 (2020)"},{"key":"7_CR49","unstructured":"Yang, J., Yue, Y., Rashmi, K.V.: A large scale analysis of hundreds of in-memory cache clusters at Twitter. In: 14th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2020, Virtual Event, 4\u20136 November 2020. USENIX Association (2020)"},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"Zeng, D., Psomas, A.: Fairness-efficiency tradeoffs in dynamic fair division. In: EC 2020: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, 13\u201317 July 2020. ACM (2020)","DOI":"10.1145\/3391403.3399467"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71033-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T20:03:37Z","timestamp":1725307417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_7","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}