Semidefinite network games: multiplayer minimax and complementarity problems

DOI10.1007/S10957-025-02922-YMaRDI QIDQ6850372zbMATH OpenFDO

Authors Constantin Ickstadt, Thorsten Theobald, Elias P. Tsigaridas, A. Varvitsiotis

Publication date 3 March 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

semidefinite programmingNash equilibriumzero-sum gamesemidefinite linear complementarity programsemidefinite network game

Mathematics Subject Classification ID

Semidefinite programming (90C22) 2-person games (91A05) Games involving graphs (91A43) Quantum games (91A81)

This page was built for publication: Semidefinite network games: multiplayer minimax and complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6850372)