Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses

DOI10.1007/978-3-642-15369-3_24zbMath1306.91003OpenAlexW1511111380MaRDI QIDQ3588417

Paul G. Spirakis, Spyros C. Kontogiannis

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_24

zbMATH Keywords

Nash equilibriumquadratic optimizationcorrelated equilibriumbimatrix games

Mathematics Subject Classification ID

Quadratic programming (90C20) 2-person games (91A05) Approximation algorithms (68W25)

Related Items (2)

From Duels to Battlefields: Computing Equilibria of Blotto and Other Games ⋮ Parameterized two-player Nash equilibrium

This page was built for publication: Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses