Semidefinite programming for min-max problems and games
From MaRDI portal
Publication:662286
DOI10.1007/s10107-010-0353-yzbMath1242.90158OpenAlexW2069764498MaRDI QIDQ662286
R. Laraki, Jean-Bernard Lasserre
Publication date: 22 February 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0353-y
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Minimax problems in mathematical programming (90C47) 2-person games (91A05) (n)-person games, (n>2) (91A06) Stochastic games, stochastic differential games (91A15)
Related Items
kNN Classification with an Outlier Informative Distance Measure, The saddle point problem of polynomials, Multiple oracle algorithm to solve continuous games, Hausdorff distance between convex semialgebraic sets, Sums of even powers of \(k\)-regulous functions, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, Introduction to Semidefinite, Conic and Polynomial Optimization, Semidefinite Programming and Nash Equilibria in Bimatrix Games, Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit formulas for repeated games with absorbing states
- Correlated equilibria in continuous games: characterization and computation
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Moments and sums of squares for polynomial optimization and related problems
- Homotopy methods to compute equilibria in game theory
- Finding all Nash equilibria of a finite game using polynomial algebra
- Computing equilibria: a computational complexity perspective
- On the complexity of Schmüdgen's Positivstellensatz
- Approximations of Nash equilibria
- The myth of the folk theorem
- A semidefinite programming approach to the generalized problem of moments
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Repeated games with absorbing states
- On the complexity of the parity argument and other inefficient proofs of existence
- A global Newton method to compute Nash equilibria.
- Global optimization of rational functions: a semidefinite programming approach
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- Global Optimization with Polynomials and the Problem of Moments
- A procedure for finding Nash equilibria in bi-matrix games
- GloptiPoly 3: moments, optimization and semidefinite programming
- Settling the complexity of computing two-player Nash equilibria
- Algorithm 795
- The Complexity of Computing a Nash Equilibrium
- Optimization of Polynomials on Compact Semialgebraic Sets
- Equilibrium Points of Bimatrix Games
- Algorithmic Game Theory
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Hard-to-Solve Bimatrix Games
- Computing Equilibria of N-Person Games
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Equilibrium points in n -person games
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- Stochastic Games
- On A Theorem of von Neumann
- LATIN 2004: Theoretical Informatics
