Action-graph games

DOI10.1016/j.geb.2010.10.012zbMath1205.91040WikidataQ60521650 ScholiaQ60521650MaRDI QIDQ625044

Albert Xin Jiang, Kevin Leyton-Brown, Navin A. R. Bhat

Publication date: 11 February 2011

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2010.10.012

zbMATH Keywords

Nash equilibria; graphical models; large games; computational techniques; game representations

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

91A43: Games involving graphs

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Pure Nash Equilibria in Resource Graph Games, A Generative Relation for Nash Equilibria on Symmetric Action Graph Games, A probabilistic model for the interaction of an agent with a network environment, Computational analysis of perfect-information position auctions, Action-graph games, Decentralized MDPs with sparse interactions, Predicting human behavior in unrepeated, simultaneous-move games, Recursively modeling other agents for decision making: a research perspective, Pure Nash equilibria in graphical games and treewidth, Polynomial-time computation of exact correlated equilibrium in compact games, Game Theory Explorer: software for the applied game theorist, Robust equilibria in location games, Graph Transduction as a Noncooperative Game, Multilinear Games

Uses Software

• Gambit
• GAMUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational analysis of perfect-information position auctions
• Action-graph games
• New complexity results about Nash equilibria
• Simple search methods for finding a Nash equilibrium
• Computing Nash equilibria by iterated polymatrix approximation
• A global Newton method to compute Nash equilibria.
• Multi-agent influence diagrams for representing and solving games.
• Potential games
• Congestion games with player-specific payoff functions
• A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence
• A class of games possessing pure-strategy Nash equilibria
• Non-cooperative games
• Reducibility among equilibrium problems
• The complexity of computing a Nash equilibrium
• How bad is selfish routing?
• Multiagent Systems
• The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• A Gray code for compositions
• Equilibrium Points of Bimatrix Games
• Large Robust Games
• The Approximation of Fixed Points of a Continuous Mapping
• Computing correlated equilibria in multi-player games
• Computing correlated equilibria in multi-player games