Action-graph games

DOI10.1016/J.GEB.2010.10.012MaRDI QIDQ625044zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

graphical modelsNash equilibriacomputational techniqueslarge gamesgame representations

Mathematics Subject Classification ID

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)

Recommendations

• On the complexity of Nash equilibria of action-graph games
• A generative relation for Nash equilibria on symmetric action graph games
• Graphical games
• Multi-agent influence diagrams for representing and solving games.
• Computing Equilibria in Large Games We Play

Cites work

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

Cited in

(22)

• Multilinear games
• Reasoning in games
• A Graph-Grabbing Game
• 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
• Pure Nash equilibria in graphical games and treewidth
• On the complexity of Nash equilibria of action-graph games
• Ordinal Graph-Based Games
• Logics in Artificial Intelligence
• Computational analysis of perfect-information position auctions

Describes a project that uses

Uses Software

• GAMUT
• Gambit

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)