Pairwise-interaction games

DOI10.1007/978-3-642-22006-7_14MaRDI QIDQ3012801zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Martin Dyer, Velumailum Mohanaraj

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

zbMATH Keywords

computational complexitygraphical gameNash equilibriumpairwise interaction

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Equilibria of graphical games with symmetries
• scientific article; zbMATH DE number 2243403
• On the complexity of constrained Nash equilibria in graphical games
• On the complexity of Nash equilibria of action-graph games
• Algorithms – ESA 2005

Cites work

• A contribution to von Neumann's theory of games
• Computing equilibria in multi-player games
• Defective coloring revisited
• Local interaction on random graphs
• Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
• Mathematical Foundations of Computer Science 2005
• Nash and correlated equilibria: Some complexity considerations
• Neural networks and physical systems with emergent collective computational abilities
• New complexity results about Nash equilibria
• Non-cooperative games
• NP completeness of finding the chromatic index of regular graphs
• Potential games
• Simple Local Search Problems that are Hard to Solve
• Symmetries and the complexity of pure Nash equilibrium
• The complexity of pure Nash equilibria
• The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria

Cited in

(17)

• Tree-connected peer group situations and peer group games
• Dynamics in network interaction games
• Pure Nash equilibria in graphical games and treewidth
• Joint games and compatibility
• Treewidth and pure Nash equilibria
• Decentralized dynamics for finite opinion games
• scientific article; zbMATH DE number 67050 (Why is no real title available?)
• scientific article; zbMATH DE number 1342009 (Why is no real title available?)
• Equilibrium computation in discrete network games
• Nash equilibria in certain two-choice multi-player games played on the ladder graph
• Multistage games with pairwise interactions on full graph
• On a Network Generalization of the Minmax Theorem
• Complexity of public goods games on graphs
• A note on cooperative differential games with pairwise interactions
• The price identity of replicator(-mutator) dynamics on graphs with quantum strategies in a public goods game
• Multistage games with pairwise interactions on complete graph
• On the complexity of constrained Nash equilibria in graphical games

This page was built for publication: Pairwise-interaction games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3012801)