The computational complexity of weak saddles

DOI10.1007/s00224-010-9298-zzbMath1278.91009OpenAlexW4238938794MaRDI QIDQ647484

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

zbMATH Keywords

computational complexitygame theorysolution conceptsShapley's saddles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

An ordinal minimax theorem

Cites Work

• The complexity of computing minimal unidirectional covering sets
• Computing the minimal covering set
• Covering sets and a new Condorcet choice correspondence
• More complicated questions about maxima and minima, and some closures of NP
• Strategy subsets closed under rational behavior
• Dominated strategies and common knowledge
• Dutta's minimal covering set and Shapley's saddles
• Non-cooperative games
• The Complexity of Eliminating Dominated Strategies
• Rationalizable Strategic Behavior and the Problem of Perfection
• Rationalizable Strategic Behavior
• Settling the complexity of computing two-player Nash equilibria
• On the Complexity of Iterated Weak Dominance in Constant-Sum Games
• Exact analysis of Dodgson elections
• The Complexity of Computing a Nash Equilibrium
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The computational complexity of weak saddles