A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Vladimir Oudalov (CSR, 2008)

A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory. - Endre Boros; Vladimir Gurvich; Vladimir Oudalov (Int. J. Game Theory, 2013)

A four-person chess-like game without Nash equilibria in pure stationary strategies. - Vladimir Gurvich; Vladimir Oudalov (CoRR, 2014)

On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost. - Vladimir Gurvich; Vladimir Oudalov (Discret. Appl. Math., 2014)

A three-person chess-like game without Nash equilibria. - Endre Boros; Vladimir Gurvich; Martin Milanic; Vladimir Oudalov; Jernej Vicic (CoRR, 2016)

Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden (2 times 2 ) subgames. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino; Vladimir Oudalov (Int. J. Game Theory, 2016)

A three-person deterministic graphical game without Nash equilibria. - Endre Boros; Vladimir Gurvich; Martin Milanic; Vladimir Oudalov; Jernej Vicic (Discret. Appl. Math., 2018)