Solving the Three-Player-Game

08/22/2020
by   Fangqi Li, et al.
0

In this paper we solve the three-player-game question. A three-player-game consists of a series of rounds. There are altogether three players. Two players participate in each round, at the end of the round the loser quits and the third player enters the ring and another round starts. The game terminates if all six win-lose relationships appear. During each round, two players win with equal probability. One is asked to calculate the expectation of the number of rounds. It turns out to be an exemplary question that involves probabiltiy theory and dynamic programming. It can serve as an instance or exercise in the chapter of conditional expectation of any elementary or advanced textbook on probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2022

On the distribution of winners' scores in a round-robin tournament

In a classical chess round-robin tournament, each of n players wins, dra...
research
08/26/2020

The tree search game for two players

We consider a two-player search game on a tree T. One vertex (unknown to...
research
04/22/2022

The Dark Souls of Archaeology: Recording Elden Ring

Archaeology can be broadly defined as the study and interpretation of th...
research
07/17/2021

BONUS! Maximizing Surprise

Multi-round competitions often double or triple the points awarded in th...
research
02/21/2018

Universal Growth in Production Economies

We study a simple variant of the von Neumann model of an expanding econo...
research
12/20/2021

Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments

The International Chess Federation (FIDE) imposes a voluminous and compl...
research
02/21/2023

The Swiss Gambit

In each round of a Swiss-system tournament, players of similar score are...

Please sign up or login with your details

Forgot password? Click here to reset