Abstract | ||
---|---|---|
We solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behavior in the results of our computations, that seems to encourage odd or maximal bids. |
Year | DOI | Venue |
---|---|---|
2012 | 10.3390/g3040150 | Games 411 |
Keywords | DocType | Volume |
dynamic programming,game theory,linear programming | Journal | 3 |
Issue | ISSN | Citations |
4 | Games 3 (2012) 150--156 | 6 |
PageRank | References | Authors |
0.47 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Glenn C. Rhoads | 1 | 6 | 0.81 |
Laurent Bartholdi | 2 | 27 | 8.74 |