2000 character limit reached
Nash Equilibria of Rock Paper Scissors Variants
Published 16 Oct 2024 in math.CO | (2410.13560v1)
Abstract: We generalize Rock Paper Scissors to complete directed graphs, or tournaments, on $n$ vertices. Properties of the mixed-strategy Nash equilibria of these tournaments are discussed, particularly those with Nash equilibria where all of the strategies have a nonzero probability. We find graph-theoretic properties of such games and tabulate them for $n \leq 7$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.