{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:41:51Z","timestamp":1783615311311,"version":"3.55.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T00:00:00Z","timestamp":1541721600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T00:00:00Z","timestamp":1541721600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1526860"],"award-info":[{"award-number":["IIS-1526860"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00182-018-0649-3","type":"journal-article","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T11:10:12Z","timestamp":1541761812000},"page":"609-645","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Deferred acceptance is minimally manipulable"],"prefix":"10.1007","volume":"48","author":[{"given":"Martin","family":"Van der Linden","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"649_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-03750-8_2","volume-title":"Curr Trends Econ","author":"F Aleskerov","year":"1999","unstructured":"Aleskerov F, Kurbanov E (1999) Degree of manipulability of social choice procedures. In: Alkan PA, Aliprantis PCD, Yannelis PNC (eds) Curr Trends Econ. Springer, Berlin Heidelberg, pp 13\u201327"},{"key":"649_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.mathsocsci.2014.01.006","volume":"69","author":"T Andersson","year":"2014","unstructured":"Andersson T, Ehlers L, Svensson LG (2014) Least manipulable envy-free rules in economies with indivisibilities. Math Soc Sci 69:43\u201349","journal-title":"Math Soc Sci"},{"key":"649_CR3","doi-asserted-by":"publisher","first-page":"547","DOI":"10.3982\/TE1910","volume":"11","author":"RP Arribillaga","year":"2015","unstructured":"Arribillaga RP, Mass\u00f3 J (2015) Comparing generalized median voter schemes according to their manipulability. Theor Econ 11:547\u2013586","journal-title":"Theor Econ"},{"key":"649_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1086\/689869","volume":"125","author":"I Ashlagi","year":"2016","unstructured":"Ashlagi I, Kanoria Y, Leshno JD (2016) Unbalanced random matching markets: the stark effect of competition. J Political Econ 125:69\u201398","journal-title":"J Political Econ"},{"key":"649_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.3982\/TE2118","volume":"12","author":"S Barber\u00e0","year":"2017","unstructured":"Barber\u00e0 S, Gerber A (2017) Sequential voting and agenda manipulation. Theor Econ 12:211\u2013247","journal-title":"Theor Econ"},{"key":"649_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1257\/mic.20150035","volume":"8","author":"P Chen","year":"2016","unstructured":"Chen P, Egesdal M, Pycia M, Yenmez MB (2016) Manipulability of stable mechanisms. Am Econ J Microecon 8:202\u2013214","journal-title":"Am Econ J Microecon"},{"key":"649_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.geb.2014.01.005","volume":"87","author":"P Coles","year":"2014","unstructured":"Coles P, Shorrer R (2014) Optimal truncation in matching markets. Games Econ Behav 87:591\u2013615","journal-title":"Games Econ Behav"},{"key":"649_CR8","doi-asserted-by":"crossref","unstructured":"Decerf B, Van der Linden M (2016) Manipulability and tie-breaking in constrained school choice. SSRN working paper no. 2809566","DOI":"10.2139\/ssrn.2809566"},{"key":"649_CR9","doi-asserted-by":"publisher","first-page":"449","DOI":"10.3982\/QE496","volume":"7","author":"F Echenique","year":"2016","unstructured":"Echenique F, Wilson AJ, Yariv L (2016) Clearinghouses for two-sided matching: an experimental study. Quant Econ 7:449\u2013482","journal-title":"Quant Econ"},{"key":"649_CR10","unstructured":"Echenique F, Yariv L (2012) An experimental study of decentralized matching. Working paper"},{"key":"649_CR11","doi-asserted-by":"crossref","unstructured":"Fujinaka Y, Wakayama T, (2012) Maximal manipulation in fair allocation. SSRN Working Paper No. 2051296","DOI":"10.2139\/ssrn.2051296"},{"key":"649_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Monthly 69:9\u201315","journal-title":"Am Math Monthly"},{"key":"649_CR13","unstructured":"Hassidim A, Romm A, Shorrer R.I (2017) Need vs. Merit: The Large Core of College Admissions Markets. SSRN Working Paper No. 3071873"},{"key":"649_CR14","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving RW, Leather P, Gusfield D (1987) An efficient algorithm for the \u201coptimal\u201d stable marriage. J ACM 34:532\u2013543","journal-title":"J ACM"},{"key":"649_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00182-006-0009-6","volume":"34","author":"B Klaus","year":"2006","unstructured":"Klaus B, Klijn F (2006) Median stable matching for college admissions. Int J Game Theory 34:1\u201311","journal-title":"Int J Game Theory"},{"key":"649_CR16","volume-title":"Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth DE (1997) Stable marriage and its relation to other combinatorial problems: an introduction to the mathematical analysis of algorithms. American Mathematical Society, Providence, RI"},{"key":"649_CR17","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1257\/aer.99.3.608","volume":"99","author":"F Kojima","year":"2009","unstructured":"Kojima F, Pathak PA (2009) Incentives and stability in large two-sided matching markets. Am Econ Rev 99:608\u2013627","journal-title":"Am Econ Rev"},{"key":"649_CR18","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1093\/restud\/rdw041","volume":"84","author":"S Lee","year":"2017","unstructured":"Lee S (2017) Incentive compatibility of large centralized matching markets. Rev Econ Stud 84:444\u2013463","journal-title":"Rev Econ Stud"},{"key":"649_CR19","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.jet.2006.04.002","volume":"135","author":"S Maus","year":"2007","unstructured":"Maus S, Peters H, Storcken T (2007) Anonymous voting and minimal manipulability. J Econ Theory 135:533\u2013544","journal-title":"J Econ Theory"},{"key":"649_CR20","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1257\/aer.103.1.80","volume":"103","author":"PA Pathak","year":"2013","unstructured":"Pathak PA, S\u00f6nmez T (2013) School admissions reform in Chicago and England: Comparing mechanisms by their vulnerability to manipulation. Am Econ Rev 103:80\u2013106","journal-title":"Am Econ Rev"},{"key":"649_CR21","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/070696155","volume":"21","author":"B Pittel","year":"2008","unstructured":"Pittel B, Shepp L, Veklerov E (2008) On the number of fixed pairs in a random instance of the stable marriage problem. SIAM J Discrete Math 21:947\u2013958","journal-title":"SIAM J Discrete Math"},{"key":"649_CR22","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/moor.7.4.617","volume":"7","author":"A Roth","year":"1982","unstructured":"Roth A (1982) The economics of matching: stability and incentives. Math Oper Res 7:617\u2013628","journal-title":"Math Oper Res"},{"key":"649_CR23","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0022-0531(85)90106-1","volume":"288","author":"A Roth","year":"1985","unstructured":"Roth A (1985) The college admissions problem is not equivalent to the marriage problem. J Econ Theory 288:277\u2013288","journal-title":"J Econ Theory"},{"key":"649_CR24","doi-asserted-by":"crossref","unstructured":"Roth A, Sotomayor M (1990) Two-Sided Matching: a study in game-theoretic modeling and analysis. Number\u00a018 in Econometric Society monographs, Cambridge University Press, Cambridge","DOI":"10.1017\/CCOL052139015X"},{"key":"649_CR25","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1257\/aer.89.3.349","volume":"89","author":"A Sen","year":"1999","unstructured":"Sen A (1999) The possibility of social choice. Am Econ Rev 89:349\u2013378","journal-title":"Am Econ Rev"},{"key":"649_CR26","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1287\/moor.1060.0207","volume":"31","author":"J Sethuraman","year":"2006","unstructured":"Sethuraman J, Teo CP, Qian L (2006) Many-to-one stable matching: geometry and fairness. Math Oper Res 31:581\u2013596","journal-title":"Math Oper Res"},{"key":"649_CR27","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"CP Teo","year":"1998","unstructured":"Teo CP, Sethuraman J (1998) The geometry of fractional stable matchings and its applications. Math Oper Res 23:874\u2013891","journal-title":"Math Oper Res"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-018-0649-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-018-0649-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-018-0649-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T18:47:53Z","timestamp":1589568473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-018-0649-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s00182-018-0649-3","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"value":"0020-7276","type":"print"},{"value":"1432-1270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,9]]},"assertion":[{"value":"29 October 2018","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}