{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T18:03:13Z","timestamp":1743616993811,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"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-981-97-7801-0_15","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"171-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fair Division with\u00a0Weighted and\u00a0Prioritized Agents"],"prefix":"10.1007","author":[{"given":"Liangsen","family":"Li","sequence":"first","affiliation":[]},{"given":"Bin","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Akrami, H., Garg, J.: Breaking the 3\/4 barrier for approximate maximin share. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 74\u201391. SIAM (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.4","key":"15_CR1","DOI":"10.1137\/1.9781611977912.4"},{"doi-asserted-by":"publisher","unstructured":"Bu, X., Li, Z., Liu, S., Song, J., Tao, B.: Fair division with prioritized agents. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a037, pp. 5540\u20135548 (2023). https:\/\/doi.org\/10.1609\/aaai.v37i5.25688","key":"15_CR2","DOI":"10.1609\/aaai.v37i5.25688"},{"issue":"6","key":"15_CR3","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). https:\/\/doi.org\/10.1086\/664613","journal-title":"J. Polit. Econ."},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3457166","volume":"9","author":"M Chakraborty","year":"2021","unstructured":"Chakraborty, M., Igarashi, A., Suksompong, W., Zick, Y.: Weighted envy-freeness in indivisible item allocation. ACM Trans. Econ. Comput. (TEAC) 9(3), 1\u201339 (2021). https:\/\/doi.org\/10.1145\/3457166","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"doi-asserted-by":"publisher","unstructured":"Cohler, Y., Lai, J., Parkes, D., Procaccia, A.: Optimal envy-free cake cutting. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a025, pp. 626\u2013631 (2011). https:\/\/doi.org\/10.1609\/aaai.v25i1.7874","key":"15_CR5","DOI":"10.1609\/aaai.v25i1.7874"},{"doi-asserted-by":"crossref","unstructured":"Deng, B., Li, W.: The budgeted maximin share allocation problem (2023)","key":"15_CR6","DOI":"10.1007\/s11590-024-02145-6"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"L Dubins","year":"1961","unstructured":"Dubins, L., Spanier, E.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1\u201317 (1961). https:\/\/doi.org\/10.2307\/2311357","journal-title":"Am. Math. Mon."},{"unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale University (1966)","key":"15_CR8"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10723-024-09754-6","volume":"22","author":"H Guo","year":"2024","unstructured":"Guo, H., Li, W.: Dynamic multi-resource fair allocation with elastic demands. J. Grid Comput. 22(1), 35 (2024). https:\/\/doi.org\/10.1007\/s10723-024-09754-6","journal-title":"J. Grid Comput."},{"issue":"16","key":"15_CR10","doi-asserted-by":"publisher","first-page":"3616","DOI":"10.3390\/math11163616","volume":"11","author":"H Guo","year":"2023","unstructured":"Guo, H., Li, W., Deng, B.: A survey on fair allocation of chores. Mathematics 11(16), 3616 (2023). https:\/\/doi.org\/10.3390\/math11163616","journal-title":"Mathematics"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.future.2024.04.055","volume":"159","author":"X Li","year":"2024","unstructured":"Li, X., Hu, G., Li, W., Zhang, X.: Fair multiresource allocation with access constraint in cloud-edge systems. Futur. Gener. Comput. Syst. 159, 395\u2013410 (2024). https:\/\/doi.org\/10.1016\/j.future.2024.04.055","journal-title":"Futur. Gener. Comput. Syst."},{"key":"15_CR12","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). https:\/\/doi.org\/10.1016\/j.compeleceng.2022.108510","journal-title":"Comput. Electr. Eng."},{"doi-asserted-by":"publisher","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 125\u2013131 (2004). https:\/\/doi.org\/10.1145\/988772.988792","key":"15_CR13","DOI":"10.1145\/988772.988792"},{"doi-asserted-by":"publisher","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: Guaranteeing approximate maximin shares. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 675\u2013692 (2014). https:\/\/doi.org\/10.1145\/2600057.2602835","key":"15_CR14","DOI":"10.1145\/2600057.2602835"},{"key":"15_CR15","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":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974). https:\/\/doi.org\/10.1016\/0022-0531(74)90075-1","journal-title":"J. Econ. Theory"},{"doi-asserted-by":"publisher","unstructured":"Wu, X., Zhang, C., Zhou, S.: Weighted EF1 allocations for indivisible chores. In: Proceedings of the 24th ACM Conference on Economics and Computation, pp. 1155\u20131155 (2023). https:\/\/doi.org\/10.1145\/3580507.3597763","key":"15_CR17","DOI":"10.1145\/3580507.3597763"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:08:43Z","timestamp":1726769323000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}