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

An interactive method for the optimal selection problem with two decision makers

Author

Listed:
  • Ben Abdelaziz, F.
  • Krichen, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:162:y:2005:i:3:p:602-609
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00054-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. Mitsushi Tamaki, 1991. "A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates," Operations Research, INFORMS, vol. 39(2), pages 274-284, April.
    2. 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.
    3. 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.
    4. S. Christian Albright, 1977. "A Bayesian Approach to a Generalized House Selling Problem," Management Science, INFORMS, vol. 24(4), pages 432-440, December.
    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. 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.
    2. Fouad Abdelaziz & Saoussen Krichen, 2007. "Optimal stopping problems by two or more decision makers: a survey," Computational Management Science, Springer, vol. 4(2), pages 89-111, April.
    3. 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.
    4. Shuk Ying Ho & David Bodoff & Kar Yan Tam, 2011. "Timing of Adaptive Web Personalization and Its Effects on Online Consumer Behavior," Information Systems Research, INFORMS, vol. 22(3), pages 660-679, September.

    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. 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.
    4. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.
    5. 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.
    6. Arash Khatibi & Sheldon H. Jacobson, 2016. "Doubly Stochastic Sequential Assignment Problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 124-137, March.
    7. Golshid Baharian & Sheldon H. Jacobson, 2013. "Limiting behavior of the stochastic sequential assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 321-330, June.
    8. Gershkov, Alex & Moldovanu, Benny, 2013. "Non-Bayesian optimal search and dynamic implementation," Economics Letters, Elsevier, vol. 118(1), pages 121-125.
    9. Dirk Bergemann & Juuso Välimäki, 2019. "Dynamic Mechanism Design: An Introduction," Journal of Economic Literature, American Economic Association, vol. 57(2), pages 235-274, June.
    10. Yen‐Ming Lee & Sheldon M. Ross, 2013. "Bayesian selling problem with partial information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(7), pages 557-570, October.
    11. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
    12. 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.
    13. 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.
    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. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Arash Khatibi & Golshid Baharian & Banafsheh Behzad & Sheldon Jacobson, 2015. "Extensions of the sequential stochastic assignment problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 317-340, December.
    20. Hwa‐Ming Yang, 1987. "Optimal selection of the t best of a sequence with sampling cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 281-292, April.

    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:162:y:2005:i:3:p:602-609. 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.