IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v151y2003i1p140-152.html
   My bibliography  Save this article

Analysis of heuristic solutions to the best choice problem

Author

Listed:
  • Stein, William E.
  • Seale, Darryl A.
  • Rapoport, Amnon

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:151:y:2003:i:1:p:140-152
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00601-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Rethmann, J. & Wanke, E., 2001. "Stack-up algorithms for palletizing at delivery industry," European Journal of Operational Research, Elsevier, vol. 128(1), pages 74-97, January.
    2. Pekka Korhonen & Herbert Moskowitz & Pekka Salminen & Jyrki Wallenius, 1993. "Further Developments and Tests of a Progressive Algorithm for Multiple Criteria Decision Making," Operations Research, INFORMS, vol. 41(6), pages 1033-1045, December.
    3. 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.
    4. Seale, Darryl A. & Rapoport, Amnon, 1997. "Sequential Decision Making with Relative Ranks: An Experimental Investigation of the "Secretary Problem">," Organizational Behavior and Human Decision Processes, Elsevier, vol. 69(3), pages 221-236, March.
    5. Mehrez, Abraham & Rabinowitz, Gad, 1995. "A note on the rule for sequential selection," European Journal of Operational Research, Elsevier, vol. 81(1), pages 166-175, February.
    6. 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.
    7. 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.
    8. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Georgy Yu. Sofronov, 2020. "An Optimal Double Stopping Rule for a Buying-Selling Problem," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 1-12, March.
    3. Sofronov, Georgy, 2013. "An optimal sequential procedure for a multiple selling problem with independent observations," European Journal of Operational Research, Elsevier, vol. 225(2), pages 332-336.
    4. Ferenstein, Elzbieta Z. & Krasnosielska, Anna, 2010. "No-information secretary problems with cardinal payoffs and Poisson arrivals," Statistics & Probability Letters, Elsevier, vol. 80(3-4), pages 221-227, February.
    5. Vincent Mak & Darryl A. Seale & Amnon Rapoport & Eyran J. Gisches, 2019. "Voting Rules in Sequential Search by Committees: Theory and Experiments," Management Science, INFORMS, vol. 65(9), pages 4349-4364, September.
    6. So, Mee Chi & Thomas, Lyn C. & Huang, Bo, 2016. "Lending decisions with limits on capital available: The polygamous marriage problem," European Journal of Operational Research, Elsevier, vol. 249(2), pages 407-416.
    7. J. Neil Bearden & Amnon Rapoport & Ryan O. Murphy, 2006. "Sequential Observation and Selection with Rank-Dependent Payoffs: An Experimental Study," Management Science, INFORMS, vol. 52(9), pages 1437-1449, September.
    8. Ramsey, David M. & Szajowski, Krzysztof, 2008. "Selection of a correlated equilibrium in Markov stopping games," European Journal of Operational Research, Elsevier, vol. 184(1), pages 185-206, January.
    9. Andrej Angelovski & Werner Güth, 2017. "When to Stop - A Cardinal Secretary Search Experiment," Working Papers CESARE 1706, Dipartimento di Economia e Finanza, LUISS Guido Carli.
    10. Ramsey, David M. & Szajowski, Krzysztof, 2004. "Correlated equilibria in competitive staff selection problem," MPRA Paper 19870, University Library of Munich, Germany, revised 2006.
    11. Darryl Seale & William Stein & Amnon Rapoport, 2014. "Hold or roll: reaching the goal in jeopardy race games," Theory and Decision, Springer, vol. 76(3), pages 419-450, March.
    12. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
    13. Mak, Vincent & Rapoport, Amnon & Seale, Darryl A., 2014. "Sequential search by groups with rank-dependent payoffs: An experimental study," Organizational Behavior and Human Decision Processes, Elsevier, vol. 124(2), pages 256-267.
    14. Hugh N. Entwistle & Christopher J. Lustri & Georgy Yu. Sofronov, 2022. "On Asymptotics of Optimal Stopping Times," Mathematics, MDPI, vol. 10(2), pages 1-18, January.
    15. Georgy Sofronov, 2020. "An Optimal Decision Rule for a Multiple Selling Problem with a Variable Rate of Offers," Mathematics, MDPI, vol. 8(5), pages 1-11, May.

    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. 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.
    2. 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.
    3. Ankur Sinha & Pekka Korhonen & Jyrki Wallenius, 2016. "Finding better alternatives than those considered in a multiple criteria data sample," Journal of Business Economics, Springer, vol. 86(1), pages 35-54, January.
    4. Werner Guth & Torsten Weiland, 2011. "Aspiration formation and satisficing in search with(out) competition," New Zealand Economic Papers, Taylor & Francis Journals, vol. 45(1-2), pages 23-45.
    5. Lahdelma, Risto & Salminen, Pekka & Kuula, Markku, 2003. "Testing the efficiency of two pairwise comparison methods in discrete multiple criteria problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 496-508, March.
    6. Hsiao, Yu-Chin & Kemp, Simon & Servátka, Maroš & Ward, Matt & Zhang, Le, 2021. "Time Costs and Search Behavior," MPRA Paper 105412, University Library of Munich, Germany.
    7. 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.
    8. Chun, Young H., 2015. "Multi-attribute sequential decision problem with optimizing and satisficing attributes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 224-232.
    9. 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.
    10. 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.
    11. 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.
    12. Hsiao, Yu Chin & Kemp, Simon & Servátka, Maroš, 2019. "On the Importance of Context in Sequential Decision-Making," MPRA Paper 94027, University Library of Munich, Germany.
    13. Vincent Mak & Darryl A. Seale & Amnon Rapoport & Eyran J. Gisches, 2019. "Voting Rules in Sequential Search by Committees: Theory and Experiments," Management Science, INFORMS, vol. 65(9), pages 4349-4364, September.
    14. Wenjie Tang & J. Neil Bearden & Ilia Tsetlin, 2009. "Ultimatum Deadlines," Management Science, INFORMS, vol. 55(8), pages 1423-1437, August.
    15. Mak, Vincent & Rapoport, Amnon & Seale, Darryl A., 2014. "Sequential search by groups with rank-dependent payoffs: An experimental study," Organizational Behavior and Human Decision Processes, Elsevier, vol. 124(2), pages 256-267.
    16. Jhunjhunwala, Tanushree, 2021. "Searching to avoid regret: An experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 189(C), pages 298-319.
    17. Rami Zwick & Amnon Rapoport & Alison King Chung Lo & A. V. Muthukrishnan, 2003. "Consumer Sequential Search: Not Enough or Too Much?," Marketing Science, INFORMS, vol. 22(4), pages 503-519, October.
    18. 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.
    19. Manel Baucells & Rakesh K. Sarin, 2003. "Group Decisions with Multiple Criteria," Management Science, INFORMS, vol. 49(8), pages 1105-1118, August.
    20. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:151:y:2003:i:1:p:140-152. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.