DMCA
A Note on the Query Complexity of the Condorcet Winner Problem
Cached
Download Links
- [www.cs.huji.ac.il]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [procaccia.info]
- DBLP
Other Repositories/Bibliography
by
Ariel D. Procaccia
| Citations: | 5 - 1 self |
BibTeX
@MISC{Procaccia_anote,
author = {Ariel D. Procaccia},
title = {A Note on the Query Complexity of the Condorcet Winner Problem},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Given an unknown tournament over {1,..., n}, we show that the query complexity of the question “Is there a vertex with outdegree n − 1? ” (known as a Condorcet winner in social choice theory) is exactly 2n − ⌊log(n) ⌋ − 2. This stands in stark contrast to the evasiveness of this property in general digraphs.
