Action-graph games
From MaRDI portal
Publication:625044
DOI10.1016/j.geb.2010.10.012zbMath1205.91040OpenAlexW1987961481WikidataQ60521650 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
Abstract computational complexity for mathematical programming problems (90C60) Games involving graphs (91A43) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (14)
A probabilistic model for the interaction of an agent with a network environment ⋮ Graph Transduction as a Noncooperative Game ⋮ Robust equilibria in location games ⋮ Predicting human behavior in unrepeated, simultaneous-move games ⋮ Action-graph games ⋮ Multilinear Games ⋮ Decentralized MDPs with sparse interactions ⋮ Computational analysis of perfect-information position auctions ⋮ A Generative Relation for Nash Equilibria on Symmetric Action Graph 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 ⋮ Pure Nash Equilibria in Resource Graph Games ⋮ Game Theory Explorer: software for the applied game theorist
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Action-graph games
