EconPapers    
Economics at your fingertips  
 

A Probability Model for Strategic Bidding on “The Price Is Right”

Paul H. Kvam ()
Additional contact information
Paul H. Kvam: Department of Mathematics and Computer Science, University of Richmond, Richmond, Virginia 23173

Decision Analysis, 2018, vol. 15, issue 4, 195-207

Abstract: The TV game show “The Price is Right” features a bidding auction called “Contestants’ Row” that rewards the player (out of 4) who bids closest to an item’s value, without overbidding. This paper considers ways in which players can maximize a winning probability based on the player's bidding order. We consider marginal strategies in which players assume opponents are bidding individually perceived values of the merchandise. Based on preceding bids of others, players have information available to create strategies. We consider conditional strategies in which players adjust bids knowing other players are using strategies. The last bidder has a large advantage in both scenarios because of receiving the most information from opposing players and being able to bid the minimal amount over an opponent’s bid without incurring extra risk. Finally, we measure how confidence can affect a player’s winning probability.

Keywords: Keywords; auction; marginal strategy; normal distribution; order statistics; simulation study (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1287/deca.2018.0373 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ordeca:v:15:y:2018:i:4:p:195-207

Access Statistics for this article

More articles in Decision Analysis from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ordeca:v:15:y:2018:i:4:p:195-207