Optimal Strategies for a Generalized "Scissors, Paper, and Stone" Game

DOI10.2307/2324486zbMath0776.05047OpenAlexW2083748041MaRDI QIDQ5286368

Jennifer K. Ryan, David C. Fisher

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

zbMATH Keywords

optimal strategygametournament

Mathematics Subject Classification ID

Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20)

Related Items

Strategy-proofness of the randomized Condorcet voting system ⋮ Probabilities within optimal strategies for tournament games ⋮ Tight bounds on 3-team manipulations in randomized death match ⋮ Representation in majority tournaments ⋮ The minimal covering set in large tournaments ⋮ Social choice and electoral competition in the general spatial model ⋮ The distribution of optimal strategies in symmetric zero-sum games ⋮ Optimal strategies for random tournament games ⋮ Tournament games and Condorcet voting ⋮ Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games ⋮ Bounds for mixed strategy equilibria and the spatial model of elections