On a Network Generalization of the Minmax Theorem
From MaRDI portal
Recommendations
Cited in
(18)- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
- Fictitious play in networks
- Symmetric zero-sum games with only asymmetric equilibria
- Contribution games in networks
- The fashion game: network extension of matching pennies
- Zero-sum polymatrix games: a generalization of minmax
- A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks
- scientific article; zbMATH DE number 3852815 (Why is no real title available?)
- Approximating Nash equilibria in tree polymatrix games
- scientific article; zbMATH DE number 4145830 (Why is no real title available?)
- scientific article; zbMATH DE number 5654190 (Why is no real title available?)
- On minmax theorems for multiplayer games
- The generalized \(p\)-centdian on network
- Fast convergence of optimistic gradient ascent in network zero-sum extensive form games
- Separable Network Games with Compact Strategy Sets
- Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium
- Semidefinite network games: multiplayer minimax and complementarity problems
This page was built for publication: On a Network Generalization of the Minmax Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321674)