18 citations · 42 across the 38 of their papers we have counts for
5 papers · 1 filter
Avoidability beyond paths
Vladimir Gurvich, Matjaž Krnc, Martin Milanič +1
The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2019 as a common generalization of avoidable vertices and simpli…
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
Vladimir Gurvich, Mariya Naumova
Let and be a pair of dual multi-hypergraphs on the common ground set . Note that…
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…
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich +1
We prove that a deterministic n-person shortest path game has a Nash equlibrium in pure and stationary strategies if it is edge-symmetric (that is (u,v) is a move whenever (v,u) is…
Supercentenarian paradox
Vladimir Gurvich, Mariya Naumova
Consider the following statement: : a years old person NN will survive another years, where are nonnegative real numbers. We know only that…