Theory of division games

DOI10.2977/PRIMS/1195189068MaRDI QIDQ1252163zbMATH OpenOpenAlexFDO

Authors Yōhei Yamasaki

Publication date 1978

Published in Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2977/prims/1195189068

zbMATH Keywords

Division GamesSwitching GamesTwo-Person Games

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) 2-person games (91A05) Applications of game theory (91A80)

Cites work

• A Combinatorial Problem Which Is Complete in Polynomial Space
• A Solution of the Shannon Switching Game
• scientific article; zbMATH DE number 3532767 (Why is no real title available?)
• scientific article; zbMATH DE number 3334121 (Why is no real title available?)
• The Existence and Construction of Balanced Incomplete Block Designs

Cited in

(8)

• Theory of connexes. I
• A difficulty in particular Shannon-like games
• Shannon switching games without terminals. III
• The arithmetic of reversed positional games
• The arithmetic or reversed positional games
• Shannon switching games without terminals. II
• On the combinatorial value of Hex positions
• Shannon-like games are difficult

This page was built for publication: Theory of division games

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