{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:39:13Z","timestamp":1742949553266,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030579791"},{"type":"electronic","value":"9783030579807"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57980-7_11","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"163-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bribery and Control in Stable Marriage"],"prefix":"10.1007","author":[{"given":"Niclas","family":"Boehmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Heeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"issue":"8\u20139","key":"11_CR1","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":"11_CR2","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Bredereck, R., Heeger, K., Niedermeier, R.: Bribery and control in stable marriage. arXiv preprint arXiv:2007.04948 [cs.GT] (2020)","DOI":"10.1007\/978-3-030-57980-7_11"},{"key":"11_CR3","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 2019), pp. 41\u201359 (2019)","DOI":"10.1145\/3328526.3329555"},{"key":"11_CR4","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.6028\/jres.071B.032","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Stand. B 71(4), 233\u2013240 (1967)","journal-title":"J. Res. Natl. Bur. Stand. B"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Handbook of Computational Social Choice, pp. 146\u2013168. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.008"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1162\/qjec.2006.121.2.673","volume":"121","author":"R Fisman","year":"2006","unstructured":"Fisman, R., Iyengar, S.S., Kamenica, E., Simonson, I.: Gender differences in mate selection: evidence from a speed dating experiment. Q. J. Econ. 121(2), 673\u2013697 (2006)","journal-title":"Q. J. Econ."},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"HN Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2), 109\u2013122 (1986)","journal-title":"Combinatorica"},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","volume":"120","author":"D Gale","year":"2013","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 120(5), 386\u2013391 (2013)","journal-title":"Am. Math. Mon."},{"key":"11_CR11","series-title":"Foundations of Computing Series","volume-title":"The Stable Marriage Problem - Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem - Structure and Algorithms. Foundations of Computing Series. MIT Press, Cambridge (1989)"},{"issue":"1","key":"11_CR12","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":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-36494-3_39","volume-title":"STACS 2003","author":"RW Irving","year":"2003","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: Strong stability in the hospitals\/residents problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 439\u2013450. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_39"},{"key":"11_CR14","unstructured":"Knuth, D.E.: Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal, Que. (1976). Introduction \u00e0 l\u2019analyse math\u00e9matique des algorithmes, Collection de la Chaire Aisenstadt"},{"key":"11_CR15","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":"11_CR16","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 2018), pp. 60:1\u201360:11 (2018)"},{"key":"11_CR17","unstructured":"Mai, T., Vazirani, V.V.: Stable matchings, robust solutions, and finite distributive lattices. arXiv preprint arXiv:1804.05537 [cs.DM] (2018)"},{"issue":"1\u20132","key":"11_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D Manlove","year":"2002","unstructured":"Manlove, D., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR19","series-title":"Series on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. Series on Theoretical Computer Science, vol. 2. WorldScientific, Singapore (2013)"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10458-010-9121-x","volume":"22","author":"MS Pini","year":"2011","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Manipulation complexity and gender neutrality in stable marriage procedures. Auton. Agents Multi-Agent Syst. 22(1), 183\u2013199 (2011)","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1287\/moor.7.4.617","volume":"7","author":"AE Roth","year":"1982","unstructured":"Roth, A.E.: The economics of matching: stability and incentives. Math. Oper. Res. 7(4), 617\u2013628 (1982)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"AE Roth","year":"1986","unstructured":"Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica J. Econ. Soc. 54(2), 425\u2013427 (1986)","journal-title":"Econometrica J. Econ. Soc."},{"issue":"9","key":"11_CR23","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/mnsc.47.9.1252.9784","volume":"47","author":"C Teo","year":"2001","unstructured":"Teo, C., Sethuraman, J., Tan, W.: 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 Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57980-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:21:19Z","timestamp":1619205679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}