3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.FL2023
On universality of regular realizability problems
Alexander Rubtsov, Michael Vyalyi
We prove the universality of the regular realizability problems for several classes of filters. The filters are encodings of finite relations on the set of non-negative integers in…
cs.GT2022
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…
math.CO2021★ 3 cited
More about Exact Slow -Nim
Nikolay Chikin, Vladimir Gurvich, Konstantin Knop +2
Given piles of tokens and a positive integer , the game Nim of exact slow -Nim is played as follows. Two players move alternately. In each move, a play…