5 papers · 1 filter
Optimistic Online Learning in Symmetric Cone Games
Anas Barakat, Wayne Lin, John Lazarsfeld +1
We introduce symmetric cone games (SCGs), a broad class of multi-player games where each player's strategy lies in a generalized simplex (the trace-one slice of a symmetric cone).…
The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
Jiaxin Hou, Yong Sheng Soh, Antonios Varvitsiotis
The problems of computing graph colorings and clique covers are central challenges in combinatorial optimization. Both of these are known to be NP-hard, and thus computationally in…
Semidefinite network games: multiplayer minimax and complementarity problems
Constantin Ickstadt, Thorsten Theobald, Elias Tsigaridas +1
Network games provide a powerful framework for modeling agent interactions in networked systems, where players are represented by nodes in a graph and their payoffs depend on the a…
Nash equilibria in semidefinite games and Lemke-Howson paths
Constantin Ickstadt, Thorsten Theobald, Elias Tsigaridas +1
We consider an algorithmic framework for two-player non-zero-sum semidefinite games, where each player's strategy is a positive semidefinite matrix with trace one. We formulate the…
A Primal-Dual Framework for Symmetric Cone Programming
Jiaqi Zheng, Antonios Varvitsiotis, Tiow-Seng Tan +1
In this paper, we introduce a primal-dual algorithmic framework for solving Symmetric Cone Programs (SCPs), a versatile optimization model that unifies and extends Linear, Second-O…