Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?

DOI10.1007/S10472-017-9549-7MaRDI QIDQ2363601zbMATH OpenOpenAlexFDO

Authors L. Aronshtam, Havazelet Cohen, Tammar Shrot

Publication date 20 July 2017

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10472-017-9549-7

zbMATH Keywords

control manipulationknockout tournamentmanipulation in sportparameterized complexityvoting

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Recommendations

• Probability of Winning at Tennis I. Theory and Data
• scientific article; zbMATH DE number 867665
• Manipulating Tournaments in Cup and Round Robin Competitions
• Server advantage in tennis matches
• scientific article; zbMATH DE number 1046866
• A common-opponent stochastic model for predicting the outcome of professional tennis matches

Cites work

• Comparing Draws for Single Elimination Tournaments
• Control complexity in Bucklin and fallback voting: an experimental analysis
• Copeland Voting Fully Resists Constructive Control
• Elections with few voters: candidate control can be easy
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Fixing balanced knockout and double elimination tournaments
• Handbook of Computational Social Choice
• Handbook of social choice and welfare. Vol. 1.
• How hard is it to control an election?
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 503190 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• Introduction to algorithms.
• Is computational complexity a barrier to manipulation?
• Losing weight by gaining edges
• Manipulating Tournaments in Cup and Round Robin Competitions
• On the complexity of bribery and manipulation in tournaments with uncertain information
• Parameterized complexity of candidate control in elections and related digraph problems
• Parametrized complexity theory.
• Possible and necessary winners of partial tournaments
• The Complexity of Probabilistic Lobbying
• The computational difficulty of manipulating an election
• Who can win a single-elimination tournament?

Cited in

(6)

• Fixing balanced knockout and double elimination tournaments
• Fair elimination-type competitions
• Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis
• Manipulating Tournaments in Cup and Round Robin Competitions
• Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
• Winning is not the only metric: the complexity of control manipulation in knockout tournaments for a redefined goal

This page was built for publication: Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363601)