{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:29:37Z","timestamp":1767338977598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030946753"},{"type":"electronic","value":"9783030946760"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-94676-0_9","type":"book-chapter","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:03:08Z","timestamp":1642694588000},"page":"149-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Amanatidis","sequence":"first","affiliation":[]},{"given":"Georgios","family":"Birmpas","sequence":"additional","affiliation":[]},{"given":"Federico","family":"Fusco","sequence":"additional","affiliation":[]},{"given":"Philip","family":"Lazos","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"Rebecca","family":"Reiffenh\u00e4user","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Christodoulou, G., Markakis, E.: Truthful allocation mechanisms without payments: characterization and implications on fairness. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, pp. 545\u2013562. ACM (2017)","DOI":"10.1145\/3033274.3085147"},{"key":"9_CR2","unstructured":"Amanatidis, G., Birmpas, G., Fusco, F., Lazos, P., Leonardi, S., Reiffenh\u00e4user, R.: Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness. CoRR abs\/2109.08644 (2021). https:\/\/arxiv.org\/abs\/2109.08644"},{"key":"9_CR3","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: On truthful mechanisms for maximin share allocations. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI 2016, pp. 31\u201337. IJCAI\/AAAI Press (2016)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: Comparing approximate relaxations of envy-freeness. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 42\u201348 (2018). ijcai.org","DOI":"10.24963\/ijcai.2018\/6"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms 13(4), 52:1\u201352:28 (2017)","DOI":"10.1145\/3147173"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Aziz, H., Bouveret, S., Lang, J., Mackenzie, S.: Complexity of manipulating sequential allocation. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI 2017, pp. 328\u2013334. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10586"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-67504-6_19","volume-title":"Algorithmic Decision Theory","author":"H Aziz","year":"2017","unstructured":"Aziz, H., Goldberg, P., Walsh, T.: Equilibria in sequential allocation. In: Rothe, J. (ed.) ADT 2017. LNCS (LNAI), vol. 10576, pp. 270\u2013283. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67504-6_19"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Barman, S., Biswas, A., Murthy, S.K.K., Narahari, Y.: Groupwise maximin fair allocation of indivisible goods. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, pp. 917\u2013924. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11463"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: Approximation algorithms for maximin fair division. ACM Trans. Econ. Comput. 8(1), 5:1\u20135:28 (2020)","DOI":"10.1145\/3381525"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Huzhang, G., Tao, B., Wu, J.: Cake cutting: envy and truth. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 3625\u20133631 (2017). ijcai.org","DOI":"10.24963\/ijcai.2017\/507"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair allocation of indivisible goods. In: Handbook of Computational Social Choice, pp. 284\u2013310. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.013"},{"key":"9_CR12","unstructured":"Bouveret, S., Lang, J.: Manipulating picking sequences. In: Proceedings of the 21st European Conference on Artificial Intelligence - ECAI 2014, vol. 263, pp. 141\u2013146. IOS Press (2014)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Br\u00e2nzei, S., Caragiannis, I., Kurokawa, D., Procaccia, A.D.: An algorithmic framework for strategic fair division. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence AAAI 2016, pp. 418\u2013424. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10042"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Br\u00e2nzei, S., Gkatzelis, V., Mehta, R.: Nash social welfare approximation for strategic agents. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, pp. 611\u2013628. ACM (2017)","DOI":"10.1145\/3033274.3085143"},{"issue":"6","key":"9_CR15","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":"9_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-04428-1_10","volume-title":"Algorithmic Decision Theory","author":"I Caragiannis","year":"2009","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On low-envy truthful allocations. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS (LNAI), vol. 5783, pp. 111\u2013119. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04428-1_10"},{"key":"9_CR17","doi-asserted-by":"crossref","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), 12:1\u201312:32 (2019)","DOI":"10.1145\/3355902"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the 2020 ACM Conference on Economics and Computation, EC 2020, pp. 1\u201319. ACM (2020)","DOI":"10.1145\/3391403.3399511"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games Econ. Behav. 77(1), 284\u2013297 (2013)","journal-title":"Games Econ. Behav."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Cole, R., Gkatzelis, V., Goel, G.: Mechanism design for fair division: allocating divisible items without payments. In: Proceedings of the 14th ACM Conference on Electronic Commerce, EC 2013, pp. 251\u2013268. ACM (2013)","DOI":"10.1145\/2482540.2482582"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00355-003-0259-1","volume":"21","author":"L Ehlers","year":"2003","unstructured":"Ehlers, L., Klaus, B.: Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems. Soc. Choice Welf. 21(2), 265\u2013280 (2003)","journal-title":"Soc. Choice Welf."},{"key":"9_CR22","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Economics Essays 7, 45\u201398 (1967)","journal-title":"Yale Economics Essays"},{"key":"9_CR23","unstructured":"Gamow, G., Stern, M.: Puzzle-Math. Viking press, New York (1958)"},{"key":"9_CR24","unstructured":"Garg, J., McGlaughlin, P., Taki, S.: Approximating maximin share allocations. In: Proceedings of the 2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019. OASICS, vol. 69, pp. 20:1\u201320:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. In: Proceedings of the 2020 ACM Conference on Economics and Computation, EC 2020, pp. 379\u2013380. ACM (2020)","DOI":"10.1145\/3391403.3399526"},{"issue":"3","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1287\/moor.2020.1096","volume":"46","author":"M Ghodsi","year":"2021","unstructured":"Ghodsi, M., Hajiaghayi, M.T., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: improvements and generalizations. Math. Oper. Res. 46(3), 1038\u20131053 (2021)","journal-title":"Math. Oper. Res."},{"key":"9_CR27","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Near fairness in matroids. In: Proceedings of the 21st European Conference on Artificial Intelligence - ECAI 2014, vol. 263, pp. 393\u2013398. IOS Press (2014)"},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s001820100088","volume":"30","author":"B Klaus","year":"2002","unstructured":"Klaus, B., Miyagawa, E.: Strategy-proofness, solidarity, and consistency for multiple assignment problems. Int. J. Game Theory 30(3), 421\u2013435 (2002)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"9_CR29","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/opre.19.2.270","volume":"19","author":"DA Kohler","year":"1971","unstructured":"Kohler, D.A., Chandrasekaran, R.: A class of sequential games. Oper. Res. 19(2), 270\u2013277 (1971)","journal-title":"Oper. Res."},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. J. ACM 65(2), 8:1\u20138:27 (2018)","DOI":"10.1145\/3140756"},{"key":"9_CR31","doi-asserted-by":"crossref","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, EC 2004, pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"key":"9_CR32","unstructured":"Markakis, E.: Approximation algorithms and hardness results for fair division with indivisible goods. In: Trends in Computational Social Choice, Chap. 12. AI Access (2017)"},{"issue":"1","key":"9_CR33","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s100580050049","volume":"5","author":"S Papai","year":"2000","unstructured":"Papai, S.: Strategyproof multiple assignment using quotas. Rev. Econ. Design 5(1), 91\u2013105 (2000)","journal-title":"Rev. Econ. Design"},{"issue":"3","key":"9_CR34","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/1097-3923.00066","volume":"3","author":"S Papai","year":"2001","unstructured":"Papai, S.: Strategyproof and nonbossy multiple assignments. J. Public Econ. Theory 3(3), 257\u2013271 (2001)","journal-title":"J. Public Econ. Theory"},{"issue":"2","key":"9_CR35","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":"9_CR36","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Cake cutting algorithms. In: Handbook of Computational Social Choice, pp. 311\u2013330. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.014"},{"issue":"Supplement","key":"9_CR37","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/1907319","volume":"17","author":"H Steinhaus","year":"1949","unstructured":"Steinhaus, H.: Sur la division pragmatique. Econometrica 17(Supplement), 315\u2013319 (1949)","journal-title":"Econometrica"},{"key":"9_CR38","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, 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"9_CR39","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger, G.J.: A polynomial-time approximation scheme for maximizing the minimum machine completion time. Oper. Res. Lett. 20(4), 149\u2013154 (1997)","journal-title":"Oper. Res. Lett."},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Xiao, M., Ling, J.: Algorithms for manipulating sequential allocation. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence, AAAI 2020, pp. 2302\u20132309. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5608"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94676-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T22:13:11Z","timestamp":1674511991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94676-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030946753","9783030946760"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94676-0_9","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":"20 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","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":"wine2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/hpi.de\/wine2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"41","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":"11","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":"28% - 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.07","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}