A generalization of von Neumann's reduction from the assignment problem to zero-sum games

DOI10.1016/J.GEB.2026.01.009MaRDI QIDQ6839154zbMATH OpenFDO

Authors Ilan Adler, Martin Bullinger, Vijay V. Vazirani

Publication date 24 March 2026

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.GEB.2026.01.009

zbMATH Keywords

algorithmic game theorylinear programmingzero-sum games

Mathematics Subject Classification ID

Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites work

• A generalization of von Neumann's assignment problem and K. Fan's optimization result
• Algorithmic Game Theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Computational Complexity
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3856810 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 826270 (Why is no real title available?)
• scientific article; zbMATH DE number 3062453 (Why is no real title available?)
• scientific article; zbMATH DE number 3069631 (Why is no real title available?)
• scientific article; zbMATH DE number 3078983 (Why is no real title available?)
• Linear programming is log-space hard for P
• The equivalence of linear programs and zero-sum games
• The matching problem with linear transfers is equivalent to a hide-and-seek game
• Theory of games and economic behavior.
• Zero-sum games and linear programming duality
• Zur Theorie der Gesellschaftsspiele.

This page was built for publication: A generalization of von Neumann's reduction from the assignment problem to zero-sum games

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