Topological games at Princeton, a mathematical memoir

David Gale

Games and Economic Behavior, 2009, vol. 66, issue 2, pages 647-656

Abstract: The games of the title are "Nash" (or Hex), "Milnor" (or Y), "Shapley" (or Projective Plane) and "Gale" (or Bridg-It) all of which were discovered (or re-discovered) in Princeton in 1948-1949. After giving the basic topological connections, I will discuss more recent ramifications related to computational complexity theory. A recurrent theme will be non-constructive proofs, or how we can know something can be done without having the slightest idea of how to do it.

Date: 2009

Downloads: (external link)
http://www.sciencedirect.com/science/article/B6WFW ... 49b81f6628d4d747ad8f
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:eee:gamebe:v:66:y:2009:i:2:p:647-656

Access Statistics for this article

Games and Economic Behavior is edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Series data maintained by Heidi Boesdal ().