Query complexity of tournament solutions
From MaRDI portal
Publication:6122601
DOI10.1016/j.tcs.2024.114422arXiv1611.06189OpenAlexW2963028321MaRDI QIDQ6122601
Publication date: 1 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.06189
Cites Work
- Unnamed Item
- Minimal retentive sets in tournaments
- An asymptotic bound for the complexity of monotone graph properties
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
- A note on the query complexity of the Condorcet winner problem
- Characterization of dominance relations in finite coalitional games
- Computational properties of argument systems satisfying graph-theoretic constraints
- A survey on the complexity of tournament solutions
- A topological approach to evasiveness
- Choosing from a tournament
- The bipartisan set of a tournament game
- On recognizing graph properties from adjacency matrices
- Tournament solutions and majority voting
- Dutta's minimal covering set and Shapley's saddles
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Margin of victory for tournament solutions
- Tournament solutions based on cooperative game theory
- Elusiveness of finding degrees
- A refinement of the uncovered set in tournaments
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Evasiveness of Subgraph Containment and Related Properties
- A Survey of Preference-Based Online Learning with Bandit Algorithms
- Evasiveness through a circuit lens
- Eliciting Single-Peaked Preferences Using Comparison Queries
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- Tournament games and positive tournaments
- Finding Scores in Tournaments
- Who Can Win a Single-Elimination Tournament?
- Robust bounds on choosing from large tournaments
This page was built for publication: Query complexity of tournament solutions
