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…

Let an $n$-person deterministic graphical game be play-once if every player makes at most one move during a play. The game is Nash-solvable if it has a Nash equilibrium in pure sta…

Let $x$ be a position in the exact slow game $\operatorname{NIM}(n,n-1)$ played by $\ell$ players in a fixed cyclic order. A move reduces $n-1$ positive entries by $1$ and leaves o…

Consider the exact slow game NIM$(n,n-1)$ for $\ell$ players: a position is a non-negative $n$-vector, players move cyclically, and on each move a player keeps one entry unchanged…