A divide and conquer algorithm for exploiting policy function monotonicity (Q4586348)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A divide and conquer algorithm for exploiting policy function monotonicity |
scientific article; zbMATH DE number 6935872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide and conquer algorithm for exploiting policy function monotonicity |
scientific article; zbMATH DE number 6935872 |
Statements
A divide and conquer algorithm for exploiting policy function monotonicity (English)
0 references
13 September 2018
0 references
computation
0 references
monotonicity
0 references
grid search
0 references
discrete choice
0 references
sovereign default
0 references
0.7485805749893188
0 references
0.7412033677101135
0 references
0.7359851598739624
0 references
0.7324023842811584
0 references