Semidefinite Programming and Nash Equilibria in Bimatrix Games
From MaRDI portal
Publication:4995090
DOI10.1287/ijoc.2020.0960OpenAlexW3088437586MaRDI QIDQ4995090
Jeffrey Zhang, Amir Ali Ahmadi
Publication date: 23 June 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08550
Related Items (2)
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Convex generalized Nash equilibrium problems and polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate well-supported Nash equilibria below two-thirds
- Computing symmetric nonnegative rank factorizations
- Semidefinite programming for min-max problems and games
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Enumeration of Nash equilibria for two-player games
- New complexity results about Nash equilibria
- Nash and correlated equilibria: Some complexity considerations
- Subjectivity and correlation in randomized strategies
- Semidefinite programming relaxations for semialgebraic problems
- The equivalence of linear programs and zero-sum games
- Convex sets with semidefinite representation
- Non-cooperative games
- Global Optimization with Polynomials and the Problem of Moments
- On the Complexity of Approximating a Nash Equilibrium
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Note on Strictly Competitive Games
- A symmetrization for finite two-person games
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the Shannon capacity of a graph
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite Programming
- The Complexity of Computing a Nash Equilibrium
- Equilibrium Points of Bimatrix Games
- Hard-to-Solve Bimatrix Games
This page was built for publication: Semidefinite Programming and Nash Equilibria in Bimatrix Games
