{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T04:26:49Z","timestamp":1729052809811},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031739026","type":"print"},{"value":"9783031739033","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-73903-3_18","type":"book-chapter","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:01:53Z","timestamp":1729026113000},"page":"273-287","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Manipulation With(out) Money in\u00a0Matching Market"],"prefix":"10.1007","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,16]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi-III","year":"1989","unstructured":"Bartholdi-III, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"issue":"8\u20139","key":"18_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi-III","year":"1992","unstructured":"Bartholdi-III, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8\u20139), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1613\/jair.1.12755","volume":"71","author":"N Boehmer","year":"2021","unstructured":"Boehmer, N., Bredereck, R., Heeger, K., Niedermeier, R.: Bribery and control in stable marriage. J. Artif. Intell. Res. 71, 993\u20131048 (2021)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Knop, D., Luo, J., Niedermeier, R.: Adapting stable matchings to evolving preferences. In: AAAI 2020, pp. 1830\u20131837 (2020)","DOI":"10.1609\/aaai.v34i02.5550"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Skowron, P., Sorge, M.: Matchings under preferences: strength of stability and trade-offs. In: Proceedings of the 2019 ACM Conference on Economics and Computation (EC), pp. 41\u201359 (2019)","DOI":"10.1145\/3328526.3329555"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3) (2007)","DOI":"10.1145\/1236457.1236461"},{"key":"18_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2020.100571","volume":"36","author":"\u00c1 Cseh","year":"2020","unstructured":"Cseh, \u00c1., Heeger, K.: The stable marriage problem with ties and restricted edges. Discret. Optim. 36, 100571 (2020)","journal-title":"Discret. Optim."},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15","DOI":"10.1007\/978-3-319-21275-3_15"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-319-49475-3.","DOI":"10.1007\/978-3-319-49475-3."},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1_35","DOI":"10.1007\/978-1-4471-5559-1_35"},{"issue":"1\u20132","key":"18_CR11","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.: Fixed-parameter tractability and completeness ii: on completeness for w [1]. Theor. Comput. Sci. 141(1\u20132), 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/moor.1070.0294","volume":"33","author":"L Ehlers","year":"2008","unstructured":"Ehlers, L.: Truncation strategies in matching markets. Math. Oper. Res. 33(2), 327\u2013335 (2008)","journal-title":"Math. Oper. Res."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Handbook of Computational Social Choice, Chapter Control and Bribery in Voting. Cambridge Univ, Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Parameterized Complexity Theory. TTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X_9","DOI":"10.1007\/3-540-29953-X_9"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69, 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"18_CR16","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"key":"18_CR17","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem-Structure and Algorithm. The MIT Press, Cambridge (1989)"},{"issue":"5\u20136","key":"18_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Anyone but him: the complexity of precluding an alternative. Artif. Intell. 171(5\u20136), 255\u2013285 (2007)","journal-title":"Artif. Intell."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/524367","volume":"52","author":"S Heyneman","year":"2008","unstructured":"Heyneman, S., Anderson, K., Nuraliyeva, N.: The cost of corruption in higher education. Comp. Educ. Rev. 52(1), 1\u201325 (2008)","journal-title":"Comp. Educ. Rev."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ijedudev.2015.02.003","volume":"41","author":"Q Liu","year":"2015","unstructured":"Liu, Q., Peng, Y.: Corruption in college admissions examinations in china. Int. J. Educ. Dev. 41, 104\u2013111 (2015)","journal-title":"Int. J. Educ. Dev."},{"key":"18_CR21","unstructured":"Mai, T., Vazirani, V.V.: Finding stable matchings that are robust to errors in the input. In: Proceedings of the 26th Annual European Symposium on Algorithms (ESA), pp. 60:1\u201360:11 (2018)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences, vol. 2. World Scientific, Singapore (2013)","DOI":"10.1142\/8591"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S., Zohar, A.: Complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149\u2013178 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR24","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S.: A broader picture of the complexity of strategic behavior in multi-winner elections. In: 7th AAMAS, pp. 991\u2013998 (2008)"},{"key":"18_CR25","unstructured":"Obraztsova, S., Zick, Y., Elkind, E.: On manipulation in multi-winner elections based on scoring rules. In: 12th AAMAS, pp. 359\u2013366 (2013)"},{"key":"18_CR26","unstructured":"Procaccia, A.D., Rosenschein, J.S., Zohar, A.: Multi-winner elections: complexity of manipulation, control and winner-determination. In: 16th IJCAI, vol. 7, pp. 1476\u20131481 (2007)"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6) (1984)","DOI":"10.1086\/261272"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econom. J. Econ. Soc. 54(2), 425\u2013427 (1986)","DOI":"10.2307\/1913160"},{"issue":"1","key":"18_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1111\/1468-0262.00002","volume":"67","author":"AE Roth","year":"1999","unstructured":"Roth, A.E., Rothblum, U.G.: Truncation strategies in matching markets-in search of advice for participants. Econometrica 67(1), 21\u201343 (1999)","journal-title":"Econometrica"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Roth, A.E., Sotomayor, M.: Two-Sided Matching: A Study in Game Theoretic Modeling and Analysis. Cambridge Univ, Press, Cambridge (1990)","DOI":"10.1017\/CCOL052139015X"},{"issue":"9","key":"18_CR31","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/mnsc.47.9.1252.9784","volume":"47","author":"C-P Teo","year":"2001","unstructured":"Teo, C.-P., Sethuraman, J., Tan, W.-P.: Gale-Shapley stable marriage problem revisited: strategic issues and applications. Manag. Sci. 47(9), 1252\u20131267 (2001)","journal-title":"Manag. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-73903-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:05:14Z","timestamp":1729026314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73903-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9783031739026","9783031739033"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73903-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]},"assertion":[{"value":"16 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/preflib.github.io\/adt2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}