Optimal Strategies for a Generalized "Scissors, Paper, and Stone" Game
From MaRDI portal
(Redirected from Publication:5286368)
Recommendations
Cited in
(22)- Optimal strategies for some team games
- Probabilities within optimal strategies for tournament games
- Bounds for mixed strategy equilibria and the spatial model of elections
- Optimal strategies for random tournament games
- Tournament games and Condorcet voting
- Representation in majority tournaments
- The distribution of optimal strategies in symmetric zero-sum games
- Social choice and electoral competition in the general spatial model
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- Strategy-proofness of the randomized Condorcet voting system
- Rock-paper-scissors play: beyond the win-stay/lose-change strategy
- How to generalize janken -- rock-paper-scissors-king-flea
- Number of ties and undefeated signs in a generalized janken
- Optimal strategies for ``Around the world
- Tournament games and positive tournaments
- OPTIMAL STRATEGY IN “GUESS WHO?”: BEYOND BINARY SEARCH
- Semi-restricted rock, paper, scissors
- Tight bounds on 3-team manipulations in randomized death match
- The minimal covering set in large tournaments
- On semi-restricted rock, paper, scissors
- Paradoxial n-faces dice built from magic squares
- Approximately strategyproof tournament rules in the probabilistic setting
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)
