{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:21:16Z","timestamp":1778127676015,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:00:00Z","timestamp":1708992000000},"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":["J Grid Computing"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10723-024-09754-6","type":"journal-article","created":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T06:02:21Z","timestamp":1709013741000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic Multi-Resource Fair Allocation with Elastic Demands"],"prefix":"10.1007","volume":"22","author":[{"given":"Hao","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,27]]},"reference":[{"key":"9754_CR1","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica. 16, 101\u2013104 (1948)","journal-title":"Econometrica."},{"issue":"2","key":"9754_CR2","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00607-021-00962-6","volume":"104","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Chi, L., Xie, N., Yang, X., Zhang, X., Li, W.: Strategy-proof mechanism for online resource allocation in cloud and edge collaboration. Computing. 104(2), 383\u2013412 (2022)","journal-title":"Computing."},{"key":"9754_CR3","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica I.: Dominant resource fairness: Fair allocation of multiple resource types. In Proceedings of the 8th USENIX conference on Networked systems design and implementation (NSDI\u201911). USENIX Association, USA. 11, 323\u2013336 (2011)"},{"key":"9754_CR4","doi-asserted-by":"crossref","unstructured":"Wang, W., Li, B., Liang, B., Li J.: Multi-resource fair sharing for datacenter jobs with placement constraints. In: SC\u201916: Proceedings of the international conference for high performance computing, networking, storage and analysis, pp. 1003\u20131014. IEEE. (2016)","DOI":"10.1109\/SC.2016.85"},{"key":"9754_CR5","doi-asserted-by":"crossref","unstructured":"Friedman, E., Psomas, C.-A., Vardi, S.: Controlled dynamic fair division. In: Proceedings of the 2017 ACM conference on economics and computation. pp. 461\u2013478 (2017)","DOI":"10.1145\/3033274.3085123"},{"issue":"7","key":"9754_CR6","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 multiresource allocation. IEEE Trans. Comput. 70(7), 1094\u20131105 (2021)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"9754_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1613\/jair.4405","volume":"51","author":"I Kash","year":"2014","unstructured":"Kash, I., Procaccia, A.D., Shah, N.: No agent left behind: Dynamic fair division of multiple resources. J. Artif. Intell. Res. 51(1), 579\u2013603 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"9754_CR8","unstructured":"Vuppalapati, M., Fikioris, G., Agarwal, R., Cidon, A., Khandelwal, A., Tardos, E.: Karma: Resource allocation for dynamic demands. arXiv:2305.17222 (2023)"},{"key":"9754_CR9","doi-asserted-by":"crossref","unstructured":"Zarchy, D., Hay, D., Schapira, M.: Capturing resource tradeoffs in fair multi-resource allocation. In: 2015 IEEE Conference on Computer Communications (INFOCOM). pp. 1062\u20131070 (2015)","DOI":"10.1109\/INFOCOM.2015.7218479"},{"key":"9754_CR10","unstructured":"Fikioris, G., Banerjee, S., Tardos, \u00c9.: Online resource sharing via dynamic max-min fairness: efficiency, robustness and non-stationarity. arXiv:2310.08881 (2023)"},{"key":"9754_CR11","doi-asserted-by":"publisher","first-page":"15927","DOI":"10.1007\/s11227-023-05248-6","volume":"79","author":"X Li","year":"2023","unstructured":"Li, X., Li, W., Zhang, X.: Multiresource fair allocation with time window constraints. J. Supercomput. 79, 15927\u201315954 (2023)","journal-title":"J. Supercomput."},{"issue":"5","key":"9754_CR12","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/TPDS.2017.2788880","volume":"29","author":"S Tang","year":"2018","unstructured":"Tang, S., Niu, Z., He, B., Lee, B.-S., Yu, C.: Long-term multi-resource fairness for pay-as-you use computing systems. IEEE Trans. Parallel Distrib. Syst. 29(5), 1147\u20131160 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"9754_CR13","doi-asserted-by":"publisher","first-page":"2822","DOI":"10.1109\/TPDS.2014.2362139","volume":"26","author":"W Wang","year":"2014","unstructured":"Wang, W., Liang, B., Li, B.: Multi-resource fair allocation in heterogeneous cloud computing systems. IEEE Trans. Parallel Distrib. Syst. 26(10), 2822\u20132835 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9754_CR14","doi-asserted-by":"crossref","unstructured":"Pang, H.H., Tan, K.-L.: Authenticating query results in edge computing. In: Proceedings 20th international conference on data engineering, pp. 560-571. IEEE. (2004)","DOI":"10.1109\/ICDE.2004.1320027"},{"key":"9754_CR15","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.compeleceng.2015.02.006","volume":"44","author":"S Ghasemi-Falavarjani","year":"2015","unstructured":"Ghasemi-Falavarjani, S., Nematbakhsh, M., Ghahfarokhi, B.S.: Context-aware multi-objective resource allocation in mobile cloud. Comput. Electr. Eng. 44, 218\u2013240 (2015)","journal-title":"Comput. Electr. Eng."},{"key":"9754_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10723-023-09680-z","volume":"21","author":"KN Tripathi","year":"2023","unstructured":"Tripathi, K.N., Kaur, G., Arora, N., Agrawal, R.: An efficient mobile edge computing based resource allocation using optimal double weighted support vector transfer regression. J. Grid Comput. 21, 49 (2023)","journal-title":"J. Grid Comput."},{"key":"9754_CR17","doi-asserted-by":"crossref","unstructured":"Meskar, E., Liang, B.: Fair multi-resource allocation with external resource for mobile edge computing. In: IEEE INFOCOM 2018-IEEE conference on computer communications workshops (INFOCOM WKSHPS), pp. 184\u2013189. IEEE. (2018)","DOI":"10.1109\/INFCOMW.2018.8406965"},{"key":"9754_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10723-021-09561-3","volume":"19","author":"P Nawrocki","year":"2021","unstructured":"Nawrocki, P., Osypanka, P.: Cloud resource demand prediction using machine learning in the context of QoS parameters. J. Grid Comp. 19, 20 (2021)","journal-title":"J. Grid Comp."},{"issue":"1","key":"9754_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2739040","volume":"3","author":"DC Parkes","year":"2015","unstructured":"Parkes, D.C., Procaccia, A.D., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans. Econ. Comput. (TEAC) 3(1), 1\u201322 (2015)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"3","key":"9754_CR20","doi-asserted-by":"publisher","first-page":"1806","DOI":"10.1109\/TCC.2020.3021084","volume":"10","author":"S Tang","year":"2022","unstructured":"Tang, S., Yu, C., Li, Y.: Fairness-efficiency scheduling for cloud computing with soft fairness guarantees. IEEE Trans. Cloud Comput. 10(3), 1806\u20131818 (2022)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"9754_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.108510","volume":"105","author":"X Li","year":"2023","unstructured":"Li, X., Li, W., Zhang, X.: Multi-resource fair allocation with bandwidth requirement compression in the cloud-edge system. Comput. Electr. Eng. 105, 108510 (2023)","journal-title":"Comput. Electr. Eng."},{"issue":"3","key":"9754_CR22","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TNET.2022.3213426","volume":"31","author":"E Meskar","year":"2022","unstructured":"Meskar, E., Liang, B.: Fair multi-resource allocation in heterogeneous servers with an external resource type. IEEE\/ACM Trans. Netw. 31(3), 1244\u20131262 (2022)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9754_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10723-021-09563-1","volume":"19","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Xie, N., Zhang, X., Li, W.: Strategy-proof mechanism for online time-varying resource allocation with restart. J. Grid Comput. 19, 25 (2021)","journal-title":"J. Grid Comput."},{"key":"9754_CR24","doi-asserted-by":"crossref","unstructured":"Correa, J., Harks, T., Schedel, A., Verschae, J.: Equilibrium dynamics in market games with exchangeable and divisible resources. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 547\u2013568. (2024)","DOI":"10.1137\/1.9781611977912.20"},{"issue":"6","key":"9754_CR25","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"key":"9754_CR26","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rauchecker, G., Schryen, G., Walsh, T.: Algorithms for max-min share fair allocation of indivisible chores. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 335\u2013341. San Francisco, CA, USA, 4-9 February 2017. (2017)","DOI":"10.1609\/aaai.v31i1.10582"},{"key":"9754_CR27","doi-asserted-by":"crossref","unstructured":"Aziz, H., Li, B., Wu X.: Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Math. Program. 1\u201327 (2022)","DOI":"10.1007\/s10107-022-01855-y"},{"key":"9754_CR28","doi-asserted-by":"crossref","unstructured":"Huang, X., Segal-Halevi, E.H.: A reduction from chores allocation to job scheduling. arXiv:2302.04581. (2023)","DOI":"10.1145\/3580507.3597676"},{"key":"9754_CR29","doi-asserted-by":"crossref","unstructured":"Deng, B., Li, W.: Maximin share based mechanisms for multi-resource fair allocation with divisible and indivisible tasks. In: Cai, Z., Chen, Y., Zhang, J. (eds.) Theoretical Computer Science, pp. 263\u2013272. Springer Nature Singapore (2022)","DOI":"10.1007\/978-981-19-8152-4_19"},{"issue":"6","key":"9754_CR30","first-page":"5119","volume":"35","author":"M Babaioff","year":"2020","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. Proc. AAAI Conf. Art. Intell. 35(6), 5119\u20135126 (2020)","journal-title":"Proc. AAAI Conf. Art. Intell."},{"key":"9754_CR31","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50, 589\u2013610 (2012)","DOI":"10.1007\/s00224-011-9359-y"},{"key":"9754_CR32","unstructured":"Alibaba cluster trace. (2018). https:\/\/github.com\/alibaba\/clusterdata\/tree\/ master\/cluster trace-v2018"}],"container-title":["Journal of Grid Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-024-09754-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10723-024-09754-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-024-09754-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T23:18:12Z","timestamp":1731453492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10723-024-09754-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,27]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["9754"],"URL":"https:\/\/doi.org\/10.1007\/s10723-024-09754-6","relation":{},"ISSN":["1570-7873","1572-9184"],"issn-type":[{"value":"1570-7873","type":"print"},{"value":"1572-9184","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,27]]},"assertion":[{"value":"15 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}},{"value":"This article does not contain any studies","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"35"}}