3 citations · 4 across the 15 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2022
On Nash-Solvability of Finite Two-Person Tight Vector Game Forms
Vladimir Gurvich, Mariya Naumova
We consider finite two-person normal form games. The following four properties of their game forms are equivalent: (i) Nash-solvability, (ii) zero-sum-solvability, (iii) win-lose-s…
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 …