Show simple item record

dc.contributor.authorADAM, Klaus
dc.date.accessioned2011-05-09T15:10:51Z
dc.date.available2011-05-09T15:10:51Z
dc.date.issued2001
dc.identifier.citationJournal of Economic Theory, 2001, 101, 1, 252-280
dc.identifier.issn0022-0531
dc.identifier.urihttp://hdl.handle.net/1814/16898
dc.description.abstractThis paper delivers the solution to an optimal search problem where the searcher faces more than one search alternative and is learning about the attractiveness of the respective alternatives during the search process. The optimal sampling strategy is characterized by simple reservation prices that determine which of the search alternatives to sample and when to stop searching. The reservation price criterion is optimal for a large class of learning rules, including Bayesian, nonparametric, and ad-hoc learning rules. The considered search problem contains as special cases many earlier contributions to the search literature and thereby unifies and generalizes two directions of research search with learning from a single search alternative and search without learning from several search alternatives. (C) 2001 Academic Press.
dc.titleLearning While Searching for the Best Alternative
dc.typeArticle
dc.neeo.contributorADAM|Klaus|aut|
dc.identifier.volume101
dc.identifier.startpage252
dc.identifier.endpage280
eui.subscribe.skiptrue
dc.identifier.issue1


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record