The computational complexity of rationalizing boundedly rational choice behavior (Q2427841): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:42, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of rationalizing boundedly rational choice behavior |
scientific article |
Statements
The computational complexity of rationalizing boundedly rational choice behavior (English)
0 references
18 April 2012
0 references
boundedly rational choice
0 references
rationalization by multiple rationales
0 references
sequential rationalization
0 references
rationalization by game trees
0 references
status-quo bias
0 references
computational complexity
0 references
\(\mathbf {NP}\)-completeness
0 references
