Pure Nash Equilibria in Resource Graph Games

DOI10.1613/jair.1.12668OpenAlexW3203432379MaRDI QIDQ5026179

Jannik Matuschke, Tobias Harks, Max Klimm

Publication date: 7 February 2022

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.09017

zbMATH Keywords

game theorymultiagent systems

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational analysis of perfect-information position auctions
• Action-graph games
• Characterizing the existence of potential functions in weighted congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• The polynomial-time hierarchy
• Potential games
• Congestion games with player-specific payoff functions
• Fictitious play property for games with identical interests
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• On the impact of combinatorial structure on congestion games
• Algorithms for pure Nash equilibria in weighted congestion games
• On Sparse Discretization for Graphical Games
• The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
• Equilibrium points in n -person games
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Atomic resource sharing in noncooperative networks

This page was built for publication: Pure Nash Equilibria in Resource Graph Games