The Library
A short solution to the many-player silent duel with arbitrary consolation prize
Tools
Alpern, Steve and Howard, J. V. (2019) A short solution to the many-player silent duel with arbitrary consolation prize. European Journal of Operational Research, 273 (2). pp. 646-649. doi:10.1016/j.ejor.2018.08.040 ISSN 0377-2217.
|
PDF
WRAP-short-solution-silent-duel-arbitrary-prize-Alpern-2018.pdf - Accepted Version - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (653Kb) | Preview |
Official URL: https://doi.org/10.1016/j.ejor.2018.08.040
Abstract
The classical constant-sum ‘silent duel’ game had two antagonistic marksmen walking towards each other. A more friendly formulation has two equally skilled marksmen approaching targets at which they may silently fire at distances of their own choice. The winner, who gets a unit prize, is the marksman who hits his target at the greatest distance; if both miss, they share the prize (each gets a ‘consolation prize’ of one half). In another formulation, if they both miss they each get zero. More generally we can consider more than two marksmen and an arbitrary consolation prize. This non-constant sum game may be interpreted as a research tournament where the entrant who successfully solves the hardest problem wins the prize. We consider only the ‘symmetric’ case where all players are identical (having the same probability of missing at a given distance), and for this case we give the first complete solution to the many-player problem with arbitrary consolation prize. Moreover our theorem includes both the zero and non-zero-sum cases (by taking particular values for the consolation prize), and has a relatively simple proof.
Item Type: | Journal Article | ||||||||
---|---|---|---|---|---|---|---|---|---|
Subjects: | H Social Sciences > HB Economic Theory | ||||||||
Divisions: | Faculty of Social Sciences > Warwick Business School | ||||||||
Library of Congress Subject Headings (LCSH): | Game theory, Shooting -- Competitions, Mathematics -- Competitions | ||||||||
Journal or Publication Title: | European Journal of Operational Research | ||||||||
Publisher: | Elsevier Science BV | ||||||||
ISSN: | 0377-2217 | ||||||||
Official Date: | 1 March 2019 | ||||||||
Dates: |
|
||||||||
Volume: | 273 | ||||||||
Number: | 2 | ||||||||
Page Range: | pp. 646-649 | ||||||||
DOI: | 10.1016/j.ejor.2018.08.040 | ||||||||
Status: | Peer Reviewed | ||||||||
Publication Status: | Published | ||||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||||
Date of first compliant deposit: | 28 August 2018 | ||||||||
Date of first compliant Open Access: | 31 August 2020 | ||||||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year