18 citations · 42 across the 38 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2024
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,…
cs.DM2014
A Nested Family of -total Effective Rewards for Positional Games
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We consider Gillette's two-person zero-sum stochastic games with perfect information. For each $k \in \ZZ_+$ we introduce an effective reward function, called -total. For $k = 0…