MCDM'19 - paper no. 5

 

Back to MCDM'19 contents
 

OPTIMAL SELECTION FROM A SET OF OFFERS USING A SHORT LIST

David M. Ramsey

Abstract:

The rise of the Internet has led to a huge amount of information being available at the touch of a button. This article presents a model of searching for a valuable good, e.g. a new flat, using the Internet to gain initial information about the offers available. This information is used to create a short list of offers to be observed more closely before making a final decision. Although there has been a lot of recent work on the use of short lists in decision making procedures, there has been very little work on how the length of a short list should depend on the parameters of the search problem. This article addresses this problem and gives results on the optimal length of a short list when a searcher is to choose one of n offers and the search costs are convex in the length of the short list. Several examples are considered.

Keywords:

secretary problem, incomplete information, payment for additional information, agglomeration of multiple traits

Reference index:

David M. Ramsey, (2019), OPTIMAL SELECTION FROM A SET OF OFFERS USING A SHORT LIST, Multiple Criteria Decision Making (14), pp. 75-92

Full text:

download

Scopus citations in 1 paper(s):
  1. Ramsey, D. M. (2020). A game theoretic model of choosing a valuable good via a short list heuristic. Mathematics, 8(2) doi:10.3390/math8020199

This article is licensed under a Creative Commons Atribution- NonCommercial International License .