{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:12:08Z","timestamp":1725804728963},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448021"},{"type":"electronic","value":"9783662448038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44803-8_2","type":"book-chapter","created":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T13:45:22Z","timestamp":1409924722000},"page":"13-24","source":"Crossref","is-referenced-by-count":4,"title":["Efficiency of Truthful and Symmetric Mechanisms in One-Sided Matching"],"prefix":"10.1007","author":[{"given":"Marek","family":"Adamczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-22935-0_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Bhalgat","year":"2011","unstructured":"Bhalgat, A., Chakrabarty, D., Khanna, S.: Social welfare in one-sided matching markets without money. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol.\u00a06845, pp. 87\u201398. Springer, Heidelberg (2011)"},{"issue":"2","key":"2_CR2","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. Journal of Economic Theory\u00a0100(2), 295\u2013328 (2001)","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A. Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica\u00a072(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Swamy, C.: Welfare maximization and truthfulness in mechanism design with ordinal preferences. In: In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 105\u2013120 (2014)","DOI":"10.1145\/2554797.2554810"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Dughmi, S., Ghosh, A.: Truthful assignment without money. In: In Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 325\u2013334 (2010)","DOI":"10.1145\/1807342.1807394"},{"key":"2_CR6","unstructured":"Filos-Ratsikas, A., Frederiksen, S.K.S., Zhang, J.: Social welfare in one-sided matchings: Random priority and beyond. In: In Proceedings of the 7th International Symposium on Algorithmic Game Theory (to appear, 2014)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly, 9\u201315 (1962)","DOI":"10.1080\/00029890.1962.11989827"},{"key":"2_CR8","unstructured":"Gale, D.: College Course Assignments and Optimal Lotteries. University of California at Berkeley (1987)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. The Journal of Political Economy, 293\u2013314 (1979)","DOI":"10.1086\/260757"},{"issue":"6","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.2307\/1912309","volume":"45","author":"E. Kalai","year":"1977","unstructured":"Kalai, E., Schmeidler, D.: Aggregation procedure for cardinal preferences: A formulation and proof of Samuelson\u2019s impossibility conjecture. Econometrica\u00a045(6), 1431\u20131438 (1977)","journal-title":"Econometrica"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In: In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 597\u2013606 (2011)","DOI":"10.1145\/1993636.1993716"},{"key":"2_CR13","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-sided matching: A study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge (1992)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/B978-0-444-53187-2.00017-6","volume":"1","author":"T. S\u00f6nmez","year":"2011","unstructured":"S\u00f6nmez, T., \u00dcnver, M.U.: Matching, allocation, and exchange of discrete resources. Handbook of Social Economics\u00a01, 781\u2013852 (2011)","journal-title":"Handbook of Social Economics"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"L.G. Svensson","year":"1999","unstructured":"Svensson, L.G.: Strategy-proof allocation of indivisible goods. Social Choice and Welfare\u00a016(4), 557\u2013567 (1999)","journal-title":"Social Choice and Welfare"},{"key":"2_CR16","unstructured":"Williams, D.: Probability with Martingales. Cambridge mathematical textbooks. Cambridge University Press (1991)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L. Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by gale about one-sided matching problems. Journal of Economic Theory\u00a052(1), 123\u2013135 (1990)","journal-title":"Journal of Economic Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44803-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:08:25Z","timestamp":1558987705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44803-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448021","9783662448038"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44803-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}