Abstract
Adaptive raising by successive trials t 0 < t 1 < ... until some unknown goal g > 1 has been found by t n ≥ g, causingtotal cost T(g) = t 0+...+t n, is studied for optimizing T(g)/g. For corregames, where player G setting g and ‘finder’ F choosing t 0, t 1, . . . are playing mixed strategies, we prove a “Law of optimal adapting factor e”. Section 2 is more general about adaptive raising on several tracks, in Sect. 3 we add proofs for the optimal competitive factors under corresponding worst case analysis.— Methods and results are similar to those about searching for a point on a line or on many rays, see [[1], [3], [4], [5], [6]].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. A. Baeza-Yates, J. C. Culberson, and G. J. E. Rawlins, Searching in the plane. Information and Computation 106 (1993), 234–252.
A. Beck and D. J. Newman, Yet more on the linear search problem. Israel J. Math. 8 (1970), 419–429.
R. Bellman, A minimization problem. Bull. AMS 62 (1956), 270. — An optimal search problem. — problem 63-9 in SIAM Rev. 5 (1963), 274.
S. Gal, Minimax solutions for linear search problems. SIAM J. Appl. Math. 27 (1974), 17–30.
M. Y. Kao, Y. Ma, M. Sipser, and Y. Yin, Optimal constructions of hybrid algorithms. J. of Algorithms 29 (1998), 142–164; — also in Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (1994), 372–381.
M. Y. Kao, J. H. Reif, and S. R. Tate, Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation 131 (1997), 63–80; — also in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (1993), 441–447.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schönhage, A. (2003). Adaptive Raising Strategies Optimizing Relative Efficiency. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_49
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive