OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH

DOI10.1017/S026996481600022XzbMath1414.91046arXiv1509.03327MaRDI QIDQ5358097

No author found.

Publication date: 19 September 2017

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.03327

zbMATH Keywords

two-player gamestochastic gameoptimal search strategy

Mathematics Subject Classification ID

Searching and sorting (68P10) 2-person games (91A05) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Cites Work

• Unnamed Item
• The complexity of stochastic games
• The asymptotic probability of a tie for first place
• Optimal strategy in a dice game
• A REAL-WORLD STOCHASTIC TWO-PERSON GAME
• Two New Models for the Two-Person Red-And-Black Game
• Two-person red-and-black stochastic games
• Two-person red-and-black with bet-dependent win probabilities
• The asymptotics of group Russian roulette
• Stochastic Games

This page was built for publication: OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH