Related papers: Distribution of winners in truel games
In this paper we review some of the main results obtained in the field of truels. A "truel" is a generalization of a duel involving three players. Depending on the rules used for chosing the players, we may distinguish between the random,…
We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…
In game theory, a popular model of a struggle for survival among three competing agents is a truel, or three person generalization of a duel. Adopting the ideas recently developed in quantum game theory, we present a quantum scheme for the…
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…
We develop a Markov model of curling matches, parametrised by the probability of winning an end and the probability distribution of scoring ends. In practical applications, these end-winning probabilities can be estimated econometrically,…
In a classical chess round-robin tournament, each of $n$ players wins, draws, or loses a game against each of the other $n-1$ players. A win rewards a player with 1 points, a draw with 1/2 point, and a loss with 0 points. We are interested…
Consider a system of \(n\) players in which each initially starts on a different team. At each time step, we select an individual winner and an individual loser randomly and the loser joins the winner's team. The resulting Markov chain and…
In this paper we study a variant of the Nuel game (a generalization of the duel) which is played in turns by $N$ players. In each turn a single player must fire at one of the other players and has a certain probability of hitting and…
We analyze the dynamics of competitions with a large number of players. In our model, n players compete against each other and the winner is decided based on the standings: in each competition, the mth ranked player wins. We solve for the…
We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…
We establish a general formula for the distribution of the score in table tennis. We use this formula to derive the probability distribution (and hence the expectation and variance) of the number of rallies necessary to achieve any given…
Evolutionary game theory is a powerful mathematical framework to study how intelligent individuals adjust their strategies in collective interactions. It has been widely believed that it is impossible to unilaterally control players'…
In late May of 2014 I received an email from a colleague introducing to me a non-transitive game developed by Walter Penney. This paper explores this probability game from the perspective of a coin tossing game, and further discusses some…
We present a theoretical analysis of the Elo rating system, a popular method for ranking skills of players in an online setting. In particular, we study Elo under the Bradley--Terry--Luce model and, using techniques from Markov chain…
In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…
We consider a general class of round-robin tournament models of equally strong players. In these models, each of the $n$ players competes against every other player exactly once. For each match between two players, the outcome is a value…
This paper has a two-folded purpose. First, we attempt to outline the development of the turnpike theorems in the the last several decades. Second, we study turnpike theorems in finite-horizon two-person zero-sum Markov games on a general…
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…
Toral introduced so-called cooperative Parrondo games, in which there are N players (3 or more) arranged in a circle. At each turn one player is randomly chosen to play. He plays either game A or game B, depending on the strategy. Game A…
In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to…