{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:58Z","timestamp":1778495158779,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031489730","type":"print"},{"value":"9783031489747","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"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-3-031-48974-7_24","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"420-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Price of\u00a0Anarchy of\u00a0Probabilistic Serial in\u00a0One-Sided Allocation Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5978-4220","authenticated-orcid":false,"given":"Sissi","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4920-6566","authenticated-orcid":false,"given":"Ndiame","family":"Ndiaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2213-4937","authenticated-orcid":false,"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-3387","authenticated-orcid":false,"given":"Eggie","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abdulkadirogl, A., Sonmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689\u2013701 (1998). http:\/\/www.jstor.org\/stable\/2998580","DOI":"10.2307\/2998580"},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Abdulkadirogl, A., Sonmez, T.: Matching Markets: Theory and Practice, Econometric Society Monographs, vol. 1, pp. 3\u201347. Cambridge University Press, Cambridge (2013). https:\/\/doi.org\/10.1017\/CBO9781139060011.002","DOI":"10.1017\/CBO9781139060011.002"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1287\/opre.2019.1887","volume":"68","author":"I Ashlagi","year":"2020","unstructured":"Ashlagi, I., Saberi, A., Shameli, A.: Assignment mechanisms under distributional constraints. Oper. Res. 68(2), 467\u2013479 (2020). https:\/\/doi.org\/10.1287\/opre.2019.1887","journal-title":"Oper. Res."},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Narodytska, N., Walsh, T.: Equilibria under the probabilistic serial rule. In: Proceedings of 24th International Conference on Artificial Intelligence (AAAI), pp. 1105\u20131112 (2015). https:\/\/doi.org\/10.48550\/ARXIV.1502.04888, https:\/\/arxiv.org\/abs\/1502.04888","DOI":"10.48550\/ARXIV.1502.04888"},{"key":"24_CR5","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Narodytska, N., Walsh, T.: Manipulating the probabilistic serial rule. In: Proceeding of Autonomous Agents and Multiagent Systems International Conference (AAMAS), pp. 1451\u20131459 (2015). https:\/\/arxiv.org\/abs\/1502.04888"},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001). https:\/\/doi.org\/10.1006\/jeth.2000.2710, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022053100927108","DOI":"10.1006\/jeth.2000.2710"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Caragiannis, I., Haber, S., Lu, T., Procaccia, A., Sheffet, O.: Optimal social choice functions: a utilitarian view. In: Proceedings of 13th Conference on Electronic Commerce (EC), pp. 197\u2013214 (2013)","DOI":"10.1145\/2229012.2229030"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Budish, E., Che, Y., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: theory and applications. Am. Econ. Rev. 103(2), 585\u2013623 (2013). http:\/\/www.jstor.org\/stable\/23469677","DOI":"10.1257\/aer.103.2.585"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589\u2013610 (2012). https:\/\/doi.org\/10.1007\/s00224-011-9359-y","journal-title":"Theory Comput. Syst."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-46882-2_3","volume-title":"Autonomous Agents and Multiagent Systems","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Filos-Ratsikas, A., Frederiksen, S.K.S., Goldberg, P.W., Zhang, J., Zhang, J.: Social welfare in one-sided matching mechanisms. In: Osman, N., Sierra, C. (eds.) AAMAS 2016. LNCS (LNAI), vol. 10002, pp. 30\u201350. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46882-2_3"},{"key":"24_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-015-0475-9","author":"O Ekici","year":"2016","unstructured":"Ekici, O., Kesten, O.: An equilibrium analysis of the probabilistic serial mechanism. Int. J. Game Theory (2016). https:\/\/doi.org\/10.1007\/s00182-015-0475-9","journal-title":"Int. J. Game Theory"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44803-8_1","volume-title":"Algorithmic Game Theory","author":"A Filos-Ratsikas","year":"2014","unstructured":"Filos-Ratsikas, A., Frederiksen, S.K.S., Zhang, J.: Social welfare in one-sided matchings: random priority and beyond. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 1\u201312. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_1"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293\u2013314 (1979). http:\/\/www.jstor.org\/stable\/1832088","DOI":"10.1086\/260757"},{"key":"24_CR14","doi-asserted-by":"publisher","unstructured":"Katta, A., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131(1), 231\u2013250 (2006). https:\/\/doi.org\/10.1016\/j.jet.2005.05.001, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022053105001079","DOI":"10.1016\/j.jet.2005.05.001"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Procaccia, A., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of 10th Conference on Electronic Commerce (EC), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Sonmez, T., Unver, U.: Matching, allocation and exchange of discrete resources. Handbook of Social Economics, vol. 1, pp. 781\u2013852. North-Holland (2011). https:\/\/doi.org\/10.1016\/B978-0-444-53187-2.00017-6, https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780444531872000176","DOI":"10.1016\/B978-0-444-53187-2.00017-6"},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Zhang, J.: Tight social welfare approximation of probabilistic serial. Theor. Comput. Sci. 934, 1\u20136 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.08.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397522004807","DOI":"10.1016\/j.tcs.2022.08.003"},{"key":"24_CR18","doi-asserted-by":"publisher","unstructured":"Zhou, L.: On a conjecture by Gale about one-sided matching problems. J. Econ. Theory 52(1), 123\u2013135 (1990). https:\/\/doi.org\/10.1016\/0022-0531(90)90070-Z, https:\/\/www.sciencedirect.com\/science\/article\/pii\/002205319090070Z","DOI":"10.1016\/0022-0531(90)90070-Z"}],"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-031-48974-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:05:07Z","timestamp":1703988307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","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":"Shanghai","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"221","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":"37","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":"17% - 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":"8","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)"}},{"value":"29 one-page abstracts accepted","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)"}}]}}