70 citations · 271 across the 35 of their papers we have counts for
3 papers · 2 filters
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…
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…
Multiplicative Updates for Online Convex Optimization over Symmetric Cones
Ilayda Canyakmaz, Wayne Lin, Georgios Piliouras +1
We study online convex optimization where the possible actions are trace-one elements in a symmetric cone, generalizing the extensively-studied experts setup and its quantum counte…