Semidefinite games

DOI10.1007/S00182-024-00902-6MaRDI QIDQ6665440zbMATH OpenFDO

Authors Constantin Ickstadt, Thorsten Theobald, Elias P. Tsigaridas

Publication date 17 January 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00182-024-00902-6

zbMATH Keywords

semidefinite programmingbimatrix gamesNash equilibriumnumber of Nash equilibriaDantzig gamesemidefinite games

Mathematics Subject Classification ID

Game theory (91Axx)

Recommendations

• Semidefinite Programming and Nash Equilibria in Bimatrix Games
• Semidefinite programming for min-max problems and games
• Zero-sum polymatrix games: a generalization of minmax

Cites work

• scientific article; zbMATH DE number 4118196 (Why is no real title available?)
• scientific article; zbMATH DE number 3062460 (Why is no real title available?)
• scientific article; zbMATH DE number 3069611 (Why is no real title available?)
• scientific article; zbMATH DE number 3078985 (Why is no real title available?)
• scientific article; zbMATH DE number 7689788 (Why is no real title available?)
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• A Social Equilibrium Existence Theorem*
• A general structure theorem for the Nash equilibrium correspondence
• A theorem on the number of Nash equilibria in a bimatrix game
• An introductiory course on mathematical game theory.
• Completely positive semidefinite rank
• Convex generalized Nash equilibrium problems and polynomial optimization
• Correlated equilibria in continuous games: characterization and computation
• Dualities in convex algebraic geometry
• Equilibrium Points of Bimatrix Games
• Exact algorithms for solving stochastic games
• Fast Algorithms for Rank-1 Bimatrix Games
• Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
• Game theory, alive
• Linear conic formulations for two-party correlations and values of nonlocal games
• Nash equilibria in quantum games
• New algorithms for solving zero-sum stochastic games
• New maximal numbers of equilibria in bimatrix games
• Polytope-form games and index/degree theories for extensive-form games
• Quantum bilinear optimization
• Quantum games: a review of the history, current state, and interpretation
• Quantum strategies
• Semidefinite Optimization and Convex Algebraic Geometry
• Semidefinite Programming
• Semidefinite Programming and Nash Equilibria in Bimatrix Games
• Semidefinite programming for min-max problems and games
• Separable and low-rank continuous games
• Spectrahedral shadows
• Stochastic Games
• The equivalence of linear programs and zero-sum games
• Towards a general theory of quantum games
• Tropical Complementarity Problems and Nash Equilibria
• Universality of Nash Equilibria
• Zero-sum polymatrix games: a generalization of minmax

Cited in

(1)

• Semidefinite network games: multiplayer minimax and complementarity problems

This page was built for publication: Semidefinite games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665440)