The computational complexity of weak saddles
DOI10.1007/S00224-010-9298-ZzbMATH Open1278.91009OpenAlexW4238938794MaRDI QIDQ647484FDOQ647484
Felix Brandt, Markus Brill, Felix Fischer, Jan Hoffmann
Publication date: 23 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9298-z
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05)
Cites Work
- Title not available (Why is that?)
- Non-cooperative games
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of iterated weak dominance in constant-sum games
- Title not available (Why is that?)
- The Complexity of Computing a Nash Equilibrium
- Title not available (Why is that?)
- Dominated strategies and common knowledge
- More complicated questions about maxima and minima, and some closures of NP
- Settling the complexity of computing two-player Nash equilibria
- Strategy subsets closed under rational behavior
- Rationalizable Strategic Behavior and the Problem of Perfection
- Rationalizable Strategic Behavior
- The Complexity of Eliminating Dominated Strategies
- The complexity of computing minimal unidirectional covering sets
- Exact analysis of Dodgson elections
- Computing the minimal covering set
- Covering sets and a new Condorcet choice correspondence
- Dutta's minimal covering set and Shapley's saddles
Cited In (2)
This page was built for publication: The computational complexity of weak saddles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647484)
