Simple search methods for finding a Nash equilibrium

DOI10.1016/j.geb.2006.03.015zbMath1142.91313OpenAlexW1991799203MaRDI QIDQ932813

Yoav Shoham, Eugene Nudelman, Ryan Porter

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

zbMATH Keywords

algorithmsNash equilibriumcomputer science

Mathematics Subject Classification ID

2-person games (91A05) (n)-person games, (n>2) (91A06)

Related Items

Graph Transduction as a Noncooperative Game ⋮ Finding all Nash equilibria of a finite game using polynomial algebra ⋮ Computing equilibria: a computational complexity perspective ⋮ AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents ⋮ Successful Nash equilibrium agent for a three-player imperfect-information game ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ Computing equilibria for integer programming games ⋮ A global optimization algorithm for solving a four-person game ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ Action-graph games ⋮ Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies ⋮ Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Behavioural strategies in weighted Boolean games ⋮ New complexity results about Nash equilibria ⋮ On Stackelberg mixed strategies ⋮ Computational analysis of perfect-information position auctions ⋮ Incentive-based search for equilibria in Boolean games ⋮ Robust game theory ⋮ Imitation games and computation ⋮ Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games ⋮ Perspectives on multiagent learning ⋮ Solving possibilistic games with incomplete information ⋮ Two-player simultaneous location game: preferential rights and overbidding

Uses Software

• CPLEX
• MINOS
• Gambit
• GAMUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On total functions, existence theorems and computational complexity
• New complexity results about Nash equilibria
• Nash and correlated equilibria: Some complexity considerations
• The maximal number of regular totally mixed Nash equilibria
• A global Newton method to compute Nash equilibria.
• Multi-agent influence diagrams for representing and solving games.
• On the number of pure strategy Nash equilibria in random games
• Asymptotic expected number of Nash equilibria of two-player normal form games
• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• On the Strategic Stability of Equilibria
• Algorithms, games, and the internet
• Equilibrium Points of Bimatrix Games
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• Equilibrium points in n -person games
• Programming of Interdependent Activities: I General Discussion