A note on the query complexity of the Condorcet winner problem

DOI10.1016/j.ipl.2008.07.012zbMath1191.68899OpenAlexW2019927599MaRDI QIDQ975500

Ariel D. Procaccia

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.012

zbMATH Keywords

analysis of algorithmssocial choicegraph algorithmstheory of computationconcrete complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Query complexity of tournament solutions ⋮ Single-Elimination Brackets Fail to Approximate Copeland Winner.

Cites Work

• A topological approach to evasiveness
• On recognizing graph properties from adjacency matrices
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• Unnamed Item

This page was built for publication: A note on the query complexity of the Condorcet winner problem