Recommendations
Cited in
(25)- Coordination games on graphs
- Fictitious play in networks
- Symmetric zero-sum games with only asymmetric equilibria
- Zero-sum polymatrix games: a generalization of minmax
- Efficient equilibria in polymatrix coordination games
- Approximating Nash equilibria in tree polymatrix games
- scientific article; zbMATH DE number 2159092 (Why is no real title available?)
- Price of anarchy for graph coloring games with concave payoff
- The polymatrix gap conjecture
- Coordination games on weighted directed graphs
- Computing approximate Nash equilibria in polymatrix games
- On a Network Generalization of the Minmax Theorem
- PPAD-complete approximate pure Nash equilibria in Lipschitz games
- Synchronization in security games
- PPAD-complete pure approximate Nash equilibria in Lipschitz games
- Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
- Separable Network Games with Compact Strategy Sets
- A logical description of priority separable games
- Tree polymatrix games are PPAD-hard
- Semidefinite network games: multiplayer minimax and complementarity problems
- On the limitations and possibilities of Nash regret minimization in zero-sum matrix games under noisy feedback
- Game dynamics and equilibrium computation in the population protocol model
- One-sided markets with externalities
- Interdependent defense games with applications to internet security at the level of autonomous systems
- Minimal large sets for cooperative games
This page was built for publication: On minmax theorems for multiplayer games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365039)
