scientific article; zbMATH DE number 7051240
From MaRDI portal
Publication:4633883
zbMath1421.68070MaRDI QIDQ4633883
Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496848
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Approximation algorithms (68W25)
Related Items (5)
Public goods games in directed networks ⋮ Action-graph games ⋮ Symmetries and the complexity of pure Nash equilibrium ⋮ Pure Nash equilibria in graphical games and treewidth ⋮ Pure Nash Equilibria in Resource Graph Games
This page was built for publication:
