On the structure of weakly acyclic games
From MaRDI portal
Publication:372989
DOI10.1007/s00224-013-9457-0zbMath1290.91016arXiv1108.2092MaRDI QIDQ372989
Michael Schapira, Aaron D. Jaggard, Alex Fabrikant
Publication date: 21 October 2013
Published in: Theory of Computing Systems, Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2092
Related Items
Pure Nash Equilibria and Best-Response Dynamics in Random Games, Coordination Games on Weighted Directed Graphs, Best-response dynamics, playing sequences, and convergence to equilibrium in random games, Iterative voting and acyclic games, Weakly-acyclic (internet) routing games, On convergence rates of game theoretic reinforcement learning algorithms, Unilaterally competitive games with more than two players, A classification of weakly acyclic games, When ``better is better than ``best, Strong and Weak Acyclicity in Iterative Voting, Setting Cournot Versus Lyapunov Games Stability Conditions and Equilibrium Point Properties
Cites Work
- Unnamed Item
- Unnamed Item
- Potential games
- Congestion games with player-specific payoff functions
- Improvement dynamics in games with strategic complementarities
- A class of games possessing pure-strategy Nash equilibria
- Weakly-Acyclic (Internet) Routing Games
- Dominance Solvable Voting Schemes
- Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
- The Evolution of Conventions
- Learning in games by random sampling