This article is available for purchase or by subscription. See below.
Abstract
|
A guessing game with two secret numbers is a game played between a
questioner and a responder. The two players first agree upon the set,
,
in which the game will be played, as well as the number of questions,
, which
will be asked by the questioner. The responder first chooses two distinct numbers from
. The
questioner then asks questions of the form “How many of your chosen numbers are in the
set
?”
to which the responder answers truthfully. The goal for the
questioner is to determine the responder’s two numbers using at most
questions. We study a continuous version of this game where
is the closed interval of real numbers from 0 to 1. We introduce tools to
study this game and use them to examine strategies for the questioner using
a geometric approach. We establish a condition that must be satisfied by
optimal strategies and give a strategy that can be made arbitrarily close to
optimal.
|
PDF Access Denied
However, your active subscription may be available on Project Euclid at
https://projecteuclid.org/involve
We have not been able to recognize your IP address
3.238.125.76
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 30.00:
Keywords
guessing games, search, combinatorics
|
Mathematical Subject Classification
Primary: 68P10
Secondary: 94D99
|
Milestones
Received: 5 April 2021
Revised: 20 August 2021
Accepted: 21 August 2021
Published: 14 March 2022
Communicated by Kenneth S. Berenhaut
|
|