Zero-sum games and linear programming duality

DOI10.1287/MOOR.2022.0149MaRDI QIDQ6563027zbMATH OpenFDO

Authors Bernhard von Stengel

Publication date 27 June 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/MOOR.2022.0149

zbMATH Keywords

lemma of Farkaslinear programming dualityminimax theoremzero-sum game

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47) Noncooperative games (91A10)

Recommendations

• A canonical game -- 75 years in the making -- showing the equivalence of matrix games and linear programming
• The equivalence of linear programs and zero-sum games
• On linear programming duality and necessary and sufficient conditions in minimax theory
• scientific article; zbMATH DE number 36672
• Nonlinear programming duality and matrix game equivalence

Cited in

(4)

• A canonical game -- 75 years in the making -- showing the equivalence of matrix games and linear programming
• Two-person adversarial games are zero-sum: an elaboration of a folk theorem
• A generalization of von Neumann's reduction from the assignment problem to zero-sum games
• The matching problem with linear transfers is equivalent to a hide-and-seek game

This page was built for publication: Zero-sum games and linear programming duality

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