211 citations · 504 across the 42 of their papers we have counts for
4 papers · 1 filter
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,…
On Dualization over Distributive Lattices
Khaled Elbassioni
Given a partially order set (poset) , and a pair of families of ideals and filters in such that each pair …
Generating clause sequences of a CNF formula
Kristóf Bérczi, Endre Boros, Ondřej Čepek +3
Given a CNF formula with clauses and variables , a truth assignment of leads to a clause sequence $σ_Φ(a)=(C_…
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…