{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T15:56:41Z","timestamp":1717171001198},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T00:00:00Z","timestamp":1663372800000},"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":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10458-022-09578-2","type":"journal-article","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T06:02:36Z","timestamp":1663394556000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The parameterized complexity of manipulating Top Trading Cycles"],"prefix":"10.1007","volume":"36","author":[{"given":"William","family":"Phan","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Purcell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,17]]},"reference":[{"issue":"3","key":"9578_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. (1998). Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica, 66(3), 689\u2013701.","journal-title":"Econometrica"},{"issue":"3","key":"9578_CR2","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1257\/000282803322157061","volume":"93","author":"A Abdulkadiro\u011flu","year":"2003","unstructured":"Abdulkadiro\u011flu, A., & S\u00f6nmez, T. (2003). School choice: A mechanism design approach. American Economic Review, 93(3), 729\u2013747.","journal-title":"American Economic Review"},{"issue":"3","key":"9578_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","volume":"73","author":"KA Abrahamson","year":"1995","unstructured":"Abrahamson, K. A., Downey, R. G., & Fellows, M. R. (1995). Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. Annals of Pure and Applied Logic, 73(3), 235\u2013276.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9578_CR4","unstructured":"Altunta\u015f, A., Tamura, Y., & Phan, W. (2022). Some characterizations of generalized top trading cycles. Working paper."},{"issue":"1","key":"9578_CR5","first-page":"81","volume":"86","author":"EM Azevedo","year":"2019","unstructured":"Azevedo, E. M., & Budish, E. (2019). Strategy-proofness in the large. The Review of Economic Studies, 86(1), 81\u2013116.","journal-title":"The Review of Economic Studies"},{"key":"9578_CR6","unstructured":"Bir\u00f3, P., Klijn, F., & P\u00e1pai, S. (2019). Balanced exchange in a multi-object Shapley-Scarf market. Working paper."},{"key":"9578_CR7","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ic.2016.08.003","volume":"251","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Faliszewski, P., Nichterlein, A., & Niedermeier, R. (2016). Prices matter for the parameterized complexity of shift bribery. Information and Computation, 251, 140\u2013164.","journal-title":"Information and Computation"},{"issue":"5","key":"9578_CR8","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish, E., & Cantillon, E. (2012). The multi-unit assignment problem: Theory and evidence from course allocation at Harvard. American Economic Review, 102(5), 2237\u201371.","journal-title":"American Economic Review"},{"issue":"1","key":"9578_CR9","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1995.1156","volume":"123","author":"L Cai","year":"1995","unstructured":"Cai, L., Chen, J., Downey, R., & Fellows, M. (1995). On the structure of parameterized problems in NP. Information and Computation, 123(1), 38\u201349.","journal-title":"Information and Computation"},{"issue":"4","key":"9578_CR10","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/S0022-0000(03)00073-4","volume":"67","author":"M Cesati","year":"2003","unstructured":"Cesati, M. (2003). The Turing way to parameterized complexity. Journal of Computer and System Sciences, 67(4), 654\u2013685.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2\u20133","key":"9578_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2005.02.003","volume":"339","author":"Y Chen","year":"2005","unstructured":"Chen, Y., Flum, J., & Grohe, M. (2005). Machine-based methods in parameterized complexity theory. Theoretical Computer Science, 339(2\u20133), 167\u2013199.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9578_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R. G., & Fellows, M. R. (1995). Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 141(1), 109\u2013131.","journal-title":"Theoretical Computer Science"},{"key":"9578_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity. Monographs in computer science","author":"RG Downey","year":"1999","unstructured":"Downey, R. G., & Fellows, M. R. (1999). Parameterized complexity. Monographs in computer science. Springer."},{"key":"9578_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.geb.2017.10.003","volume":"108","author":"U Dur","year":"2018","unstructured":"Dur, U., & Morrill, T. (2018). Competitive equilibria in school assignment. Games and Economic Behavior, 108, 269\u2013274.","journal-title":"Games and Economic Behavior"},{"issue":"5","key":"9578_CR15","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.3982\/ECTA13971","volume":"85","author":"H Ergin","year":"2017","unstructured":"Ergin, H., S\u00f6nmez, T., & \u00dcnver, M. U. (2017). Dual-donor organ exchange. Econometrica, 85(5), 1645\u20131671.","journal-title":"Econometrica"},{"issue":"3","key":"9578_CR16","doi-asserted-by":"publisher","first-page":"965","DOI":"10.3982\/ECTA16400","volume":"88","author":"H Ergin","year":"2020","unstructured":"Ergin, H., S\u00f6nmez, T., & \u00dcnver, M. U. (2020). Efficient and incentive-compatible liver exchange. Econometrica, 88(3), 965\u20131005.","journal-title":"Econometrica"},{"key":"9578_CR17","unstructured":"Flammini, M., & Gilbert, H. (2020). Parameterized complexity of manipulating sequential allocation. In 24th European conference on artificial intelligence (ECAI 2020)."},{"key":"9578_CR18","doi-asserted-by":"crossref","unstructured":"Fujita, E., Lesca, J., Sonoda, A., Todo, T., & Yokoo, M. (2015). A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences. In Proceedings of the twenty-ninth AAAI conference on artificial intelligence, AAAI\u201915 (pp. 907\u2013913). AAAI Press.","DOI":"10.1609\/aaai.v29i1.9318"},{"key":"9578_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1613\/jair.1.11254","volume":"63","author":"E Fujita","year":"2018","unstructured":"Fujita, E., Lesca, J., Sonoda, A., Todo, T., & Yokoo, M. (2018). A complexity approach for core-selecting exchange under conditionally lexicographic preferences. Journal of Artificial Intelligence Research, 63, 515\u2013555.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"9578_CR20","first-page":"362","volume":"6","author":"J Kennes","year":"2014","unstructured":"Kennes, J., Monte, D., & Tumennasan, N. (2014). The day care assignment: A dynamic matching problem. American Economic Journal: Microeconomics, 6(4), 362\u2013406.","journal-title":"American Economic Journal: Microeconomics"},{"issue":"9\u201310","key":"9578_CR21","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.jmateco.2007.05.013","volume":"44","author":"B Klaus","year":"2008","unstructured":"Klaus, B. (2008). The coordinate-wise core for multiple-type housing markets is second-best incentive compatible. Journal of Mathematical Economics, 44(9\u201310), 919\u2013924.","journal-title":"Journal of Mathematical Economics"},{"issue":"1","key":"9578_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-4068(00)00061-6","volume":"35","author":"H Konishi","year":"2001","unstructured":"Konishi, H., Quint, T., & Wako, J. (2001). On the Shapley-Scarf economy: The case of multiple types of indivisible goods. Journal of Mathematical Economics, 35(1), 1\u201315.","journal-title":"Journal of Mathematical Economics"},{"key":"9578_CR23","unstructured":"Liu, Q., & Pycia, M. (2016). Ordinal efficiency, fairness, and incentives in large markets. Working paper."},{"issue":"1","key":"9578_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01242849","volume":"23","author":"J Ma","year":"1994","unstructured":"Ma, J. (1994). Strategy-proofness and the strict core in a market with indivisibilities. International Journal of Game Theory, 23(1), 75\u201383.","journal-title":"International Journal of Game Theory"},{"key":"9578_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2021.105197","volume":"193","author":"V Majunath","year":"2021","unstructured":"Majunath, V., & Westkamp, A. (2021). Strategy-proof exchange under trichotomous preferences. Journal of Economic Theory, 193, 105197.","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"9578_CR26","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1006\/game.2001.0858","volume":"38","author":"E Miyagawa","year":"2002","unstructured":"Miyagawa, E. (2002). Strategy-proofness and the core in house allocation problems. Games and Economic Behavior, 38(2), 347\u2013361.","journal-title":"Games and Economic Behavior"},{"key":"9578_CR27","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jmateco.2015.08.002","volume":"61","author":"D Monte","year":"2015","unstructured":"Monte, D., & Tumennasan, N. (2015). Centralized allocation in multiple markets. Journal of Mathematical Economics, 61, 74\u201385.","journal-title":"Journal of Mathematical Economics"},{"key":"9578_CR28","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.geb.2015.05.004","volume":"92","author":"T Morrill","year":"2015","unstructured":"Morrill, T. (2015). Making just school assignments. Games and Economic Behavior, 92, 18\u201327.","journal-title":"Games and Economic Behavior"},{"key":"9578_CR29","volume-title":"Computational complexity","author":"CM Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. M. (1994). Computational complexity. Addison-Wesley."},{"issue":"6","key":"9578_CR30","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1111\/1468-0262.00166","volume":"68","author":"S P\u00e1pai","year":"2000","unstructured":"P\u00e1pai, S. (2000). Strategyproof assignment by hierarchical exchange. Econometrica, 68(6), 1403\u20131433.","journal-title":"Econometrica"},{"issue":"8","key":"9578_CR31","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/S0304-4068(03)00053-3","volume":"39","author":"S P\u00e1pai","year":"2003","unstructured":"P\u00e1pai, S. (2003). Strategyproof exchange of indivisible goods. Journal of Mathematical Economics, 39(8), 931\u2013959.","journal-title":"Journal of Mathematical Economics"},{"issue":"1","key":"9578_CR32","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.jet.2005.05.012","volume":"132","author":"S P\u00e1pai","year":"2007","unstructured":"P\u00e1pai, S. (2007). Exchange in a general market with indivisible goods. Journal of Economic Theory, 132(1), 208\u2013235.","journal-title":"Journal of Economic Theory"},{"issue":"1","key":"9578_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.3982\/TE2201","volume":"12","author":"M Pycia","year":"2017","unstructured":"Pycia, M., & \u00dcnver, M. U. (2017). Incentive compatible allocation and exchange of discrete resources. Theoretical Economics, 12(1), 287\u2013329.","journal-title":"Theoretical Economics"},{"issue":"2","key":"9578_CR34","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-4068(77)90004-0","volume":"4","author":"AE Roth","year":"1977","unstructured":"Roth, A. E., & Postlewaite, A. (1977). Weak versus strong domination in a market with indivisible goods. Journal of Mathematical Economics, 4(2), 131\u2013137.","journal-title":"Journal of Mathematical Economics"},{"issue":"2","key":"9578_CR35","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. U. (2004). Kidney exchange. The Quarterly Journal of Economics, 119(2), 457\u2013488.","journal-title":"The Quarterly Journal of Economics"},{"issue":"2","key":"9578_CR36","first-page":"164","volume":"5","author":"J Schummer","year":"2013","unstructured":"Schummer, J., & Vohra, R. V. (2013). Assignment of arrival slots. American Economic Journal: Microeconomics, 5(2), 164\u2013185.","journal-title":"American Economic Journal: Microeconomics"},{"issue":"1","key":"9578_CR37","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., & Scarf, H. (1974). On cores and indivisibility. Journal of Mathematical Economics, 1(1), 23\u201337.","journal-title":"Journal of Mathematical Economics"},{"key":"9578_CR38","doi-asserted-by":"crossref","unstructured":"Sikdar, S., Adali, S., & Xia, L. (2017). Mechanism design for multi-type housing markets (pp. 684\u2013690). AAAI.","DOI":"10.1609\/aaai.v31i1.10601"},{"issue":"3","key":"9578_CR39","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1111\/1468-0262.00044","volume":"67","author":"T S\u00f6nmez","year":"1999","unstructured":"S\u00f6nmez, T. (1999). Strategy-proofness and essentially single-valued cores. Econometrica, 67(3), 677\u2013689.","journal-title":"Econometrica"},{"issue":"1","key":"9578_CR40","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.geb.2004.04.008","volume":"52","author":"T S\u00f6nmez","year":"2005","unstructured":"S\u00f6nmez, T., & \u00dcnver, M. U. (2005). House allocation with existing tenants: An equivalence. Games and Economic Behavior, 52(1), 153\u2013185.","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"9578_CR41","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.geb.2009.10.010","volume":"69","author":"T S\u00f6nmez","year":"2010","unstructured":"S\u00f6nmez, T., & \u00dcnver, M. U. (2010). House allocation with existing tenants: A characterization. Games and Economic Behavior, 69(2), 425\u2013445.","journal-title":"Games and Economic Behavior"},{"key":"9578_CR42","doi-asserted-by":"crossref","unstructured":"Sonoda, A., Fujita, E., Todo, T., & Yokoo, M. (2014). Two case studies for trading multiple indivisible goods with indifferences. In Twenty-eighth AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v28i1.8818"},{"key":"9578_CR43","unstructured":"Sun, Z., Hata, H., Todo, T., & Yokoo, M. (2015). Exchange of indivisible objects with asymmetry. In Twenty-fourth international joint conference on artificial intelligence."},{"issue":"4","key":"9578_CR44","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"L-G Svensson","year":"1999","unstructured":"Svensson, L.-G. (1999). Strategy-proof allocation of indivisible goods. Social Choice and Welfare, 16(4), 557\u2013567.","journal-title":"Social Choice and Welfare"},{"key":"9578_CR45","doi-asserted-by":"crossref","unstructured":"Todo, T., Sun, H., & Yokoo, M. (2014). Strategyproof exchange with multiple private endowments. In Twenty-eighth AAAI conference on artificial intelligence (pp. 805\u2013811).","DOI":"10.1609\/aaai.v28i1.8817"},{"key":"9578_CR46","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2015.06.016","volume":"595","author":"J Wang","year":"2015","unstructured":"Wang, J., Su, W., Yang, M., Guo, J., Feng, Q., Shi, F., & Chen, J. (2015). Parameterized complexity of control and bribery for d-approval elections. Theoretical Computer Science, 595, 82\u201391.","journal-title":"Theoretical Computer Science"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09578-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-022-09578-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09578-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T12:03:43Z","timestamp":1667045023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-022-09578-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,17]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9578"],"URL":"https:\/\/doi.org\/10.1007\/s10458-022-09578-2","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,17]]},"assertion":[{"value":"11 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"51"}}