A note on the query complexity of the Condorcet winner problem

Authors:
Ariel D. Procaccia
Affiliations:
School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem 91904, Israel
Venue:
Information Processing Letters
Year:
2008

Citing 4
Cited 1

Lower bounds on the complexity of graph properties

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Sorting, minimal feedback sets, and Hamilton paths in tournaments

SIAM Journal on Discrete Mathematics
On the time required to recognize properties of graphs: a problem

ACM SIGACT News
Communication complexity of common voting rules

Proceedings of the 6th ACM conference on Electronic commerce

Compilation and communication protocols for voting rules with a dynamic set of candidates

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge

Quantified Score

Hi-index	0.89

Visualization

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.