Simple search methods for finding a Nash equilibrium
From MaRDI portal
Publication:932813
DOI10.1016/J.GEB.2006.03.015zbMATH Open1142.91313OpenAlexW1991799203MaRDI QIDQ932813FDOQ932813
Authors: R. Porter, Eugene Nudelman, Yoav Shoham 
Publication date: 11 July 2008
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2006.03.015
Recommendations
- Enumeration of Nash equilibria for two-player games
- Equilibrium computation for two-player games in strategic and extensive form
- Computing Nash equilibria by iterated polymatrix approximation
- A procedure for finding Nash equilibria in bi-matrix games
- Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
Cites Work
- A new polynomial-time algorithm for linear programming
- Equilibrium points in n -person games
- The maximal number of regular totally mixed Nash equilibria
- Title not available (Why is that?)
- On the Strategic Stability of Equilibria
- Bimatrix Equilibrium Points and Mathematical Programming
- New complexity results about Nash equilibria
- Multi-agent influence diagrams for representing and solving games.
- Equilibrium Points of Bimatrix Games
- Title not available (Why is that?)
- Algorithms, games, and the internet
- On total functions, existence theorems and computational complexity
- On the number of pure strategy Nash equilibria in random games
- Asymptotic expected number of Nash equilibria of two-player normal form games
- A continuation method for Nash equilibria in structured games
- Title not available (Why is that?)
- Nash and correlated equilibria: Some complexity considerations
- Equilibrium Points of Bimatrix Games
- A global Newton method to compute Nash equilibria.
- Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
- Programming of Interdependent Activities: I General Discussion
Cited In (35)
- Stationary equilibria in discounted stochastic games
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
- A non-cooperative multi-leader one-follower integrated generation maintenance scheduling problem under the risk of generation units' disruption and variation in demands
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
- Action-graph games
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- New complexity results about Nash equilibria
- Graph transduction as a noncooperative game
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
- Successful Nash equilibrium agent for a three-player imperfect-information game
- Nondominated Nash points: application of biobjective mixed integer programming
- Recent development in computational complexity characterization of Nash equilibrium
- Enumeration of Nash equilibria for two-player games
- Computing approximate Nash equilibria and robust best-responses using sampling
- Computing equilibria for integer programming games
- Imitation games and computation
- Perspectives on multiagent learning
- Smoothing techniques for computing Nash equilibria of sequential games
- Incentive-based search for equilibria in Boolean games
- Empirical distribution of equilibrium play and its testing application
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- Robust game theory
- Behavioural strategies in weighted Boolean games
- Solving possibilistic games with incomplete information
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
- Finding all Nash equilibria of a finite game using polynomial algebra
- Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition
- Correlated equilibria and fairness in concurrent stochastic games
- Two-player simultaneous location game: preferential rights and overbidding
- Computing equilibria: a computational complexity perspective
- A global optimization algorithm for solving a four-person game
- On Stackelberg mixed strategies
- Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games
- Computational analysis of perfect-information position auctions
- Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
Uses Software
This page was built for publication: Simple search methods for finding a Nash equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932813)
