English
Related papers

Related papers: Margin of Victory in Tournaments: Structural and E…

200 papers

Tournament solutions are frequently used to select winners from a set of alternatives based on pairwise comparisons between alternatives. Prior work has shown that several common tournament solutions tend to select large winner sets and…

Computer Science and Game Theory · Computer Science 2021-09-30 Markus Brill , Ulrike Schmidt-Kraepelin , Warut Suksompong

Determining how close a winner of an election is to becoming a loser, or distinguishing between different possible winners of an election, are major problems in computational social choice. We tackle these problems for so-called weighted…

Computer Science and Game Theory · Computer Science 2024-08-14 Michelle Döring , Jannik Peters

Knowledge of accurate relative skills in any competitive system is essential, but foundational approaches such as ELO discard extremely relevant performance data by concentrating exclusively on binary outcomes. While margin of victory (MOV)…

Machine Learning · Statistics 2025-06-03 Shivam Shorewala , Zihao Yang

The Single Transferable Vote (STV) is a system of preferential voting employed in multi-seat elections. Each vote cast by a voter is a (potentially partial) ranking over a set of candidates. No techniques currently exist for computing the…

Computer Science and Game Theory · Computer Science 2017-08-17 Michelle Blom , Peter J. Stuckey , Vanessa J. Teague

The margin of victory of an election is a useful measure to capture the robustness of an election outcome. It also plays a crucial role in determining the sample size of various algorithms in post election audit, polling etc. In this work,…

Artificial Intelligence · Computer Science 2015-05-05 Palash Dey , Y. Narahari

We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…

Computer Science and Game Theory · Computer Science 2026-01-27 Filip Nikolow , Piotr Faliszewski , Stanisław Szufa

Tournaments are widely used models to represent pairwise dominance between candidates, alternatives, or teams. We study the problem of providing certified explanations for why a candidate appears among the winners under various tournament…

Artificial Intelligence · Computer Science 2026-01-22 Clément Contet , Umberto Grandi , Jérôme Mengin

In this paper we bring a novel approach to the theory of tournament rankings. We combine two different theories that are widely used to establish rankings of populations after a given tournament. First, we use the statistical approach of…

General Mathematics · Mathematics 2007-05-23 M. Brozos-Vazquez , M. A. Campo-Cabana , J. C. Diaz-Ramos , J. Gonzalez-Diaz

Tournament procedures, recently introduced in Lugosi & Mendelson (2016), offer an appealing alternative, from a theoretical perspective at least, to the principle of Empirical Risk Minimization in machine learning. Statistical learning by…

Machine Learning · Statistics 2022-11-02 Pierre Laforgue , Stephan Clémençon , Patrice Bertail

This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and…

Artificial Intelligence · Computer Science 2016-11-28 Nhien Pham Hoang Bao , Hiroyuki Iida

This paper investigates the Tennis Momentum Model (TMM), which aims to enhance the understanding of match dynamics by integrating key factors such as efficiency, historical scoring probabilities, and real-time scoring data. The model is…

Applications · Statistics 2025-09-30 Jackson Graves , Daniel X. Guo , Ridge Shepherd , Alexander Young

The main objective of this paper is to investigate the extent to which the margin of victory can be predicted solely by the rankings of the opposing teams in NCAA Division I men's basketball games. Several past studies have modeled this…

Applications · Statistics 2018-03-14 David Beaudoin , Thierry Duchesne

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…

Computer Science and Game Theory · Computer Science 2020-02-18 Christian Saile , Warut Suksompong

Every sport needs rules. Tournament design refers to the rules that determine how a tournament, a series of games between a number of competitors, is organized. This study aims to provide an overview of the tournament design literature from…

Physics and Society · Physics 2025-05-20 Karel Devriesere , László Csató , Dries Goossens

We study tournaments where winning a rank-dependent prize requires passing a minimum performance standard. We show that, for any prize allocation, the optimal standard is always at a mode of performance that is weakly higher than the global…

Theoretical Economics · Economics 2024-12-03 Mikhail Drugov , Dmitry Ryvkin , Jun Zhang

There is a hidden energy in tennis, which cannot be seen or touched. It is the force that controls the flow of the game and is present in all types of matches. This mysterious force is Momentum. This study introduces an evaluation model…

Machine Learning · Computer Science 2024-08-06 Chang Liu , Tongyuan Yang , Yan Zhao

We explore a new way to evaluate generative models using insights from evaluation of competitive games between human players. We show experimentally that tournaments between generators and discriminators provide an effective way to evaluate…

Machine Learning · Statistics 2018-08-16 Catherine Olsson , Surya Bhupatiraju , Tom Brown , Augustus Odena , Ian Goodfellow

According to recent empirical studies, the group draw of major sports tournaments can imply a high level of uncertainty, and some lucky teams enjoy an unfair advantage over the other teams. We propose a novel technique to quantify this draw…

Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…

Data Structures and Algorithms · Computer Science 2024-12-17 Juhi Chaudhary , Hendrik Molter , Meirav Zehavi

We consider the manipulability of tournament rules for round-robin tournaments of $n$ competitors. Specifically, $n$ competitors are competing for a prize, and a tournament rule $r$ maps the result of all $\binom{n}{2}$ pairwise matches…

Computer Science and Game Theory · Computer Science 2016-06-01 Jon Schneider , Ariel Schvartzman , S. Matthew Weinberg
‹ Prev 1 2 3 10 Next ›