Computer Solution to the Game of Pure Strategy
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.
When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:3:y:2012:i:4:p:150-156:d:21290. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (XML Conversion Team)
If references are entirely missing, you can add them using this form.