Show simple item record

A More General Pandora Rule?

dc.creatorOlszewski, Wojciech
dc.creatorWeber, Richard
dc.date.accessioned2018-11-24T23:26:30Z
dc.date.available2015-11-16T13:36:41Z
dc.date.available2018-11-24T23:26:30Z
dc.date.issued2015-11-02
dc.identifierhttps://www.repository.cam.ac.uk/handle/1810/252615
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/123456789/3839
dc.description.abstractIn a model introduced by Weitzman an agent called Pandora opens boxes sequentially, in whatever order she likes, discovers prizes within, and optimally stops. Her aim is to maximize the expected value of the greatest discovered prize, minus the costs of opening the boxes. The solution, using the so-called Pandora rule, is attractive and has many applications. However, it does not address applications in which the payoff depends on all discovered prizes, rather than just the best of them, nor is it easy to say whether or not some generalized Pandora rule might do so. Here, we establish a sense in which it cannot. We discover that if a generalized Pandora rule is to be optimal for some more general utility, and all model parameters, then the problem can be solved via a second problem having Weitzman's form of utility.
dc.languageen
dc.publisherElsevier
dc.publisherJournal of Economic Theory
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/2.0/uk/
dc.rightsAttribution-NonCommercial-NoDerivs 2.0 UK: England & Wales
dc.subjectOptimal scheduling and stopping
dc.subjectWeitzman's Pandora rule
dc.titleA More General Pandora Rule?
dc.typeArticle


Files in this item

FilesSizeFormatView
Olszewski & Web ... nal of Economic Theory.pdf259.5Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record