Separable and low-rank continuous games

DOI10.1007/s00182-008-0129-2zbMath1160.91003arXiv0707.3462OpenAlexW2763344040MaRDI QIDQ999116

Asuman Ozdaglar, Pablo A. Parrilo, Noah D. Stein

Publication date: 30 January 2009

Published in: International Journal of Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

computationcontinuous gamessmall-support equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10)

Related Items

kNN Classification with an Outlier Informative Distance Measure, Note on unique Nash equilibrium in continuous games, Computing equilibria for integer programming games, Detection thresholds in very sparse matrix completion, Multiple oracle algorithm to solve continuous games, Correlated equilibria in continuous games: characterization and computation, Structure of extreme correlated equilibria: A zero-sum example and its implications, Optimal strategic reasoning with McNaughton functions, Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for indefinite quadratic programming
• Games of fixed rank: a hierarchy of bimatrix games
• On the complexity of the parity argument and other inefficient proofs of existence
• Potential games
• The complexity of computing a Nash equilibrium
• Equilibrium Points of Bimatrix Games
• The Approximation of Fixed Points of a Continuous Mapping
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• Geometry of moment spaces