5 problems

Strict Nash equilibrium conjecture. An amodular graph cannot have an equilibrium partition associated with a strict Nash equilibrium.

Consider the structured coordination game with neutral options and its stochastic dynamics, while excluding conclusions that rely on payoff or risk dominance. Asymptotic-persistenc…

Consider the stochastic dynamics of the structured coordination game with neutral options on graphs, and let an $n$-cycle mean a cyclic trajectory of length $n$ with $n>2$. Almost-…

Let $G$ be a graph, let $C$ be the set of strategies, let $w(v,c\mid\mathbf{u})$ be the payoff or best-response score for vertex $v$ choosing $c$ under strategy profile…

Let $\Gamma_{n,N(n)}$ be an Erdős–Rényi random graph, let $Q_{\Gamma_{n,N(n)}}^0$ denote the trivial consensus partition, and let $\phi(Q_{\Gamma_{n,N(n)}}^0)$ be the probability t…