Open AccessThis article is
- freely available
Computer Solution to the Game of Pure Strategy
University of Maryland, University College, 3501 University Blvd. East, Adelphi, MD, USA
Mathematical Institute, Georg-August University, Bunsenstraße 3-5, D-37073 Göttingen, Germany
* Authors to whom correspondence should be addressed.
Received: 25 August 2012 / Revised: 11 October 2012 / Accepted: 1 November 2012 / Published: 8 November 2012
Abstract We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.
This is an open access article distributed under the
Creative Commons Attribution License which permits unrestricted use, distribution,
and reproduction in any medium, provided the original work is properly cited.
Share & Cite This Article
MDPI and ACS Style
Rhoads, G.C.; Bartholdi, L. Computer Solution to the Game of Pure Strategy. Games 2012, 3, 150-156.
View more citation formats
Rhoads GC, Bartholdi L. Computer Solution to the Game of Pure Strategy. Games. 2012; 3(4):150-156.
Rhoads, Glenn C.; Bartholdi, Laurent. 2012. "Computer Solution to the Game of Pure Strategy." Games 3, no. 4: 150-156.
Notes: Multiple requests from the same IP address are counted as one view.
For more information on the journal, click here
[Return to top]