An Asymptotic Solution of Dresher’s Guessing Game

DOI10.1007/978-3-642-25280-8_10zbMath1349.91070OpenAlexW1962783999MaRDI QIDQ3098098

Misha Stassen, Robbert J. Fokkink

Publication date: 11 November 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25280-8_10

zbMATH Keywords

asymptotic analysisbinary searchsearch game

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (2)

Operations research applications of dichotomous search ⋮ Open Problems on Search Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A dynamic model of collective bargaining
• The theory of search games and rendezvous.
• Search games and other applications of game theory
• Spatial dispersion as a dynamic coordination problem
• On a problem of optimal search
• Decomposition Principle for Linear Programs
• Learning How to Cooperate: Optimal Play in Repeated Coordination Games
• A High–Low search game on the unit interval
• Search for point in interval, with high–low feedback
• Searching for losers
• A Discrete Search Game
• Searching games with errors -- fifty years of coping with liars

This page was built for publication: An Asymptotic Solution of Dresher’s Guessing Game