An interactive method for the optimal selection problem with two decision makers
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- 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.
- 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.
- S. Christian Albright, 1977. "A Bayesian Approach to a Generalized House Selling Problem," Management Science, INFORMS, vol. 24(4), pages 432-440, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- 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.
- 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.
- 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.- 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.
- 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.
- Yaakov Malinovsky & Gregory Haber & Paul S. Albert, 2020. "An optimal design for hierarchical generalized group testing," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 69(3), pages 607-621, June.
- 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.
- Ravi Jagannathan & Iwan Meier, 2002.
"Do We Need CAPM for Capital Budgeting?,"
Financial Management, Financial Management Association, vol. 31(4), Winter.
- Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," NBER Working Papers 8719, National Bureau of Economic Research, Inc.
- Egozcue, Martin & Fuentes García, Luis & Zitikis, Ricardas, 2012. "An optimal strategy for maximizing the expected real-estate selling price: accept or reject an offer?," MPRA Paper 40694, University Library of Munich, Germany.
- 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.
- Tianke Feng & Joseph C. Hartman, 2015. "The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 267-292, June.
- Sadoghi, Amirhossein & Vecer, Jan, 2022. "Optimal liquidation problem in illiquid markets," European Journal of Operational Research, Elsevier, vol. 296(3), pages 1050-1066.
- 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.
- Amirhossein Sadoghi & Jan Vecer, 2022. "Optimal liquidation problem in illiquid markets," Post-Print hal-03696768, HAL.
- 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.
- 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.
- Tapan Biswas & Jolian Mchardy, 2012.
"Asking Price And Price Discounts: The Strategy Of Selling An Asset Under Price Uncertainty,"
Review of Economic Analysis, Digital Initiatives at the University of Waterloo Library, vol. 4(1), pages 17-37, June.
- Tapan Biswas & Jolian Mchardy, 2007. "Asking Price and Price Discounts: The Strategy of Selling an Asset Under Price Uncertainty," Theory and Decision, Springer, vol. 62(3), pages 281-301, May.
- Gershkov, Alex & Moldovanu, Benny, 2013. "Non-Bayesian optimal search and dynamic implementation," Economics Letters, Elsevier, vol. 118(1), pages 121-125.
- 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.
- Bergemann, Dirk & Välimäki, Juuso, 2017. "Dynamic Mechanism Design: An Introduction," CEPR Discussion Papers 12240, C.E.P.R. Discussion Papers.
- Dirk Bergemann & Juuso Valimaki, 2017. "Dynamic Mechanism Design: An Introduction," Cowles Foundation Discussion Papers 2102, Cowles Foundation for Research in Economics, Yale University.
- Dirk Bergemann & Juuso Valimaki, 2017. "Dynamic Mechanism Design: An Introduction," Cowles Foundation Discussion Papers 2102R, Cowles Foundation for Research in Economics, Yale University, revised Jun 2018.
- 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.
- Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
- L. Bayón & P. Fortuny & J. Grau & A. M. Oller-Marcén & M. M. Ruiz, 2019. "The Best-or-Worst and the Postdoc problems with random number of candidates," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 86-110, July.
- 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.
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.