Login / Signup
Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles.
Vladimir Gurvich
Mariya Naumova
Published in:
CoRR (2021)
Keyphrases
</>
nash equilibria
game theory
nash equilibrium
stochastic games
game theoretic
incomplete information
pure strategy
fictitious play
worst case
solution concepts
subgame perfect
mixed strategy
educational games
computational complexity
extensive form games
multi agent
statistical queries
lower bound
congestion games