{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T22:46:03Z","timestamp":1768430763299,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789811981517","type":"print"},{"value":"9789811981524","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-981-19-8152-4_19","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:04:02Z","timestamp":1670601842000},"page":"263-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Maximin Share Based Mechanisms for\u00a0Multi-resource Fair Allocation with\u00a0Divisible and\u00a0Indivisible Tasks"],"prefix":"10.1007","author":[{"given":"Bin","family":"Deng","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":[[2022,12,10]]},"reference":[{"issue":"6","key":"19_CR1","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":"19_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.peva.2014.07.009","volume":"79","author":"T Bonald","year":"2014","unstructured":"Bonald, T., Roberts, J.: Enhanced cluster computing performance through proportional fairness. Perform. Eval. 79, 134\u2013145 (2014)","journal-title":"Perform. Eval."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feitelson, D., Halpern, J., Kupferman, R., Linial, N.: No justified complaints: on fair sharing of multiple resources. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 68\u201375. ACM, Massachusetts (2012)","DOI":"10.1145\/2090236.2090243"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Friedman, E., Ghodsi, A., Psomas, C.-A.: Strategyproof allocation of discrete jobs on multiple machines. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 529\u2013546. ACM, New York (2014)","DOI":"10.1145\/2600057.2602889"},{"key":"19_CR5","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, p. 24 (2011)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1613\/jair.4405","volume":"51","author":"I Kash","year":"2014","unstructured":"Kash, I., Procaccia, A., Shah, N.: No agent left behind: dynamic fair division of multiple resources. J. Artif. Intell. Res. 51, 579\u2013603 (2014)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3140756","volume":"65","author":"D Kurokawa","year":"2018","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. J. ACM. 65(2), 1\u201327 (2018)","journal-title":"J. ACM."},{"key":"19_CR8","first-page":"21744","volume":"34","author":"B Li","year":"2021","unstructured":"Li, B., Li, M., Zhang, R.: Fair scheduling for time-dependent resources. Adv. Neural Inf. Process. Syst. 34, 21744\u201321756 (2021)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"7","key":"19_CR9","first-page":"1534","volume":"56","author":"J Li","year":"2019","unstructured":"Li, J., Zhang, J., Li, W., Zhang, X.: A fair distribution strategy based on shared fair and time-varying resource demand. J. Comput. Res. Dev. 56(7), 1534\u20131544 (2019)","journal-title":"J. Comput. Res. Dev."},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3233\/MGS-150238","volume":"11","author":"W Li","year":"2015","unstructured":"Li, W., Liu, X., Zhang, X., Zhang, X.: Dynamic fair allocation of multiple resources with bounded number of tasks in cloud computing systems. Multiagent Grid Syst. 11(4), 245\u2013257 (2015)","journal-title":"Multiagent Grid Syst."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-59605-1_15","volume-title":"Frontiers in Algorithmics","author":"Weidong Li","year":"2017","unstructured":"Li, Weidong, Liu, Xi., Zhang, Xiaolu, Zhang, Xuejie: A further analysis of the dynamic dominant resource fairness mechanism. In: Xiao, Mingyu, Rosamond, Frances (eds.) FAW 2017. LNCS, vol. 10336, pp. 163\u2013174. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59605-1_15"},{"key":"19_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-981-10-6893-5_1","volume-title":"Theoretical Computer Science","author":"Weidong Li","year":"2017","unstructured":"Li, Weidong, Liu, Xi., Zhang, Xiaolu, Zhang, Xuejie: Multi-resource fair allocation with bounded number of tasks in cloud computing systems. In: Du, Dingzhu, Li, Lian, Zhu, En., He, Kun (eds.) NCTCS 2017. CCIS, vol. 768, pp. 3\u201317. Springer, Singapore (2017). https:\/\/doi.org\/10.1007\/978-981-10-6893-5_1"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Liu, X., Zhang, X., Zhang, X., Li, W.: Dynamic fair division of multiple resources with satiable agents in cloud computing systems. In: IEEE Fifth International Conference on Big Data and Cloud Computing, pp. 131\u2013136. IEEE, Dalian (2015)","DOI":"10.1109\/BDCloud.2015.71"},{"issue":"12","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1007\/s00607-017-0561-x","volume":"99","author":"X Liu","year":"2017","unstructured":"Liu, X., Zhang, X., Li, W., Zhang, X.: Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems. Computing 99(12), 1231\u20131255 (2017)","journal-title":"Computing"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-319-42291-6_61","volume-title":"Intelligent Computing Theories and Application","author":"Xi Liu","year":"2016","unstructured":"Liu, Xi., Zhang, Xiaolu, Li, Weidong, Zhang, Xuejie: Discrete interior search algorithm for multi-resource fair allocation in heterogeneous cloud computing systems. In: Huang, De-Shuang., Bevilacqua, Vitoantonio, Premaratne, Prashan (eds.) ICIC 2016. LNCS, vol. 9771, pp. 615\u2013626. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42291-6_61"},{"issue":"7","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/TPDS.2017.2785815","volume":"29","author":"X Liu","year":"2017","unstructured":"Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parallel Distrib. Syst. 29(7), 1650\u20131663 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"19_CR17","volume-title":"REF: Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: REF: Fair Division and Collective Welfare. MIT press, London (2004)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2739040","volume":"3","author":"D Parkes","year":"2015","unstructured":"Parkes, D., Procaccia, A., Shah, N.: Beyond dominant resource fairness: extensions, limitations, and indivisibilities. ACM Trans. Econ. Comput. 3(1), 1\u201322 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"10","key":"19_CR19","doi-asserted-by":"publisher","first-page":"2822","DOI":"10.1109\/TPDS.2014.2362139","volume":"26","author":"W Wang","year":"2015","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 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"19_CR20","unstructured":"Wang, H., Varman, P.: Balancing fairness and efficiency in tiered storage systems with bottleneck-aware allocation. In: 12th USENIX Conference on File and Storage Technologies, pp. 229\u2013242 (2014)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Wang, W., Li, B., Liang, B., Li, J.: Towards multi-resource fair allocation with placement constraints. In: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp. 415\u2013416. ACM, Antibes Juan-les-Pins (2016)","DOI":"10.1145\/2896377.2901493"},{"issue":"4","key":"19_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/2644865.2541962","volume":"49","author":"S Zahedi","year":"2014","unstructured":"Zahedi, S., Le, B.: REF: resource elasticity fairness with sharing incentives for multiprocessors. ACM SIGPLAN Not. 49(4), 145\u2013160 (2014)","journal-title":"ACM SIGPLAN Not."},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1007\/s10586-022-03548-9","volume":"25","author":"Xuejie Zhang","year":"2022","unstructured":"Zhang, Xuejie, Li, Jie, Li, Guibing, Li, Weidong: Generalized asset fairness mechanism for multi-resource fair allocation mechanism with two different types of resources. Cluster Comput. 25, 3389\u20133403 (2022). https:\/\/doi.org\/10.1007\/s10586-022-03548-9","journal-title":"Cluster Comput."},{"issue":"2","key":"19_CR24","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"},{"issue":"1","key":"19_CR25","first-page":"123","volume":"56","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Xie, N., Zhang, X., Yue, K., Li, W., Kumar, D.: Machine learning based resource allocation of cloud computing in auction. Comput. Mater. Continua 56(1), 123\u2013135 (2018)","journal-title":"Comput. Mater. Continua"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-8152-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T02:02:58Z","timestamp":1670637778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-8152-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811981517","9789811981524"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-8152-4_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}