190 likes | 433 Views
. The Complexity of Computing a Nash EquilibriumConstantinos DaskalakisPaul W. GoldbergChristos H. PapadimitriouNon-Cooperative Games (11/1951)John Nash. . Any continuous map from a compact (closed and bounded) and convex (without holes) subset of the Euclidean space into itself always has a f
E N D