scientific article; zbMATH DE number 7274195

zbMath1452.91061arXiv1801.00734MaRDI QIDQ5133220

Tim Roughgarden

Publication date: 12 November 2020

Full work available at URL: https://arxiv.org/abs/1801.00734

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexity theoryWalrasian equilibriatwo-player zero-sum gamescomputing approximate Nash equilibrium, price algorithms

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Microeconomic theory (price theory and economic markets) (91B24) Algorithmic game theory and complexity (91A68) Equilibrium refinements (91A11)

Related Items (3)

Adventures in monotone complexity and TFNP ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

This page was built for publication: