Optimal Strategies for a Generalized "Scissors, Paper, and Stone" Game
From MaRDI portal
Publication:5286368
DOI10.2307/2324486zbMATH Open0776.05047OpenAlexW2083748041MaRDI QIDQ5286368FDOQ5286368
Authors: David C. Fisher, Jennifer K. Ryan 
Publication date: 29 June 1993
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2324486
Recommendations
Cited In (20)
- Optimal strategies for some team games
- Optimal strategies for random tournament games
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- On semi-restricted rock, paper, scissors
- The distribution of optimal strategies in symmetric zero-sum games
- Probabilities within optimal strategies for tournament games
- Bounds for mixed strategy equilibria and the spatial model of elections
- Tight bounds on 3-team manipulations in randomized death match
- Optimal strategies for ``Around the world
- Tournament games and positive tournaments
- Social choice and electoral competition in the general spatial model
- How to generalize janken -- rock-paper-scissors-king-flea
- The minimal covering set in large tournaments
- Representation in majority tournaments
- Strategy-proofness of the randomized Condorcet voting system
- Number of ties and undefeated signs in a generalized janken
- OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH
- Tournament games and Condorcet voting
- Semi-restricted rock, paper, scissors
- Rock-paper-scissors play: beyond the win-stay/lose-change strategy
This page was built for publication: Optimal Strategies for a Generalized "Scissors, Paper, and Stone" Game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286368)
