Games of Boldness, Where the Player Performing the Hardest Task Wins

Mordechai Henig and Barry O'Neill
Additional contact information
Mordechai Henig: Tel Aviv University, Tel Aviv, Israel
Barry O'Neill: York University, Toronto, Canada

Operations Research, 1992, vol. 40, issue 1, 76-86

Abstract: In a game of boldness a player chooses one from a group of tasks, each having a known probability of success. The player attempts the task, and wins if it succeeds and has the lowest probability of any that succeed. Y. Gerchak and M. Henig (1986) showed that sports competitions that take this form and have players perform sequentially with full information are biased, in that the order of play helps later competitors. We discuss six game variants embodying different types of information possessed by the players before they choose, and different rules about the sequence of choice. Our results suggest that contests would be fairer if players were told others' task difficulties but not told their successes. Y. Gerchak and M. Kilgour's proposal to make later players choose tasks no easier than previous ones, also does well in regard to fairness and practicality.

Keywords: games/group decisions: continuous games of bidding and timing; recreation and sports: fairness of contest rules (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.1.76 (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:oropre:v:40:y:1992:i:1:p:76-86

Access Statistics for this article

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