Abstract
Suppose we are searching for a target point t in the unit interval. To pinpoint the location of t, we issue query points \(q_1, \ldots , q_n \in [0,1]\). As a response, we obtain an ordering of the query points by distance to t. This restricts possible locations of t to a subinterval. We define the accuracy of a query strategy as the reciprocal of the size of the subinterval to which we can pinpoint t in the worst case. We describe a strategy with accuracy \(\Theta (n^2)\), which is at most a factor two from optimal if all query points are generated at once. With query points generated one by one depending on the response received on previous query points, we achieve accuracy \(\Omega (2.29^n)\), and prove that no strategy can achieve \(\Omega (3.66^n)\).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahn, H.-K., Cheng, S.-W., Cheong, O., Golin, M., van Oostrum, R.: Competitive facility location: the Voronoi game. Th. Comp. Sc. 310(1), 457–467 (2004)
Cole R., Yap, C. K.: Shape from probing. J. Alg. 8(1), 19–38 (1987)
Kahn, J., Saks, M.: Balancing poset extensions. Order 1, 113–126 (1984)
Matoušek, J.: Lectures on discrete geometry. Springer, New York (2002)
Skiena, S.: Interactive reconstruction via geometric probing. Proc. of the IEEE 80(9), 1364–1383 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Haverkort, H., Kübel, D., Langetepe, E., Schwarzwald, B. (2017). How to Play Hot and Cold on a Line. In: Ellen, F., Kolokolova, A., Sack, JR. (eds) Algorithms and Data Structures. WADS 2017. Lecture Notes in Computer Science(), vol 10389. Springer, Cham. https://doi.org/10.1007/978-3-319-62127-2_38
Download citation
DOI: https://doi.org/10.1007/978-3-319-62127-2_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62126-5
Online ISBN: 978-3-319-62127-2
eBook Packages: Computer ScienceComputer Science (R0)