A decomposition algorithm for \(N\)-player games

DOI10.1007/s00199-009-0434-4zbMath1202.91010OpenAlexW1987011264MaRDI QIDQ847797

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

triangulationgame theorydecompositionequilibriumcomputation

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)

Related Items (7)

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games ⋮ Existence of perfect equilibria: a direct proof ⋮ Computing approximate Nash equilibria in polymatrix games ⋮ Global Newton method for stochastic games ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing Nash equilibria by iterated polymatrix approximation
• A global Newton method to compute Nash equilibria.
• Some Combinatorial Lemmas in Topology
• On the Linear Independence of Multivariate B-Splines, I. Triangulations of Simploids
• Structure theorems for game trees
• Equilibrium Points of Bimatrix Games
• Hard-to-Solve Bimatrix Games
• The Linear Complementarity Problem

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