A decomposition algorithm for N-player games

DOI10.1007/S00199-009-0434-4MaRDI QIDQ847797zbMATH OpenOpenAlexFDO

Authors Srihari Govindan, Robert Wilson

Publication date 19 February 2010

Published in Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00199-009-0434-4

zbMATH Keywords

decompositiongame theorytriangulationequilibriumcomputation

Mathematics Subject Classification ID

Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) (n)-person games, (n>2) (91A06)

Recommendations

• Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
• Decomposable penalty method for generalized game problems with joint constraints
• Decomposition algorithms for generalized potential games
• scientific article; zbMATH DE number 665580
• Computing Nash equilibria by iterated polymatrix approximation

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3332061 (Why is no real title available?)
• A continuation method for Nash equilibria in structured games
• A global Newton method to compute Nash equilibria.
• Computing Nash equilibria by iterated polymatrix approximation
• Equilibrium Points of Bimatrix Games
• Hard-to-Solve Bimatrix Games
• On the Linear Independence of Multivariate B-Splines, I. Triangulations of Simploids
• Some Combinatorial Lemmas in Topology
• Structure theorems for game trees
• The Linear Complementarity Problem

Cited in

(13)

• On Decomposed Subspaces of Finite Games
• A direct reduction from \(k\)-player to 2-player approximate Nash equilibrium
• Decomposition of games with non-empty core into veto-controlled simple games
• Global Newton method for stochastic games
• Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
• A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
• Computing approximate Nash equilibria in polymatrix games
• Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
• scientific article; zbMATH DE number 665580 (Why is no real title available?)
• A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
• Existence of perfect equilibria: a direct proof
• A survey on decomposition of finite strategic-form games
• A computational method for solving \(n\)-person game

This page was built for publication: A decomposition algorithm for \(N\)-player games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847797)