IDEAS home Printed from https://ideas.repec.org/r/bla/jorssc/v10y1961i1p39-51.html
   My bibliography  Save this item

Dynamic Programming and Decision Theory

Citations

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


Cited by:

  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. 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.
  3. Wojciech Kaźmierczak, 2016. "The best choice problem for posets; colored complete binary trees," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 13-28, January.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. Moran Feldman & Ola Svensson & Rico Zenklusen, 2018. "A Simple O (log log(rank))-Competitive Algorithm for the Matroid Secretary Problem," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 638-650, May.
  10. 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.
  11. Martin Meier & Leopold Sögner, 2023. "Hunting for superstars," Mathematics and Financial Economics, Springer, volume 17, number 1, June.
  12. José A. Soto & Abner Turkieltaub & Victor Verdugo, 2021. "Strong Algorithms for the Ordinal Matroid Secretary Problem," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 642-673, May.
  13. Daniel Cownden & David Steinsaltz, 2014. "Effects of Competition in a Secretary Problem," Operations Research, INFORMS, vol. 62(1), pages 104-113, February.
  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. J. M. Grau Ribas, 2019. "A new look at the returning secretary problem," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1216-1236, May.
  16. 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.
  17. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.
  18. 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.
  19. 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.
  20. 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.
  21. Demers, Simon, 2021. "Expected duration of the no-information minimum rank problem," Statistics & Probability Letters, Elsevier, vol. 168(C).
  22. A. Sadoghi & J. Vecer, 2015. "Optimum Liquidation Problem Associated with the Poisson Cluster Process," Papers 1507.06514, arXiv.org, revised Dec 2015.
  23. 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.
  24. 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.
  25. 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.
  26. Niv Buchbinder & Kamal Jain & Mohit Singh, 2014. "Secretary Problems via Linear Programming," Mathematics of Operations Research, INFORMS, vol. 39(1), pages 190-206, February.
  27. Sadoghi, Amirhossein & Vecer, Jan, 2022. "Optimal liquidation problem in illiquid markets," European Journal of Operational Research, Elsevier, vol. 296(3), pages 1050-1066.
  28. 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.
  29. Amirhossein Sadoghi & Jan Vecer, 2022. "Optimal liquidation problem in illiquid markets," Post-Print hal-03696768, HAL.
  30. 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.
  31. 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.
  32. Dawsen Hwang & Patrick Jaillet & Vahideh Manshadi, 2021. "Online Resource Allocation Under Partially Predictable Demand," Operations Research, INFORMS, vol. 69(3), pages 895-915, May.
  33. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.