The NP-completeness column
From MaRDI portal
Publication:4962727
DOI10.1145/1240233.1240247zbMath1445.68103MaRDI QIDQ4962727
No author found.
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1240233.1240247
91A10: Noncooperative games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Equilibria, fixed points, and complexity classes, Computing equilibria: a computational complexity perspective, Uniqueness of stationary equilibrium payoffs in coalitional bargaining, Integer Programming: Optimization and Evaluation Are Equivalent, A CSP-Based Approach for Solving Parity Game