Next Article in Journal
Previous Article in Journal
Games 2012, 3(4), 150-156; doi:10.3390/g3040150
Article

Computer Solution to the Game of Pure Strategy

1,*  and 2,*
Received: 25 August 2012; in revised form: 11 October 2012 / Accepted: 1 November 2012 / Published: 8 November 2012
View Full-Text   |   Download PDF [164 KB, uploaded 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.
Keywords: goofspiel; game theory; linear programming; dynamic programming goofspiel; game theory; linear programming; dynamic programming
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.

Export to BibTeX |
EndNote


MDPI and ACS Style

Rhoads, G.C.; Bartholdi, L. Computer Solution to the Game of Pure Strategy. Games 2012, 3, 150-156.

AMA Style

Rhoads GC, Bartholdi L. Computer Solution to the Game of Pure Strategy. Games. 2012; 3(4):150-156.

Chicago/Turabian Style

Rhoads, Glenn C.; Bartholdi, Laurent. 2012. "Computer Solution to the Game of Pure Strategy." Games 3, no. 4: 150-156.

Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert