Pairwise-Interaction Games
From MaRDI portal
Publication:3012801
DOI10.1007/978-3-642-22006-7_14zbMath1332.68071DBLPconf/icalp/DyerM11OpenAlexW136875871WikidataQ56323826 ScholiaQ56323826MaRDI QIDQ3012801
Velumailum Mohanaraj, Martin Dyer
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_14
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Multistage games with pairwise interactions on complete graph ⋮ Decentralized dynamics for finite opinion games ⋮ Unnamed Item ⋮ Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph
Cites Work
- Unnamed Item
- The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
- New complexity results about Nash equilibria
- Symmetries and the complexity of pure Nash equilibrium
- Nash and correlated equilibria: Some complexity considerations
- Potential games
- Local interaction on random graphs
- Non-cooperative games
- A contribution to von Neumann's theory of games
- Defective coloring revisited
- Simple Local Search Problems that are Hard to Solve
- The complexity of pure Nash equilibria
- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
- NP completeness of finding the chromatic index of regular graphs
- Neural networks and physical systems with emergent collective computational abilities.
- Mathematical Foundations of Computer Science 2005
This page was built for publication: Pairwise-Interaction Games
