18 citations · 42 across the 38 of their papers we have counts for
5 papers · 2 filters
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…
Tetris Hypergraphs and Combinations of Impartial Games
Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2
The Sprague-Grundy (SG) theory reduces the sum of impartial games to the classical game of . We generalize the concept of sum and introduce $\cH$-combinations of impartial gam…