Login / Signup
On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost.
Vladimir Gurvich
Vladimir Oudalov
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
perfect information
imperfect information
human players
card games
nash equilibria
nash equilibrium
subgame perfect equilibrium
card game
stochastic games
game theory
multi agent
optimal solution
game playing
game theoretic
board game