2 papers
cs.DM2025
Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We prove that every finite two-person shortest path game, where the local cost of every move is positive for each player, has a Nash equilibrium (NE) in pure stationary strategies,…
math.CO2025
Growing Trees and Amoebas' Replications
Vladimir Gurvich, Matjaž Krnc, Mikhail Vyalyi
An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length . This paper analyses such a growth process. An amoeba is morta…