scientific article
From MaRDI portal
Publication:2921656
zbMath1297.91005MaRDI QIDQ2921656
Tim Roughgarden, Christos H. Papadimitriou
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria ⋮ Selecting efficient correlated equilibria through distributed learning ⋮ Directed graphical structure, Nash equilibrium, and potential games ⋮ Buyer-supplier games: optimization over the core ⋮ Equilibria of graphical games with symmetries ⋮ Nash equilibria: complexity, symmetries, and approximation ⋮ Equilibria problems on games: complexity versus succinctness ⋮ Computing the cores of strategic games with punishment-dominance relations ⋮ Good neighbors are hard to find: Computational complexity of network formation ⋮ Walrasian equilibrium: Hardness, approximations and tractable instances ⋮ Pairwise-Interaction Games ⋮ Approximate Nash equilibria in anonymous games ⋮ Algorithmic rationality: game theory with costly computation ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Symmetries and the complexity of pure Nash equilibrium ⋮ On the Hardness and Existence of Quasi-Strict Equilibria ⋮ Perspectives on multiagent learning ⋮ Nash equilibria in all-optical networks
This page was built for publication:
