Margin of victory for tournament solutions
From MaRDI portal
Publication:2060724
DOI10.1016/j.artint.2021.103600zbMath1481.91074arXiv1911.06289OpenAlexW3203012417MaRDI QIDQ2060724
Ulrike Schmidt-Kraepelin, Markus Brill, Warut Suksompong
Publication date: 13 December 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.06289
Related Items (3)
Fixing knockout tournaments with seeds ⋮ Query complexity of tournament solutions ⋮ Margin of victory for tournament solutions
Cites Work
- Unnamed Item
- Unnamed Item
- The minimal covering set in large tournaments
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Choosing from a large tournament
- A survey on the complexity of tournament solutions
- On finding a minimum dominating set in a tournament
- Tournament solutions and majority voting
- Extending tournament solutions
- On the structure of stable tournament solutions
- Fixing balanced knockout and double elimination tournaments
- On the evaluation of election outcomes under uncertainty
- On limited nondeterminism and the complexity of the V-C dimension
- Margin of victory for tournament solutions
- Bounds on the disparity and separation of tournament solutions
- Possible winner problems on partial tournaments: a parameterized study
- Banks winners in tournaments are difficult to recognize
- A refinement of the uncovered set in tournaments
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- On the Discriminative Power of Tournament Solutions
- Length-bounded cuts and flows
- Maximal Flow Through a Network
- NON-NULL RANKING MODELS. I
- Possible and Necessary Winners of Partial Tournaments
- Finding minimum-cost circulations by canceling negative cycles
- Manipulating Tournaments in Cup and Round Robin Competitions
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- Tournament games and positive tournaments
- Tournament Solutions
- Control and Bribery in Voting
- Who Can Win a Single-Elimination Tournament?
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A Constructive Solution to a Tournament Problem
- On a Problem in Graph Theory
- Combinatorial optimization. Theory and algorithms.
- Robust bounds on choosing from large tournaments
- A note on the McKelvey uncovered set and Pareto optimality
This page was built for publication: Margin of victory for tournament solutions
