18 citations · 42 across the 38 of their papers we have counts for
6 papers · 1 filter
On Nash-solvability of finite -person shortest path games; bi-shortest path conjecture
Vladimir Gurvich
We formulate a conjecture from graph theory that is equivalent to Nash-solvability of the finite two-person shortest path games with positive local costs. For the three-person game…
On Nash-solvability of finite -person deterministic graphical games; Catch 22
Vladimir Gurvich
We consider finite -person deterministic graphical (DG) games. These games are modelled by finite directed graphs (digraphs) which may have directed cycles and, hence, infin…
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
Vladimir Gurvich, Mariya Naumova
In 1975 the first author proved that every finite tight two-person game form is Nash-solvable, that is, for every payoffs and of two players the obtained game …
Logical contradictions in the One-way ANOVA and Tukey-Kramer multiple comparisons tests with more than two groups of observations
Vladimir Gurvich, Mariya Naumova
We show that the One-way ANOVA and Tukey-Kramer (TK) tests agree on any sample with two groups. This result is based on a simple identity connecting the Fisher-Snedecor and student…
On Nash-solvability of n-person graphical games under Markov's and a priori realizations
Vladimir Gurvich, Mariya Naumova
We consider graphical -person games with perfect information that have no Nash equilibria in pure stationary strategies. Solving these games in mixed strategies, we introduce pr…
More about Exact Slow -Nim
Nikolay Chikin, Vladimir Gurvich, Konstantin Knop +2
Given piles of tokens and a positive integer , the game Nim of exact slow -Nim is played as follows. Two players move alternately. In each move, a play…