On a Network Generalization of the Minmax Theorem

DOI10.1007/978-3-642-02930-1_35zbMath1248.91006OpenAlexW1613257378MaRDI QIDQ5321674

Constantinos Daskalakis, Christos H. Papadimitriou

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_35

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (8)

Approximating Nash Equilibria in Tree Polymatrix Games ⋮ Fast convergence of optimistic gradient ascent in network zero-sum extensive form games ⋮ Contribution games in networks ⋮ Fictitious play in networks ⋮ The fashion game: network extension of matching pennies ⋮ Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution ⋮ A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks ⋮ Symmetric zero-sum games with only asymmetric equilibria

This page was built for publication: On a Network Generalization of the Minmax Theorem