RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive

Trudy Inst. Mat. i Mekh. UrO RAN, 2019 Volume 25, Number 3, Pages 217–231 (Mi timm1660)

This article is cited in 3 papers

Optimal stopping strategies in the game “The Price Is Right”

T. V. Sereginaab, A. A. Ivashkocd, V. V. Mazalovce

a Ecole Nationale de l’Aviation Civile - Universite de Toulouse
b Toulouse Business School - Universite Toulouse I
c Institute of Applied Mathematical Research of the Karelian Research Centre RAS, Petrozavodsk
d Petrozavodsk State University
e School of Mathematics and Statistics, Qingdao University, Institute of Applied Mathematics, Qingdao, 266071, China

Abstract: The popular TV show “The Price Is Right” is an attractive source of modeling the strategic behavior in a competitive environment for a specific reward. In this study, the structure of the show is used as a basis for several game-theoretic settings. We consider a noncooperative optimal stopping game for a finite number of players. Each player earns points by observing the sums of independent random variables uniformly distributed on the unit interval. At each step, the player must decide whether to stop or continue the game. The winner is the player with the maximal score not exceeding unity. If the scores of all players exceed this limit, the winner is the player with the lowest score. We characterize the optimal strategies of the players in the multi-step version of the game with complete information about the scores of the previous players. We also compare the optimal strategies and payoffs of the players in the games with complete information and with no information. The notion of information price is introduced.

Keywords: optimal stopping, $n$-person game, Nash equilibrium, threshold strategy, complete information, Showcase Showdown.

UDC: 519.833

MSC: 60G40, 91A40, 91A06

Received: 06.08.2019
Revised: 15.08.2019
Accepted: 19.08.2019

DOI: 10.21538/0134-4889-2019-25-3-217-231


 English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2019, 307, suppl. 1, S127–S141

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025