On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. (Q1414826): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0165-4896(03)00077-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984807749 / rank | |||
Normal rank | |||
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
