New complexity results about Nash equilibria
type: Item
instance of: scholarly article
title: New complexity results about Nash equilibria
zbMATH Open document ID: 1142.91365
author: Vincent Conitzer
author: Tuomas Sandholm
published in: Games and Economic Behavior
publication date: 2008-07-11T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 91A35
Mathematics Subject Classification ID: 91A30
zbMATH DE Number: 5300770
describes a project that uses: GameShrink
MaRDI profile type: Publication
OpenAlex ID: W2013815105
cites work: Q3254691
cites work: The complexity of computing a best response automaton in repeated games with mixed strategies
cites work: Algorithms for Closed Under Rational Behavior (CURB) Sets
cites work: The complexity of theorem-proving procedures
cites work: The complexity of computing a Nash equilibrium
cites work: Game theory
cites work: Nash and correlated equilibria: Some complexity considerations
cites work: The Complexity of Eliminating Dominated Strategies
cites work: Lossless abstraction of imperfect information games
cites work: Q5715720
cites work: Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
cites work: Q4197641
cites work: Computable strategies for repeated prisoner's dilemma
cites work: The complexity of two-person zero-sum games in extensive form
cites work: Multi-agent influence diagrams for representing and solving games.
cites work: Efficient computation of equilibria for extensive two-person games
cites work: Equilibrium Points of Bimatrix Games
cites work: GO Is Polynomial-Space Hard
cites work: The Expected Number of Nash Equilibria of a Normal Form Game
cites work: Generic \(4\times 4\) two person games have at most 15 Nash equilibria
cites work: Computing sequential equilibria for two-player games
cites work: Non-computable strategies and discounted repeated games
cites work: Equilibrium points in n -person games
cites work: On players with a bounded number of states
cites work: Algorithms, games, and the internet
cites work: Computing correlated equilibria in multi-player games
cites work: The Complexity of Markov Decision Processes
cites work: Simple search methods for finding a Nash equilibrium
cites work: Q5342882
cites work: Hard-to-Solve Bimatrix Games
cites work: The Computational Complexity of Nash Equilibria in Concisely Represented Games
cites work: Stochastic Games
cites work: Noncooperative Stochastic Games
cites work: Q4131648
cites work: The complexity of computing the permanent
cites work: Efficient computation of behavior strategies
cites work: Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
DOI: 10.1016/J.GEB.2008.02.015
description: scientific article; zbMATH DE number 5300770