Three-player impartial games
| dc.creator | Propp, James | |
| dc.date | 1999-03-26 | |
| dc.date | 1999-06-20 | |
| dc.date.accessioned | 2026-07-07T05:28:28Z | |
| dc.date.available | 2026-07-07T05:28:28Z | |
| dc.description | Past efforts to classify impartial three-player combinatorial games (the theories of Li and Straffin) have made various restrictive assumptions about the rationality of one's opponents and the formation and behavior of coalitions. One may instead adopt an agnostic attitude towards such issues, and seek only to understand in what circumstances one player has a winning strategy against the combined forces of the other two. By limiting ourselves to this more modest theoretical objective, and by regarding two games as being equivalent if they are interchangeable in all disjunctive sums,as far as single-player winnability is concerned, we can obtain an interesting analogue of Grundy values for three-player impartial games. | |
| dc.description | 8 pages, 10 tables; to appear in Theoretical Computer Science | |
| dc.identifier | https://arxiv.org/abs/math/9903153 | |
| dc.identifier | http://arxiv.org/abs/math/9903153 | |
| dc.identifier | Theoretical Computer Science, volume 233 (2000), 263--278. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/78273 | |
| dc.subject | Combinatorics | |
| dc.subject | 90D46 | |
| dc.title | Three-player impartial games | |
| dc.type | text |