2017/12/01 by Steve Alpern, Alpern, Steve, J. V. Howard +1
Computer Science · Decision Sciences · #Artificial Intelligence in Games #Computability, Logic, AI Algorithms #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Game Theory and Applications #cs.GT
paper · pdf · doi:10.48550/arxiv.1712.00274
7 pages, 2 figures
arxiv created 2017/12/01 · openalex publication_date 2017/12/01 · arxiv updated 2017/12/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 give the first complete solution to the many-player problem with arbitrary consolation prize: moreover (by taking particular values for the consolation prize), our theorem incorporates various special results in the literature, and our proof is simpler than any of these.