English
Related papers

Related papers: Analysing a built-in advantage in asymmetric darts…

200 papers

We study experimentally contests in which players make investment decisions sequentially, and information on prior investments is revealed between stages. Using a between-subject design, we consider all possible sequences in contests of…

General Economics · Economics 2025-08-20 Arthur B. Nelson , Dmitry Ryvkin

Tournaments are frequently used incentive mechanisms to enhance performance. In this paper, we use field data and show that skill disparities among contestants asymmetrically affect the performance of contestants. Skill disparities have…

General Economics · Economics 2024-10-29 Enzo Brox , Daniel Goller

The sequence of moves in a dynamic team tournament may distort the ex-ante winning probabilities and harm efficiency. This paper compares seven soccer penalty shootout rules that determine the kicking order, from a theoretical perspective.…

Computer Science and Game Theory · Computer Science 2023-02-24 László Csató , Dóra Gréta Petróczy

I study sequential contests where the efforts of earlier players may be disclosed to later players by nature or by design. The model has a range of applications, including rent seeking, R&D, oligopoly, public goods provision, and tragedy of…

Computer Science and Game Theory · Computer Science 2021-02-22 Toomas Hinnosaar

We study the effects of randomness on competitions based on an elementary random process in which there is a finite probability that a weaker team upsets a stronger team. We apply this model to sports leagues and sports tournaments, and…

Physics and Society · Physics 2013-04-02 E. Ben-Naim , N. W. Hengartner , S. Redner , F. Vazquez

The complexity of chess matches has attracted broad interest since its invention. This complexity and the availability of large number of recorded matches make chess an ideal model systems for the study of population-level learning of a…

Data Analysis, Statistics and Probability · Physics 2013-02-19 H. V. Ribeiro , R. S. Mendes , E. K. Lenzi , M. del Castillo-Mussot , L. A. N. Amaral

Repetition-based draw rules in deterministic games like chess ensure termination but introduce strategic artifacts, allowing players to enforce draws independent of positional value. We propose an asymmetric modification: threefold…

Computer Science and Game Theory · Computer Science 2026-04-07 Chong Qi

In most professional sports, the structure of the environment is kept neutral so that scoring imbalances may be attributed to differences in team skill. It thus remains unknown what impact structural heterogeneities can have on scoring…

Physics and Society · Physics 2013-11-04 Sears Merritt , Aaron Clauset

In the game of cricket, the result of coin toss is assumed to be one of the determinants of match outcome. The decision to bat first after winning the toss is often taken to make the best use of superior pitch conditions and set a big…

Applications · Statistics 2020-07-14 Manar D. Samad , Sumen Sen

Recent theory shows that extortioners taking advantage of the zero-determinant (ZD) strategy can unilaterally claim an unfair share of the payoffs in the Iterated Prisoner's Dilemma. It is thus suggested that against a fixed extortioner,…

Physics and Society · Physics 2022-01-13 Xingru Chen , Feng Fu

The game of darts has enjoyed great growth over the past decade with the perception of darts moving from that of a pub game to a game that is regularly scheduled on prime-time television in many countries including the U.K., Germany, the…

Applications · Statistics 2022-02-22 Martin B. Haugh , Chun Wang

Across machine learning (ML) sub-disciplines, researchers make explicit mathematical assumptions in order to facilitate proof-writing. We note that, specifically in the area of fairness-accuracy trade-off optimization scholarship, similar…

Computers and Society · Computer Science 2021-09-09 A. Feder Cooper , Ellen Abrams

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing. This work is about the complexity behind these proofs: how hard is it to actually…

Data Structures and Algorithms · Computer Science 2019-11-19 Greg Bodwin , Ofer Grossman

We consider a Bradley-Terry model in random environment where each player faces each other once. More precisely the strengths of the players are assumed to be random and we study the influence of their distributions on the asymptotic number…

Probability · Mathematics 2015-10-09 Raphael Chetrite , Roland Diel , Matthieu Lerasle

We demonstrate the usefulness of adding delay to infinite games with quantitative winning conditions. In a delay game, one of the players may delay her moves to obtain a lookahead on her opponent's moves. We show that determining the winner…

Computer Science and Game Theory · Computer Science 2017-04-21 Martin Zimmermann

Differentiable Architecture Search (DARTS) is now a widely disseminated weight-sharing neural architecture search method. However, it suffers from well-known performance collapse due to an inevitable aggregation of skip connections. In this…

Machine Learning · Computer Science 2020-07-17 Xiangxiang Chu , Tianbao Zhou , Bo Zhang , Jixiang Li

In this paper we examine the effectiveness of five mathematical models used to predict the outcomes of amateur darts games. These models not only predict the outcomes at the start of the game, but also update their estimations as the game…

Applications · Statistics 2025-11-19 Ayham Makhamra , Yelyzaveta Satynska , Michael Weselcouch

Multi-round competitions often double or triple the points awarded in the final round, calling it a bonus, to maximize spectators' excitement. In a two-player competition with $n$ rounds, we aim to derive the optimal bonus size to maximize…

Computer Science and Game Theory · Computer Science 2024-06-10 Zhihuan Huang , Yuqing Kong , Tracy Xiao Liu , Grant Schoenebeck , Shengwei Xu

In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a…

Computer Science and Game Theory · Computer Science 2023-06-22 Milad Aghajohari , Guy Avni , Thomas A. Henzinger
‹ Prev 1 2 3 10 Next ›