IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v55y2004i9d10.1057_palgrave.jors.2601761.html
   My bibliography  Save this article

Generalized best choice problem based on the information economics approach

Author

Listed:
  • Y H Chun

    (Louisiana State University)

Abstract

We consider the problem of choosing the ‘best choice’ among a certain number of objects that are presented to a decision-maker in sequential order. Such a sequential selection problem is commonly referred to as the ‘best choice problem’, and its optimal stopping rule has been obtained either via the dynamic programming approach or via the Markovian approach. Based on the theory of information economics, we propose in the paper the third approach to a generalized version of the best choice problem that is intuitively more appealing. Various types of the best choice problem, such as (1) the classical secretary problem, (2) no information group interview problem, and (3) full information best choice problem with a random walk process, are shown to be special cases of the generalized best choice problem. The modelling framework of information economics has potential for building theory that ultimately would produce practical stopping rules.

Suggested Citation

  • Y H Chun, 2004. "Generalized best choice problem based on the information economics approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 988-999, September.
    • Handle: RePEc:pal:jorsoc:v:55:y:2004:i:9:d:10.1057_palgrave.jors.2601761
    DOI: 10.1057/palgrave.jors.2601761
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601761
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601761?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. D. V. Lindley, 1961. "Dynamic Programming and Decision Theory," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 10(1), pages 39-51, March.
    2. Tōru Nakai, 1986. "An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period," Operations Research, INFORMS, vol. 34(3), pages 478-485, June.
    3. Hak Chun, Young, 1996. "Selecting the best choice in the weighted secretary problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 135-147, July.
    4. Chun, Young H. & Moskowitz, Herbert & Plante, Robert D., 1994. "Dynamic programming formulation of the group interview problem with a general utility function," European Journal of Operational Research, Elsevier, vol. 78(1), pages 81-92, October.
    5. Ronen, Boaz, 1994. "An information-economics approach to quality control attribute sampling," European Journal of Operational Research, Elsevier, vol. 73(3), pages 430-442, March.
    6. Pekka Korhonen & Herbert Moskowitz & Jyrki Wallenius, 1986. "A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems," Operations Research, INFORMS, vol. 34(5), pages 726-731, October.
    7. Ronen, Boaz & Spector, Yishay, 1995. "Evaluating sampling strategy under two criteria," European Journal of Operational Research, Elsevier, vol. 80(1), pages 59-67, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chun, Young H. & Plante, Robert D. & Schneider, Helmut, 2002. "Buying and selling an asset over the finite time horizon: A non-parametric approach," European Journal of Operational Research, Elsevier, vol. 136(1), pages 106-120, January.
    2. Stein, William E. & Seale, Darryl A. & Rapoport, Amnon, 2003. "Analysis of heuristic solutions to the best choice problem," European Journal of Operational Research, Elsevier, vol. 151(1), pages 140-152, November.
    3. Ben Abdelaziz, F. & Krichen, S., 2005. "An interactive method for the optimal selection problem with two decision makers," European Journal of Operational Research, Elsevier, vol. 162(3), pages 602-609, May.
    4. Chun, Young H., 1999. "Selecting the best choice in the full information group interview problem," European Journal of Operational Research, Elsevier, vol. 119(3), pages 635-651, December.
    5. Carmi, Nava & Ronen, Boaz, 1996. "An empirical application of the information-structures model: The postal authority case," European Journal of Operational Research, Elsevier, vol. 92(3), pages 615-627, August.
    6. Fouad Ben Abdelaziz & Ray Saadaoui Mallek, 2018. "Multi-criteria optimal stopping methods applied to the portfolio optimisation problem," Annals of Operations Research, Springer, vol. 267(1), pages 29-46, August.
    7. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.
    8. Nikolaos Argyris & Alec Morton & José Rui Figueira, 2014. "CUT: A Multicriteria Approach for Concavifiable Preferences," Operations Research, INFORMS, vol. 62(3), pages 633-642, June.
    9. Fabien Gensbittel & Dana Pizarro & Jérôme Renault, 2024. "Competition and Recall in Selection Problems," Dynamic Games and Applications, Springer, vol. 14(4), pages 806-845, September.
    10. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
    11. Adam Woryna, 2017. "The solution of a generalized secretary problem via analytic expressions," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1469-1491, May.
    12. Amnon Rapoport & Darryl A. Seale & Leonidas Spiliopoulos, 2023. "Progressive stopping heuristics that excel in individual and competitive sequential search," Theory and Decision, Springer, vol. 94(1), pages 135-165, January.
    13. Chun, Young H. & Sumichrast, Robert T., 2006. "A rank-based approach to the sequential selection and assignment problem," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1338-1344, October.
    14. Yu‐Chin Hsiao & Simon Kemp & Maroš Servátka, 2020. "On the Importance of Context in Sequential Search," Southern Economic Journal, John Wiley & Sons, vol. 86(4), pages 1510-1530, April.
    15. Nasim Nasrabadi & Akram Dehnokhalaji & Pekka Korhonen & Jyrki Wallenius, 2019. "Using convex preference cones in multiple criteria decision making and related fields," Journal of Business Economics, Springer, vol. 89(6), pages 699-717, August.
    16. Pekka Salminen & Jeffrey E. Teich & Jyrki Wallenius, 1998. "The Secretary Problem Revisited - The Group Decision-Making Perspective," Group Decision and Negotiation, Springer, vol. 7(1), pages 3-21, January.
    17. Kimmo Eriksson & Jonas Sjöstrand & Pontus Strimling, 2007. "Optimal Expected Rank in a Two-Sided Secretary Problem," Operations Research, INFORMS, vol. 55(5), pages 921-931, October.
    18. Werner Güth & Ev Martin & Torsten Weiland, 2006. "Aspiration formation and satisficing in isolated and competitive search," Papers on Strategic Interaction 2006-26, Max Planck Institute of Economics, Strategic Interaction Group.
    19. Schaffner, Florian, 2016. "Information transmission in high dimensional choice problems: The value of online ratings in the restaurant market," VfS Annual Conference 2016 (Augsburg): Demographic Change 145585, Verein für Socialpolitik / German Economic Association.
    20. L. Bayón & P. Fortuny Ayuso & J. M. Grau & A. M. Oller-Marcén & M. M. Ruiz, 2018. "The Best-or-Worst and the Postdoc problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 703-723, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:55:y:2004:i:9:d:10.1057_palgrave.jors.2601761. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.