Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Nim-type games

From MaRDI portal
Publication:1838431
Jump to:navigation, search

DOI10.1007/BF01771243zbMath0508.90100OpenAlexW2092587468MaRDI QIDQ1838431

Abraham Neyman, David Gale

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1007/bf01771243


zbMATH Keywords

existence of winning strategymin-type gamestwo-person finite deterministic game


Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)


Related Items (8)

Complexity, appeal and challenges of combinatorial games ⋮ The Complexity of Poset Games ⋮ Geodetic Contraction Games on Trees ⋮ Chomp on generalized Kneser graphs and others ⋮ Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice ⋮ A vertex and edge deletion game on graphs ⋮ Recent results and questions in combinatorial game complexities ⋮ A deletion game on hypergraphs



Cites Work

  • A Curious Nim-Type Game


This page was built for publication: Nim-type games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1838431&oldid=14210010"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki