Selection in the presence of noise: the design of playoff systems

Authors:
Micah Adler;Peter Gemmell;Mor Harchol-Balter;Richard M. Karp;Claire Kenyon
Affiliations:
Computer Science Division, UC Berkeley, Berkeley, CA;Sandia National Laboratories, Albuquerque, NM;Computer Science Division, UC Berkeley, Berkeley, CA;Computer Science Division, UC Berkeley, Berkeley, CA and International Computer Science Institute, Berkeley, CA;LIP, ENS-Lyon, 46 allée d'Italie, 69364 Lyon Cedex 07, France
Venue:
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Year:
1994

On selecting the largest element in spite of erroneous information

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Searching with known error probability

Theoretical Computer Science
Computing with unreliable information

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Searching in the presence of linearly bounded errors

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Two algorithms for nearest-neighbor search in high dimensions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Searching games with errors---fifty years of coping with liars

Theoretical Computer Science
Error-correcting tournaments

ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
The K-armed dueling bandits problem

Journal of Computer and System Sciences

Hi-index	0.01