3 citations · 4 across the 15 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.GT2021
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 …
math.ST2021
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…
math.CO2021
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…