Number of Ties and Undefeated Signs in a Generalized Janken

DOI10.1007/978-3-319-48532-4_13zbMath1482.91048OpenAlexW2554393070MaRDI QIDQ2958096

Hiro Ito, Yoshinao Shiono

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_13

Mathematics Subject Classification ID

Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• Rock-scissors-paper and evolutionarily stable strategies
• How to Generalize Janken – Rock-Paper-Scissors-King-Flea
• Algorithmic Game Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Number of Ties and Undefeated Signs in a Generalized Janken