Sequential competitions with nondecreasing levels of difficulty

Yigal Gerchak*, D. Marc Kilgour

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Acting in a predetermined order, players select nonincreasing probabilities and perform Bernoulli trials with these success probabilities. The winner is the last successful player, and a 'tie' occurs if all players fail. This game is a single-round idealization of athletic competitions such as high jump or pole vault. We find the unique subgame-perfect equilibrium to obtain optimal strategies. First, assuming that a tie has no value, we solve explicitly the game with five of fewer players, and report on numerical calculations for larger games. The properties of these games are surprising in several ways - for instance, the win probabilities under optimal play can decrease for players later in the sequence. In a separate calculation, we find that optimal strategies when there are three players depend critically on the utility of a tie. Based on these calculations, we assess the usefulness of a nondecreasing level of difficulty restriction in reducing inequities in a sequential competition.

Original languageEnglish
Pages (from-to)49-58
Number of pages10
JournalOperations Research Letters
Volume13
Issue number1
DOIs
StatePublished - Feb 1993
Externally publishedYes

Keywords

  • dynamic programming applications
  • recreations sports

Fingerprint

Dive into the research topics of 'Sequential competitions with nondecreasing levels of difficulty'. Together they form a unique fingerprint.

Cite this