Matrix Games, Linear Programming, and Linear Approximation

Simple item page
dc.creatorVaserstein, L. N.
dc.date2006-09-12
dc.date.accessioned2026-07-07T07:23:50Z
dc.date.available2026-07-07T07:23:50Z
dc.descriptionThe following four classes of computational problems are equivalent: solving matrix games, solving linear programs, best $l^{\infty}$ linear approximation, best $l^1$ linear approximation.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/cs/0609056
dc.identifierhttp://arxiv.org/abs/cs/0609056
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116132
dc.subjectComputer Science and Game Theory
dc.subjectArtificial Intelligence
dc.titleMatrix Games, Linear Programming, and Linear Approximation
dc.typetext

Files

Collections

arXiv