3 citations · 6 across the 4 of their papers we have counts for
7 papers
Monotone bargaining is Nash-solvable
Vladimir Gurvich, Gleb Koshevoy
Given two finite ordered sets and , introduce the set of outcomes of the game $O = \{(a, b) \mid a \in A, b \in B\} = \{(…
Generalizing Gale's theorem on backward induction and domination of strategies
Vladimir Gurvich
In 1953 Gale noticed that for every n-person game in extensive form with perfect information modeled by a rooted treesome special Nash equilibrium in pure strategies can be found b…
Separable discrete functions: recognition and sufficient conditions
Endre Boros, Ondrej Cepek, Vladimir Gurvich
A discrete function of variables is a mapping , where , and are arbitrary finite sets. Function is cal…
Backward induction in presence of cycles
Vladimir Gurvich
For the classical backward induction algorithm, the input is an arbitrary -person positional game with perfect information modeled by a finite acyclic directed graph (digraph) a…
On Equistable, Split, CIS, and Related Classes of Graphs
Endre Boros, Vladimir Gurvich, Martin Milanič
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes. We pursue a systematic st…
On the computational complexity of solving stochastic mean-payoff games
Vladimir Gurvich, Peter Bro Miltersen
We consider some well-known families of two-player, zero-sum, perfect information games that can be viewed as special cases of Shapley's stochastic games. We show that the followin…