Winning ways of weighted poset games

DOI10.1007/S00373-007-0710-7MaRDI QIDQ2373442zbMATH OpenOpenAlexFDO

Authors Hiro Ito, Gisaku Nakamura, Satoshi Takata

Publication date 19 July 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0710-7

zbMATH Keywords

ChompCombinatorial gamesNimPoisonous verticesPoset games

Mathematics Subject Classification ID

Paths and cycles (05C38) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Pomax games -- a family of integer-valued partizan games played on posets
• The complexity of poset games
• Flipping the winner of a poset game
• Advances in finding ideal play on poset games
• On the complexity of computing winning strategies for finite poset games

Cites work

• A complete analysis of von Neumann's Hackendot
• Chomp, Recurrences and Chaos(?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 1944398 (Why is no real title available?)
• scientific article; zbMATH DE number 1748378 (Why is no real title available?)
• scientific article; zbMATH DE number 2124071 (Why is no real title available?)
• Lexicographic codes: Error-correcting codes from game theory
• Three-rowed CHOMP

Cited in

(4)

• On weighted balls-into-bins games
• Pomax games -- a family of integer-valued partizan games played on posets
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• On the complexity of computing winning strategies for finite poset games

Describes a project that uses

Uses Software

• Chomp3Rows
• BYRNES

This page was built for publication: Winning ways of weighted poset games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373442)