A note on the query complexity of the Condorcet winner problem
- 30 November 2008
- journal article
- research article
- Published by Elsevier BV in Information Processing Letters
- Vol. 108 (6), 390-393
- https://doi.org/10.1016/j.ipl.2008.07.012
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Communication complexity of common voting rulesPublished by Association for Computing Machinery (ACM) ,2005
- Sorting, Minimal Feedback Sets, and Hamilton Paths in TournamentsSIAM Journal on Discrete Mathematics, 1990
- Lower bounds on the complexity of graph propertiesPublished by Association for Computing Machinery (ACM) ,1988
- A topological approach to evasivenessCombinatorica, 1984
- On recognizing graph properties from adjacency matricesTheoretical Computer Science, 1976
- On the time required to recognize properties of graphsACM SIGACT News, 1973
- A Theorem on the Construction of Voting ParadoxesEconometrica, 1953