{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:20:49Z","timestamp":1775150449687,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T00:00:00Z","timestamp":1492992000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10472-017-9549-7","type":"journal-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T07:39:55Z","timestamp":1493019595000},"page":"153-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Tennis manipulation: can we help serena williams win another tournament?"],"prefix":"10.1007","volume":"80","author":[{"given":"Lior","family":"Aronshtam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Havazelet","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9611-2765","authenticated-orcid":false,"given":"Tammar","family":"Shrot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,24]]},"reference":[{"key":"9549_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Lewi, K., Williams, R.: Losing weight by gaining edges European Symposium on Algorithms, pp 1\u201312. Springer (2014)","DOI":"10.1007\/978-3-662-44777-2_1"},{"key":"9549_CR2","unstructured":"Arrow, K.J., Sen, A., Suzumura, K.: Handbook of social choice and welfare, vol.2. Elsevier (2010)"},{"key":"9549_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1613\/jair.4856","volume":"54","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Brill, M., Fischer, F., Harrenstein, P., Lang, J., Seedig, H. G.: Possible and necessary winners of partial tournaments. J. Artif. Intell. Res. 54, 493\u2013534 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"9549_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Stursberg, P., Walsh, T.: Fixing a balanced knockout tournament. In: AAAI, pp 552\u2013558 (2014)","DOI":"10.1609\/aaai.v28i1.8805"},{"issue":"3","key":"9549_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi","year":"1989","unstructured":"Bartholdi, 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-9","key":"9549_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi","year":"1992","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8-9), 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"issue":"52","key":"9549_CR7","doi-asserted-by":"crossref","first-page":"5425","DOI":"10.1016\/j.tcs.2009.05.029","volume":"410","author":"N Betzler","year":"2009","unstructured":"Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 5425\u20135442 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9549_CR8","unstructured":"Brams, S.J., Fishburn, P.C., Arrow, K.J., Sen, A.K., Suzumura, K.: Handbook of social choice and welfare (2002)"},{"key":"9549_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Elections with few voters: Candidate control can be easy. In: AAAI, pp 2045\u20132051 (2015)","DOI":"10.1609\/aaai.v29i1.9429"},{"key":"9549_CR10","unstructured":"Cormen, T.H.: Introduction to algorithms. MIT press (2009)"},{"issue":"1-2","key":"9549_CR11","doi-asserted-by":"crossref","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-2), 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"9549_CR12","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer Science & Business Media (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"9549_CR13","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.jcss.2014.11.003","volume":"81","author":"G Erd\u00e9lyi","year":"2015","unstructured":"Erd\u00e9lyi, G., Fellows, M.R., Rothe, J., Schend, L.: Control complexity in bucklin and fallback voting: An experimental analysis. J. Comput. Syst. Sci. 81(4), 661\u2013670 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"9549_CR14","doi-asserted-by":"crossref","unstructured":"Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., Raible, D., Rothe, J.: The complexity of probabilistic lobbying. In: International Conference on Algorithmic DecisionTheory, pp 86\u201397. Springer (2009)","DOI":"10.1007\/978-3-642-04428-1_8"},{"key":"9549_CR15","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: Copeland voting fully resists constructive control. In: International Conference on Algorithmic Applications in Management, pp 165\u2013176. Springer (2008)","DOI":"10.1007\/978-3-540-68880-8_17"},{"key":"9549_CR16","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Koblitz, N.: Fixed-parameter complexity and cryptography. In: International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, pp 121\u2013131. Springer (1993)","DOI":"10.1007\/3-540-56686-4_38"},{"key":"9549_CR17","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory, volume xiv of texts in theoretical computer science. an eatcs series (2006)"},{"key":"9549_CR18","unstructured":"Gary, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of np-completeness (1979)"},{"key":"9549_CR19","unstructured":"Hazon, N., Dunne, P.E., Kraus, S., Wooldridge, M.: How to rig elections and competitions. Proc. COMSOC (2008)"},{"issue":"2","key":"9549_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1287\/opre.33.2.249","volume":"33","author":"J Horen","year":"1985","unstructured":"Horen, J., Riezman, R.: Comparing draws for single elimination tournaments. Oper. Res. 33(2), 249\u2013262 (1985)","journal-title":"Oper. Res."},{"key":"9549_CR21","doi-asserted-by":"crossref","unstructured":"Kim, M.P., Suksompong, W., Williams, V.V.: Who can win a single-elimination tournament? arXiv: 1511.08416 (2015)","DOI":"10.1609\/aaai.v30i1.10037"},{"issue":"1","key":"9549_CR22","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s10458-011-9171-8","volume":"25","author":"J Lang","year":"2012","unstructured":"Lang, J., Pini, M.S., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Winner determination in voting trees with incomplete preferences and weighted votes. Auton. Agent. Multi-Agent Syst. 25(1), 130\u2013157 (2012)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"4","key":"9549_CR23","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.jal.2015.03.004","volume":"13","author":"N Mattei","year":"2015","unstructured":"Mattei, N., Goldsmith, J., Klapper, A., Mundhenk, M.: On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. 13(4), 557\u2013581 (2015)","journal-title":"J. Appl. Log."},{"key":"9549_CR24","doi-asserted-by":"crossref","unstructured":"Moulin, H., Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984"},{"key":"9549_CR25","doi-asserted-by":"crossref","unstructured":"Russell, T., Walsh, T.: Manipulating tournaments in cup and round robin competitions. In: International Conference on Algorithmic DecisionTheory, pp 26\u201337. Springer (2009)","DOI":"10.1007\/978-3-642-04428-1_3"},{"key":"9549_CR26","unstructured":"Sandholm, T.W.: Distributed rational decision making. Multiagent systems: a modern approach to distributed artificial intelligence (1999)"},{"key":"9549_CR27","unstructured":"Vu, T., Altman, A., Shoham, Y.: On the agenda control problem in knockout tournaments. Proc. COMSOC (2008)"},{"key":"9549_CR28","unstructured":"Vu, T., Altman, A., Shoham, Y.: On the complexity of schedule control problems for knockout tournaments. In: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, pp. 225\u2013232 International Foundation for Autonomous Agents and Multiagent Systems (2009)"},{"key":"9549_CR29","unstructured":"Vu, T.D., Shoham, Y., Jackson, M.O., Roughgarden, T.: Knockout tournament design: a computational approach. Stanford University (2010)"},{"issue":"1-2","key":"9549_CR30","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s10472-011-9255-9","volume":"62","author":"T Walsh","year":"2011","unstructured":"Walsh, T.: Is computational complexity a barrier to manipulation? Ann. Math. Artif. Intell. 62(1-2), 7\u201326 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9549_CR31","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Fixing a tournament. In: Proceedings of AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7617"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-017-9549-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-017-9549-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-017-9549-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T07:24:59Z","timestamp":1692775499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-017-9549-7"}},"subtitle":["Or can we control a knockout tournament with reasonable complexity?"],"short-title":[],"issued":{"date-parts":[[2017,4,24]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9549"],"URL":"https:\/\/doi.org\/10.1007\/s10472-017-9549-7","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,24]]}}}