Matrix Games, Linear Programming, and Linear Approximation
L. N. Vaserstein
cs.GTarXiv:cs/0609056
Abstract
The following four classes of computational problems are equivalent: solving matrix games, solving linear programs, best l∞ linear approximation, best l1 linear approximation.
Create a lesson
Related papers
Algorithms for Robbins' Problem using Markov Decision Processes
Léonard Brice, F. Thomas Bruss, Anirban Majumdar et al.
Token-Level Advertising
Hanbing Liu, Bowei Zhang, Changyuan Yu et al.
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
Robust Lottery Compression for Metric Voting: A Transfer Principle for Bounded Randomness
Jianhao Jia, Bo Peng
A lone divider allocation algorithm with subjective divisibility
Uriel Feige
Trusting AI in Competitive Markets
Jussi Keppo, Yuze Li, Gerry Tsoukalas et al.