Single-Elimination Brackets Fail to Approximate Copeland Winner.

DOI10.4230/LIPICS.APPROX-RANDOM.2019.13MaRDI QIDQ5875465zbMATH OpenOpenAlexFDO

Authors Reyna Hulett

Publication date 3 February 2023

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

zbMATH Keywords

approximationmechanism designquery complexityvoting theory

Mathematics Subject Classification ID

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

Cites work

• A new perspective on implementation by voting trees
• A note on the query complexity of the Condorcet winner problem
• Elusiveness of finding degrees
• Finding Scores in Tournaments
• scientific article; zbMATH DE number 1003289 (Why is no real title available?)
• On most effective tournament plans with fewer games than competitors
• Sophisticated voting rules: The case of two tournaments
• Who can win a single-elimination tournament?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875465)