Action-graph games
DOI10.1016/J.GEB.2010.10.012zbMATH Open1205.91040OpenAlexW1987961481WikidataQ60521650 ScholiaQ60521650MaRDI QIDQ625044FDOQ625044
Authors: 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
Recommendations
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Games involving graphs (91A43)
Cites Work
- Non-cooperative games
- Title not available (Why is that?)
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- Potential games
- Multiagent Systems
- Title not available (Why is that?)
- Action-graph games
- New complexity results about Nash equilibria
- Multi-agent influence diagrams for representing and solving games.
- Congestion games with player-specific payoff functions
- The Approximation of Fixed Points of a Continuous Mapping
- A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence
- Title not available (Why is that?)
- Computing correlated equilibria in multi-player games
- Graphical games
- Large Robust Games
- The complexity of computing a Nash equilibrium
- A continuation method for Nash equilibria in structured games
- A Gray code for compositions
- Equilibrium Points of Bimatrix Games
- Simple search methods for finding a Nash equilibrium
- Computing Nash equilibria by iterated polymatrix approximation
- Reducibility among equilibrium problems
- A global Newton method to compute Nash equilibria.
- Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
- Computational analysis of perfect-information position auctions
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
- On the complexity of Nash equilibria of action-graph games
- Computing correlated equilibria in multi-player games
Cited In (22)
- A generative relation for Nash equilibria on symmetric action graph games
- Pure Nash Equilibria in Resource Graph Games
- Recursively modeling other agents for decision making: a research perspective
- Descriptions of game actions
- A probabilistic model for the interaction of an agent with a network environment
- Action-graph games
- Exploiting extensive-form structure in empirical game-theoretic analysis
- Game Theory Explorer: software for the applied game theorist
- Robust equilibria in location games
- Graph transduction as a noncooperative game
- Polynomial-time computation of exact correlated equilibrium in compact games
- Predicting human behavior in unrepeated, simultaneous-move games
- Graphical games
- Decentralized MDPs with sparse interactions
- On the complexity of Nash equilibria of action-graph games
- Pure Nash equilibria in graphical games and treewidth
- Ordinal Graph-Based Games
- Logics in Artificial Intelligence
- A Graph-Grabbing Game
- Multilinear games
- Reasoning in games
- Computational analysis of perfect-information position auctions
Uses Software
This page was built for publication: Action-graph games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625044)
