IDEAS home Printed from https://ideas.repec.org/a/eee/jobhdp/v69y1997i3p221-236.html
   My bibliography  Save this article

Sequential Decision Making with Relative Ranks: An Experimental Investigation of the "Secretary Problem">

Author

Listed:
  • Seale, Darryl A.
  • Rapoport, Amnon

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jobhdp:v:69:y:1997:i:3:p:221-236
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0749-5978(97)92683-2
    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. 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. Kogut, Carl A., 1990. "Consumer search behavior and sunk costs," Journal of Economic Behavior & Organization, Elsevier, vol. 14(3), pages 381-392, December.
    3. T. J. Stewart, 1981. "The Secretary Problem with an Unknown Number of Options," Operations Research, INFORMS, vol. 29(1), pages 130-145, February.
    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. 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.
    2. 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.
    3. 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.
    4. Jhunjhunwala, Tanushree, 2021. "Searching to avoid regret: An experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 189(C), pages 298-319.
    5. Franz Rothlauf & Daniel Schunk & Jella Pfeiffer, 2005. "Classification of Human Decision Behavior: Finding Modular Decision Rules with Genetic Algorithms," MEA discussion paper series 05079, Munich Center for the Economics of Aging (MEA) at the Max Planck Institute for Social Law and Social Policy.
    6. 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.
    7. 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.
    8. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.
    9. Schunk, Daniel, 2009. "Behavioral heterogeneity in dynamic search situations: Theory and experimental evidence," Journal of Economic Dynamics and Control, Elsevier, vol. 33(9), pages 1719-1738, September.
    10. 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.
    11. 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.
    12. Daniel Friedman & Kai Pommerenke & Rajan Lukose & Garrett Milam & Bernardo Huberman, 2007. "Searching for the sunk cost fallacy," Experimental Economics, Springer;Economic Science Association, vol. 10(1), pages 79-104, March.
    13. Brannon, James I. & Gorman, Michael F., 2002. "The effects of information costs on search and convergence in experimental markets," Journal of Economic Behavior & Organization, Elsevier, vol. 47(4), pages 375-390, April.
    14. Marcu, Emanuel & Noussair, Charles, 2018. "Sequential Search with a Price Freeze Option - Theory and Experimental Evidence," Other publications TiSEM dacf4815-c001-44c3-bda3-f, Tilburg University, School of Economics and Management.
    15. Xavier Gabaix & David Laibson & Guillermo Moloche & Stephen Weinberg, 2006. "Costly Information Acquisition: Experimental Analysis of a Boundedly Rational Model," American Economic Review, American Economic Association, vol. 96(4), pages 1043-1068, September.
    16. 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.
    17. A. Norman & J. Berman & K. Brehm & M. Drake & A. Dyer & J. Frisby & C. Govil & C. Hinchey & L. Heuer & J. Ke & S. Kejriwal & K. Kuang & S. Keyburn & S. Ler & K. Powers & A. Robertson & J. Sanghai & C., 2012. "Repeated Price Search," Computational Economics, Springer;Society for Computational Economics, vol. 39(3), pages 243-257, March.
    18. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
    19. Pantelis P. Analytis & Amit Kothiyal & Konstantinos Katsikopoulos, 2014. "Multi-attribute utility models as cognitive search engines," Judgment and Decision Making, Society for Judgment and Decision Making, vol. 9(5), pages 403-419, September.
    20. 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.

    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:jobhdp:v:69:y:1997:i:3:p:221-236. 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/obhdp .

    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.