Single-Elimination Brackets Fail to Approximate Copeland Winner.

DOI10.4230/LIPICS.APPROX-RANDOM.2019.13OpenAlexW2978964064MaRDI QIDQ5875465

Reyna Hulett

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.13

zbMATH Keywords

approximationvoting theorymechanism designquery complexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• A note on the query complexity of the Condorcet winner problem
• On most effective tournament plans with fewer games than competitors
• Sophisticated voting rules: The case of two tournaments
• Elusiveness of Finding Degrees
• Finding Scores in Tournaments
• A new perspective on implementation by voting trees
• Who Can Win a Single-Elimination Tournament?

This page was built for publication: Single-Elimination Brackets Fail to Approximate Copeland Winner.