The best choice problem under ambiguity by Tatjana Chudjakow and Frank Riedel
Material type:
- text
- unmediated
- volume
- HB119 ECO
Item type | Current library | Call number | Vol info | Copy number | Status | Notes | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
Main Library - Special Collections | HB119 ECO (Browse shelf(Opens below)) | vol. 54, no. 2 (pages 77-98) | SP21036 | Not for loan | For In house Use |
Browsing Main Library shelves, Shelving location: - Special Collections Close shelf browser (Hides shelf browser)
We model and solve best choice problems in the multiple prior framework: An ambiguity averse decision maker aims to choose the best among a fixed number of applicants that appear sequentially in a random order. The agent faces ambiguity about the probability that a candidate—a relatively top applicant—is actually best among all applicants. We show that our model covers the classical secretary problem, but also other interesting classes of problems. We provide a closed form solution of the problem for time-consistent priors using backward induction. As in the classical case, the derived stopping strategy is simple. Ambiguity can lead to substantial differences to the classical threshold rule.
There are no comments on this title.