English
Related papers

Related papers: Generalized Kings and Single-Elimination Winners i…

200 papers

Randomness is a central concept to statistics and physics. Here, a statistical analysis shows experimental evidence that tossing coins and finding last digits of prime numbers are identical regarding statistics for equally likely outcomes.…

Applications · Statistics 2019-10-29 Yeseul Kim , Byung Mook Weon

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

A collection of $n$ random events is said to be $(n - 1)$-wise independent if any $n - 1$ events among them are mutually independent. We characterise all probability measures with respect to which $n$ random events are $(n - 1)$-wise…

Probability · Mathematics 2022-11-04 Karthik Natarajan , Arjun Kodagehalli Ramachandra , Colin Tan

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

Combinatorics · Mathematics 2024-05-02 Alistair Benford , Louis DeBiasio , Paul Larson

Combinatorial/probabilistic models for cross-country dual-meets are proposed. The first model assumes that all runners are equally likely to finish in any possible order. The second model assumes that each team is selected from a large…

Applications · Statistics 2019-11-15 Kurt S. Riedel

We propose and study a new model for competitions, specifically sports multi-player leagues where the initial strengths of the teams are independent i.i.d. random variables that evolve during different days of the league according to…

Probability · Mathematics 2025-09-10 Jacopo Borga , Benedetta Cavalli

That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…

Probability · Mathematics 2009-09-04 S. N. Ethier , Jiyeon Lee

In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong players, where the scores take values in $[0,\,1]$.

Probability · Mathematics 2025-12-04 Gideon Amir , Yaakov Malinovsky

We study the population genetics of Evolution in the important special case of weak selection, in which all fitness values are assumed to be close to one another. We show that in this regime natural selection is tantamount to the…

Computer Science and Game Theory · Computer Science 2012-08-16 Erick Chastain , Adi Livnat , Christos Papadimitriou , Umesh Vazirani

Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…

Computer Science and Game Theory · Computer Science 2026-04-21 Davin Choo , Paul W. Goldberg , Nicholas Teh

We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…

Computer Science and Game Theory · Computer Science 2026-01-13 Sarvin Bahmani , Rasmus Ibsen-Jensen , Soumyajit Paul , Sven Schewe , Friedrich Slivovsky , Qiyi Tang , Dominik Wojtczak , Shufang Zhu

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose…

Logic in Computer Science · Computer Science 2015-07-01 Luca de Alfaro , Rupak Majumdar , Vishwanath Raman , Mariëlle Stoelinga

Proportionality is an attractive fairness concept that has been applied to a range of problems including the facility location problem, a classic problem in social choice. In our work, we propose a concept called Strong Proportionality,…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam , Mashbat Suzuki , Toby Walsh

Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…

Probability · Mathematics 2020-05-14 Luciano Pomatto , Philipp Strack , Omer Tamuz

This paper studies sequential quantum games under the assumption that the moves of the players are drawn from groups and not just plain sets. The extra group structure makes possible to easily derive some very general results characterizing…

Quantum Physics · Physics 2025-03-14 Theodore Andronikos

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…

Probability · Mathematics 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng

This article deals with ranking methods. We study the situation where a tournament between $n$ players $P_1$, $P_2$, \ldots $P_n$ gives the ranking $P_1 \succ P_2 \succ \cdots \succ P_n$, but, if the results of $P_n$ are no longer taken…

Computer Science and Game Theory · Computer Science 2025-03-05 Guillaume Chéze , Etienne Fieux

In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking problem with arbitrary preference intensities, incomplete and…

Computer Science and Game Theory · Computer Science 2019-04-10 László Csató

It is well-known that pure quantum states are typically almost maximally entangled, and thus have close to maximally mixed subsystems. We consider whether this is true for probabilistic theories more generally, and not just for quantum…

Quantum Physics · Physics 2012-11-13 Markus P. Müller , Oscar C. O. Dahlsten , Vlatko Vedral

We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from…

Data Analysis, Statistics and Probability · Physics 2007-05-23 E. Ben-Naim , F. Vazquez , S. Redner