Pith. sign in

REVIEW

Solving the Three-Player-Game

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.09796 v4 pith:O7AZ363O submitted 2020-08-22 math.PR cs.GT

classification math.PRcs.GT
keywords roundplayersthree-player-gameexpectationprobabilityquestionroundsadvanced
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools