Semidefinite network games: multiplayer minimax and complementarity problems
From MaRDI portal
Cites work
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- An exact duality theory for semidefinite programming and its complexity implications
- Distributed Stochastic Optimization via Matrix Exponential Learning
- Equilibria of Polymatrix Games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- scientific article; zbMATH DE number 4049433 (Why is no real title available?)
- scientific article; zbMATH DE number 3326981 (Why is no real title available?)
- scientific article; zbMATH DE number 3062461 (Why is no real title available?)
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- MIMO Cognitive Radio: A Game Theoretical Approach
- Note on noncooperative convex games
- On a Network Generalization of the Minmax Theorem
- On minmax theorems for multiplayer games
- On semidefinite linear complementarity problems
- On separable non-cooperative zero-sum games
- Quantum strategic game theory
- Real and complex monotone communication games
- Semidefinite games
- Spectrahedral shadows
- The theory of quantum information
- Towards a general theory of quantum games
- Zero-sum polymatrix games: a generalization of minmax
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)