{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:00Z","timestamp":1759638960548,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"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-3-031-20350-3_26","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"322-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact and Approximation Algorithms for PMMS Under Identical Constraints"],"prefix":"10.1007","author":[{"given":"Sijia","family":"Dai","sequence":"first","affiliation":[]},{"given":"Guichen","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Xinru","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Markakis, V.: Comparing approximate relaxations of envy-freeness. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 42\u201348. IJCAI2018, AAAI Press, Stockholm, Sweden (2018)","DOI":"10.24963\/ijcai.2018\/6"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.tcs.2020.07.006","volume":"841","author":"G Amanatidis","year":"2020","unstructured":"Amanatidis, G., Markakis, E., Ntokos, A.: Multiple birds with one stone: beating 1\/2 for EFX and GMMS via envy cycle elimination. Theoret. Comput. Sci. 841, 94\u2013109 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 19th ACM Conference on Economics and Computation, pp. 557\u2013574. EC 2018, ACM, New York, NY, USA (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Barman, S., Murthy, S.K.K.: Approximation algorithms for maximin fair division. In: Proceedings of the 18th ACM Conference on Economics and Computation, pp. 647\u2013664. EC 2017, ACM, New York, NY, USA (2017)","DOI":"10.1145\/3033274.3085136"},{"key":"26_CR5","unstructured":"Barman, S., Verma, P.: Existence and computation of maximin fair allocations under matroid-rank valuations. In: Dignum, F., Lomuscio, A., Endriss, U., Now\u00e9, A. (eds.) Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp. 169\u2013177. AAMAS2021, ACM, Virtual Event, United Kingdom (2021)"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Lema\u00eetre, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi Agent Syst. 30(2), 259\u2013290 (2016)","journal-title":"Auton. Agents Multi Agent Syst."},{"issue":"6","key":"26_CR7","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."},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TNSE.2018.2830307","volume":"7","author":"Z Cai","year":"2020","unstructured":"Cai, Z., Zheng, X.: A private and efficient mechanism for data uploading in smart cyber-physical systems. IEEE Trans. Netw. Sci. Eng. 7(2), 766\u2013775 (2020)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. ACM Trans. Econ. Comput. 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 1\u201319. EC 2020, ACM, New York, NY, USA (2020)","DOI":"10.1145\/3391403.3399511"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., et al.: Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607, 35\u201348 (2015)","DOI":"10.1016\/j.tcs.2015.05.034"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, D., Feitelson, D.G., Halpern, J.Y., Kupferman, R., Linial, N.: No justified complaints: on fair sharing of multiple resources. In: Innovations in Theoretical Computer Science, pp. 68\u201375. ITCS2012, ACM, New York, NY, USA (2012)","DOI":"10.1145\/2090236.2090243"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Stat. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Stat."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Etsion, Y., Ben-Nun, T., Feitelson, D.G.: A global scheduling framework for virtualization environments. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, pp. 1\u20138. IPDPS 2009, IEEE, Rome, Italy (2009)","DOI":"10.1109\/IPDPS.2009.5161228"},{"key":"26_CR15","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, pp. 323\u2013336. NSDI2011, USENIX Association, USA (2011)"},{"key":"26_CR16","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, pp. 455\u2013466. SIGCOMM 2014, ACM, Chicago, IL, USA (2014)","DOI":"10.1145\/2619239.2626334"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.2307\/1914191","volume":"47","author":"M Kaneko","year":"1979","unstructured":"Kaneko, M., Nakamura, K.: The Nash social welfare function. Econometrica 47(2), 423\u2013435 (1979)","journal-title":"Econometrica"},{"key":"26_CR18","unstructured":"Kurokawa, D.: Fair Division in Game Theoretic Settings. Carnegie Mellon University (2017)"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ipl.2017.01.012","volume":"122","author":"E Lee","year":"2017","unstructured":"Lee, E.: APX-hardness of maximizing Nash social welfare with indivisible items. Inf. Process. Lett. 122, 17\u201320 (2017)","journal-title":"Inf. Process. Lett."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Lipton, R., 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. EC 2004, ACM, New York, NY, USA (2004)","DOI":"10.1145\/988772.988792"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair division and collective welfare, vol. 1. MIT Press, 1st edn. (2003)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"issue":"2","key":"26_CR22","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. SIAM J. Discret. Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the 15th ACM Conference on Economics and Computation, pp. 675\u2013692. EC 2014, ACM, New York, NY, USA (2014)","DOI":"10.1145\/2600057.2602835"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:25:50Z","timestamp":1672550750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","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":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"0","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":"44% - 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":"7","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)"}}]}}