Adaptive raising strategies optimizing relative efficiency

Authors:
Arnold Schönhage
Affiliations:
Institut für Informatik III, Universität Bonn, Bonn, Germany
Venue:
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Year:
2003

Citing 3
Cited 3

Searching in the plane

Information and Computation
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal constructions of hybrid algorithms

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Preface: Festschrift in honor of Arnold Schönhage

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Preface: Festschrift in honor of Arnold Schönhage

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Competitive search in symmetric trees

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive raising by successive trials t0 t1 g 1 has been found by tn ≥ g, causing total cost T(g)= t0+...+tn, is studied for optimizing T(g)/g. For corresponding games, where player G setting g and 'finder' F choosing t0, t1,... 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].