Abstract
Assume that n players are represented by n reals, uniformly distributed over the unit interval.
We assume that the error probability of a comparison game between two players depends linearly on the distance between the players. Using sequential analysis approach, we present an algorithm to estimate the maximum ξ of the players with an error less than ε.
Mean cost, variance and centered moments generating function are analyzed.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Adler, P. Gemmell, M. Harchol, R.M. Karp and Cl. Kenyon Selection in the Presence of Noise: The Design of Playoff Systems Proc. SODA 1994, San Francisco.
D.A. Darling and J.F. Siegert The First Passage Problem for a Continuous Markov Process An. Math. Stat. 1953, 624–639.
U. Feige, D. Peleg, P. Raghavan and E. Upfal Computing with Unreliable Information. In Symposium on Theory of Computing, 1990, 128–137.
B.K. Gosh and P.K. Sen Handbook of Sequential Analysis. Marcel Dekker, 1991.
G. Louchard, R. Schott Probabilistic Analysis of Some Distributed Algorithms. Wiley, Random Structures and Algorithms 2, 2, 1991, 151–186.
G. Louchard Finding the maximum with linear error probabilities: a sequential analysis approach, Département d'Informatique, TR-297, 1994.
V.V. Petrov Sums of Independent Random Variables Ergebnisse der Mathematik und ihrer Grenzgebiete. Band 82, Springer-Verlag, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Louchard, G. (1995). Finding the maximum with linear error probabilities: a sequential analysis approach. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_58
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive