Algorithms for lattice games

DOI10.1007/s00182-012-0319-9zbMath1278.91031arXiv1105.5413OpenAlexW1977575010MaRDI QIDQ378325

Alan Guo, Ezra Miller

Publication date: 11 November 2013

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.5413

zbMATH Keywords

rational pointsconvex polyhedroncombinatorial gameaffine semigrouplattice gamemisère quotientshort generating function

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (3)

Affine stratifications from finite misère quotients. ⋮ Lattice point methods for combinatorial games ⋮ Unnamed Item

Cites Work

• Lattice point methods for combinatorial games
• Lattice games without rational strategies
• Misère quotients for impartial games
• Short rational generating functions for lattice point problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for lattice games