4 problems

Consider the given imbalanced $(m,2k+1)$-RPS game and a Nash equilibrium $N$. Let $P_i(S)$ be the probability that player $i$ plays $S$, and let $P_i(T_p)$ be the probability that…

The imbalanced $(m,2n+1)$-RPS is constructed from the paper's imbalanced $(m,3)$-RPS construction by iterated blow-ups. A game is strongly playable when it has the property defined…

An $m$-player $(2n+1)$-$RPS$ game is a game with $2n+1$ objects and $m$ players interacting through the paper's $RPS$ payoff structure. A blow-up of a game $G_1$ at an object repla…

An $RPS$ game is a game in which objects interact through a cyclic relation of one object beating another. A game is playable when each object sees play, meaning that it is used wi…