Query complexity of tournament solutions (Q6122601): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2024.114422 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3738839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal retentive sets in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Preference-Based Online Learning with Bandit Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of dominance relations in finite coalitional games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and decision models with multiple criteria. Stepping stones for the analyst. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Scores in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Margin of victory for tournament solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the linear ordering problem for weighted or unweighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evasiveness of Subgraph Containment and Related Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliciting Single-Peaked Preferences Using Comparison Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dutta's minimal covering set and Shapley's saddles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational properties of argument systems satisfying graph-theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament games and positive tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elusiveness of finding degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the complexity of tournament solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of the uncovered set in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions based on cooperative game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topological approach to evasiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who Can Win a Single-Elimination Tournament? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic bound for the complexity of monotone graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evasiveness through a circuit lens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartisan set of a tournament game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing from a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the query complexity of the Condorcet winner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing graph properties from adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust bounds on choosing from large tournaments / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2024.114422 / rank
 
Normal rank

Latest revision as of 18:39, 30 December 2024

scientific article; zbMATH DE number 7811877
Language Label Description Also known as
English
Query complexity of tournament solutions
scientific article; zbMATH DE number 7811877

    Statements

    Query complexity of tournament solutions (English)
    0 references
    0 references
    0 references
    1 March 2024
    0 references
    tournament
    0 references
    tournament solution
    0 references
    query complexity
    0 references
    lower bound
    0 references
    social choice
    0 references
    algorithm
    0 references
    voting
    0 references
    0 references

    Identifiers