Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph

DOI10.1142/S0219198920500206zbMath1479.91060arXiv2101.09103MaRDI QIDQ5013401

Victoria Sánchez Muñoz, Michael Mc Gettrick

Publication date: 30 November 2021

Published in: International Game Theory Review (Search for Journal in Brave)

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

zbMATH Keywords

Nash equilibriumladder graphcircular laddergraphical game

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Games on graphs (graph-theoretic aspects) (05C57) Equilibrium refinements (91A11)

Cites Work

• Unnamed Item
• Opinion dynamics and wisdom under out-group discrimination
• Graph sharing games: complexity and connectivity
• Graphs of polyhedra; polyhedra as graphs
• A three-person deterministic graphical game without Nash equilibria
• Pricing and referrals in diffusion on networks
• Games on graphs
• Asymptotic expected number of Nash equilibria of two-player normal form games
• Pairwise-Interaction Games
• Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
• The Complexity of Computing a Nash Equilibrium
• Algorithmic Game Theory
• Equilibrium points in n -person games

This page was built for publication: Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph