Separable Network Games with Compact Strategy Sets

DOI10.1007/978-3-030-90370-1_3MaRDI QIDQ6488586zbMATH OpenFDO

Authors Tomáš Kroupa, Sara Vannucci, Tomáš Votroubek

Publication date 28 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90370-1_3

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Separable and low-rank continuous games
• Nash equilibria in mixed stationary strategies for \(m\)-player mean payoff games on networks
• On a Network Generalization of the Minmax Theorem
• Multilinear games
• The path player game

Cites work

• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• An introduction to polynomial and semi-algebraic optimization
• Fictitious play in networks
• scientific article; zbMATH DE number 527343 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• Inapproximability of Nash equilibrium
• JuMP: a modeling language for mathematical optimization
• On a Network Generalization of the Minmax Theorem
• On minmax theorems for multiplayer games
• On separable non-cooperative zero-sum games
• Semidefinite programming for min-max problems and games
• Separable and low-rank continuous games
• The lottery Blotto game
• Zero-sum polymatrix games: a generalization of minmax

Cited in

(2)

• Synchronization in security games
• Multiple oracle algorithm to solve continuous games

This page was built for publication: Separable Network Games with Compact Strategy Sets

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