The computational complexity of weak saddles (Q647484): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Strategy subsets closed under rational behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing minimal unidirectional covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizable Strategic Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimal covering set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Iterated Weak Dominance in Constant-Sum Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Nash Equilibrium / 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: Covering sets and a new Condorcet choice correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Eliminating Dominated Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3252269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizable Strategic Behavior and the Problem of Perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominated strategies and common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More complicated questions about maxima and minima, and some closures of NP / rank
 
Normal rank

Latest revision as of 16:55, 4 July 2024

scientific article
Language Label Description Also known as
English
The computational complexity of weak saddles
scientific article

    Statements

    The computational complexity of weak saddles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2011
    0 references
    game theory
    0 references
    solution concepts
    0 references
    Shapley's saddles
    0 references
    computational complexity
    0 references

    Identifiers