par Louchard, Guy 
Référence Lecture notes in computer science, 900, page (14-25)
Publication Publié, 1995
Référence Lecture notes in computer science, 900, page (14-25)
Publication Publié, 1995
Article révisé par les pairs
| Résumé : | 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. |
