12 papers
Global Optimization for Parametrized Quantum Circuits
Iosif Sakos, Antonios Varvitsiotis, Georgios Korpas +1
In the absence of error correction, noisy intermediate-scale quantum devices are operated by training parametrized quantum circuits (PQCs) so as to minimize a suitable loss functio…
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).…
Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
Anas Barakat, Ioannis Panageas, Antonios Varvitsiotis
Convex Markov Games (cMGs) were recently introduced as a broad class of multi-agent learning problems that generalize Markov games to settings where strategic agents optimize gener…
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…
Certifying Concavity and Monotonicity in Games via Sum-of-Squares Hierarchies
Vincent Leon, Iosif Sakos, Ryann Sim +1
Concavity and its refinements underpin tractability in multiplayer games, where players independently choose actions to maximize their own payoffs which depend on other players' ac…