Publication:372989

DOI10.1007/s00224-013-9457-0zbMath1290.91016arXiv1108.2092OpenAlexW2568233966MaRDI 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

zbMATH Keywords

subgame stabilityweak acyclicity

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Evolutionary games (91A22)

Related Items (11)

Setting Cournot Versus Lyapunov Games Stability Conditions and Equilibrium Point Properties ⋮ Coordination Games on Weighted Directed Graphs ⋮ When ``better is better than ``best ⋮ Iterative voting and acyclic games ⋮ Weakly-acyclic (internet) routing games ⋮ Best-response dynamics, playing sequences, and convergence to equilibrium in random games ⋮ On convergence rates of game theoretic reinforcement learning algorithms ⋮ Unilaterally competitive games with more than two players ⋮ Strong and Weak Acyclicity in Iterative Voting ⋮ Pure Nash Equilibria and Best-Response Dynamics in Random Games ⋮ A classification of weakly acyclic games

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

This page was built for publication: On the structure of weakly acyclic games