33 citations · 81 across the 32 of their papers we have counts for
4 papers · 1 filter
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…
A three-person deterministic graphical game without Nash equilibria
Endre Boros, Vladimir Gurvich, Martin Milanič +2
We give an example of a three-person deterministic graphical game that has no Nash equilibrium in pure stationary strategies. The game has seven positions, four outcomes (a unique…
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real , let us call a stochastic game -erg…
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions
Endre Boros, Khaled Elbassioni, Vladimir Gurvich +1
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph , with local rewards $r: E \to \ZZ$, and three t…