On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826): Difference between revisions
From MaRDI portal
Latest revision as of 10:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. |
scientific article |
Statements
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (English)
0 references
4 December 2003
0 references
backward induction
0 references
cyclic game
0 references
Nash equilibrium
0 references
perfect information
0 references
pure strategies
0 references