Treewidth and pure Nash equilibria

DOI10.1007/978-3-319-03898-8_29zbMATH Open1309.68103OpenAlexW207259545MaRDI QIDQ2867095FDOQ2867095

Authors: Antonis Thomas, J. Van Leeuwen 

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_29

Recommendations

• Pure Nash equilibria in graphical games and treewidth
• scientific article; zbMATH DE number 2243403
• Pairwise-interaction games
• Equilibria of graphical games with symmetries
• On the complexity of Nash equilibria of action-graph games

Mathematics Subject Classification ID

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

Cited In (2)

• Axiomatization of an allocation rule for ordered tree TU-games
• Pure Nash equilibria in graphical games and treewidth

This page was built for publication: Treewidth and pure Nash equilibria

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