{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:12:15Z","timestamp":1755925935441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_32","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"537-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Randomized Assignments for Barter Exchanges: Fairness vs. Efficiency"],"prefix":"10.1007","author":[{"given":"Wenyi","family":"Fang","sequence":"first","affiliation":[]},{"given":"Aris","family":"Filos-Ratsikas","sequence":"additional","affiliation":[]},{"given":"S\u00f8ren Kristoffer Stiil","family":"Frederiksen","sequence":"additional","affiliation":[]},{"given":"Pingzhong","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Song","family":"Zuo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.2307\/2998580","volume":"66","author":"A Abdulkadiro\u011flu","year":"1998","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 66(3), 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 295\u2013304. ACM (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Roth, A.: Individual rationality and participation in large scale, multi-hospital kidney exchange. In: Proceedings of the 12th ACM Conference on Electronic Commerce, pp. 321\u2013322. ACM (2011)","DOI":"10.1145\/1993574.1993625"},{"key":"32_CR4","unstructured":"Balbuzanov, I.: Short trading cycles: kidney exchange with strict ordinal preferences (2014)"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theor. 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theor."},{"key":"32_CR6","unstructured":"Dickerson, J.P., Goldman, J.R., Karp, J., Procaccia, A.D., Sandholm, T.: The computational rise and fall of fairness. In: Proceedings of the Twenty-eighth AAAI Conference on Artificial Intelligence, Qu\u00e9bec City, Qu\u00e9bec, Canada, 27\u201331 July 2014, pp. 1405\u20131411 (2014)"},{"key":"32_CR7","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Dynamic matching via weighted myopia with application to kidney exchange. In: AAAI (2012)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Failure-aware kidney exchange. In: Proceedings of the Fourteenth ACM Conference on Electronic Commerce, pp. 323\u2013340. ACM (2013)","DOI":"10.1145\/2482540.2482596"},{"key":"32_CR9","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Price of fairness in kidney exchange. In: International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2014, Paris, France, 5\u20139 May 2014, pp. 1013\u20131020 (2014)"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1137\/100812513","volume":"42","author":"A Goel","year":"2013","unstructured":"Goel, A., Kapralov, M., Khanna, S.: Perfect matchings in $$o(n\\log n)$$ time in regular bipartite graphs. SIAM J. Comput. 42(3), 1392\u20131404 (2013)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"A-K Katta","year":"2006","unstructured":"Katta, A.-K., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. J. Econ. Theor. 131(1), 231\u2013250 (2006)","journal-title":"J. Econ. Theor."},{"key":"32_CR12","unstructured":"Li, J., Liu, Y., Huang, L., Tang, P.: Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow. In: International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2014, Paris, France, 5\u20139 May 2014, pp. 445\u2013452 (2014)"},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.: Kidney exchange. Q. J. Econ. 119(2), 457\u2013488 (2004)","journal-title":"Q. J. Econ."},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Pairwise kidney exchange. J. Econ. Theor. 125(2), 151\u2013188 (2005)","journal-title":"J. Econ. Theor."},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-45046-4_34","volume-title":"Web and Internet Economics","author":"D Saban","year":"2013","unstructured":"Saban, D., Sethuraman, J.: The complexity of computing the random priority allocation matrix. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 421\u2013421. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,26]],"date-time":"2020-12-26T20:07:45Z","timestamp":1609013265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}