Skip to main content
SpringerLink
Log in

Controlling sub-tournaments: easy or hard problem?

Theoretical vs. practical analysis

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Is it possible for the organizers of a sports tournament to influence the identity of the final winner by manipulating the initial seeding of the tournament? Is it possible to ensure a specific good (i.e. king) player will win at least a certain number of rounds in the tournament? This paper investigates these questions both by means of a theoretical method and a practical approach. The theoretical method focuses on the attempt to identify sufficient conditions to ensure a king player will win at least a pre–defined number of rounds in the tournament. It seems that the tournament must adhere to very strict conditions to ensure the outcome, suggesting that this is a hard problem. The practical approach, on the other hand, uses the Monte Carlo method to demonstrate that these problems are solvable in realistic computational time. A comparison of the results lead to the realization that players with equivalent representation might relax the actual complexity of the problem, and enable manipulation of tournaments that can be controlled in reality.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aronshtam, L., Cohen, H., Shrot, T.: Tennis manipulation: Can we help serena williams win another tournament? Ann. Math. Artif. Intell. 80(2), 153–169 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arrow, KJ., Sen, A., Suzumura, K.: Handbook of Social Choice and Welfare, vol. 2. Elsevier (2010)

  3. Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Stursberg, P., Walsh, T.: Fixing a balanced knockout tournament. In: AAAI, pp. 552–558 (2014)

  4. Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227–241 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bartholdi, J.J, Tovey, C.A, Trick, M.A: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227–241 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bartholdi, Jo.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16(8–9), 27–40 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Betzler, N., Uhlmann, J.: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52), 5425–5442 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Binder, K., Heermann, D. W.: Monte Carlo Simulation in Statistical Physics. Springer (2002)

  9. Chang, M.: Monte Carlo Simulation for the Pharmaceutical Industry CRC Biostatistics Series (2010)

  10. Chaslot, G, Saito, J.t., Uiterwijk, J.W.H.M., Bouzy, B., Herik, H.J.: Monte-Carlo strategies for computer go

  11. Chaslot, G.M.J-B., Winands, M.H.M., van den Herik, J.H., Uiterwijk, J.W.H.M., Bouzy, B.: Progressive strategies for monte-carlo tree search. Math. Nat. Comput. 4, 343–357 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM (JACM) 54(3), 14 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Erdélyi, 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–670 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC-4(2), 100–107 (1968)

    Article  Google Scholar 

  15. Hazon, N., Dunne, P.E., Kraus, S, Wooldridge, M.: How to rig elections and competitions. Proc. COMSOC (2008)

  16. Holte, R., Schaeffer, J., Felner, A.: Mechanical generation of admissible heuristics. Part I: Heuristics, 43 (2010)

  17. Kim, M.P, Suksompong, W., Williams, V.V.: Who can win a single-elimination tournament? In: AAAI, pp 516–522 (2016)

  18. Kim, M.P., Williams, V.V.: Fixing tournaments for kings, chokers, and more. In: IJCAI, pp. 561–567 (2015)

  19. Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artif. Intell. 27, 97–109 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  20. Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: IJCAI, vol. 7, pp. 1372–1377 (2007)

  21. Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: IJCAI, vol. 7, pp. 1372–1377 (2007)

  22. 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–581 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  23. Moulin, H., Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press (2016)

  24. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem-Solving. Addison-Wesley, Reading (1985)

    Google Scholar 

  25. Russell, T., Van Beek, P: Detecting manipulation in cup and round robin sports competitions. In: 2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI), vol. 1, pp. 285–290. IEEE (2012)

  26. Russell, T., Walsh, T.: Manipulating tournaments in cup and round robin competitions. In: International Conference on Algorithmic DecisionTheory, pp. 26–37. Springer (2009)

  27. Schadd, M.P.D., Winands, M.H.M., Van Den Herik, J.H., Aldewereld, H.: Addressing np-complete puzzles with monte-carlo methods. In: Proceedings of the AISB 2008 Symposium on Logic and the Simulation of Interaction and Reasoning, vol. 9 (2008)

  28. Shrot, T., Aumann, Y., Kraus, S.: On agent types in coalition formation problems. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, vol. 1, pp. 757–764. International Foundation for Autonomous Agents and Multiagent Systems (2010)

  29. Stanton, I., Williams, V.V.: Manipulating stochastically generated single-elimination tournaments for nearly all players. In: WINE, pp. 326–337. Springer (2011)

  30. Stanton, I., Williams, V.V.: Rigging tournament brackets for weaker players. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol. 22, pp. 357 (2011)

  31. Thuc, V u, Altman, Alon, Shoham, Yoav: On the Agenda Control Problem in Knockout Tournaments. Proc COMSOC (2008)

  32. 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, vol. 1, pp. 225–232. International Foundation for Autonomous Agents and Multiagent Systems (2009)

  33. Williams, V.V.: Fixing a tournament. In: AAAI (2010)

Download references

Author information

Authors and Affiliations

  1. Ben Gurion University, Beer Sheva, 8410501, Israel

    Noa Eidelstein

  2. Sami Shamoon College of Engineering, 84 Jabotinski St., Ashdod, 77245, Israel

    Lior Aronshtam & Tammar Shrot

  3. Department of Physics, NRCN, P.O. Box 9001, Beer Sheva, 84190, Israel

    Eitan Eidelstein

  4. Tel Aviv University, Tel Aviv-Yafo, Israel

    Eitan Eidelstein

Authors
  1. Noa Eidelstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lior Aronshtam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eitan Eidelstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tammar Shrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Noa Eidelstein.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Eidelstein, N., Aronshtam, L., Eidelstein, E. et al. Controlling sub-tournaments: easy or hard problem?. Ann Math Artif Intell 86, 257–268 (2019). https://doi.org/10.1007/s10472-019-09638-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-019-09638-6

Keywords

Mathematics Subject Classification (2010)

Search

Navigation