A decomposition algorithm for N-player games
From MaRDI portal
Publication:847797
DOI10.1007/S00199-009-0434-4zbMATH Open1202.91010OpenAlexW1987011264MaRDI QIDQ847797FDOQ847797
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
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
Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) (n)-person games, (n>2) (91A06)
Cites Work
- Title not available (Why is that?)
- Equilibrium Points of Bimatrix Games
- The Linear Complementarity Problem
- Some Combinatorial Lemmas in Topology
- Structure theorems for game trees
- Title not available (Why is that?)
- A continuation method for Nash equilibria in structured games
- Hard-to-Solve Bimatrix Games
- Computing Nash equilibria by iterated polymatrix approximation
- A global Newton method to compute Nash equilibria.
- On the Linear Independence of Multivariate B-Splines, I. Triangulations of Simploids
Cited In (13)
- A direct reduction from \(k\)-player to 2-player approximate Nash equilibrium
- A computational method for solving \(n\)-person game
- Decomposition of games with non-empty core into veto-controlled simple games
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- Computing approximate Nash equilibria in polymatrix games
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Global Newton method for stochastic games
- On Decomposed Subspaces of Finite Games
- Existence of perfect equilibria: a direct proof
- A survey on decomposition of finite strategic-form games
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- Title not available (Why is that?)
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)
