IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v18y1972i7p349-355.html
   My bibliography  Save this item

A Sequential Stochastic Assignment Problem

Citations

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


Cited by:

  1. David T. Wu & Sheldon M. Ross, 2015. "A stochastic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(1), pages 23-31, February.
  2. Chun, Young H. & Sumichrast, Robert T., 2006. "A rank-based approach to the sequential selection and assignment problem," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1338-1344, October.
  3. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
  4. Adrian Lee & Sheldon Jacobson, 2011. "Sequential stochastic assignment under uncertainty: estimation and convergence," Statistical Inference for Stochastic Processes, Springer, vol. 14(1), pages 21-46, February.
  5. Yael Deutsch & Israel David, 2020. "Benchmark policies for utility-carrying queues with impatience," Queueing Systems: Theory and Applications, Springer, vol. 95(1), pages 97-120, June.
  6. Grace Y. Lin & Yingdong Lu & David D. Yao, 2008. "The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing," Operations Research, INFORMS, vol. 56(4), pages 945-957, August.
  7. Xuhan Tian & Junmin (Jim) Shi & Xiangtong Qi, 2022. "Stochastic Sequential Allocations for Creative Crowdsourcing," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 697-714, February.
  8. Pancs, Romans, 2013. "Sequential negotiations with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 82(C), pages 522-543.
  9. Meghan Shanks & Ge Yu & Sheldon H. Jacobson, 2023. "Approximation algorithms for stochastic online matching with reusable resources," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 98(1), pages 43-56, August.
  10. Michael Katehakis & Ingram Olkin & Sheldon Ross & Jian Yang, 2013. "On the life and work of Cyrus Derman," Annals of Operations Research, Springer, vol. 208(1), pages 5-26, September.
  11. Hak Chun, Young, 1996. "Selecting the best choice in the weighted secretary problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 135-147, July.
  12. 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.
  13. David, Israel & Levi, Ofer, 2001. "Asset-selling problems with holding costs," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 317-321, May.
  14. Alexander G. Nikolaev & Sheldon H. Jacobson, 2010. "Technical Note ---Stochastic Sequential Decision-Making with a Random Number of Jobs," Operations Research, INFORMS, vol. 58(4-part-1), pages 1023-1027, August.
  15. Deutsch, Yael & David, Israel, 2021. "Promoting assets selling through advertisement channels," Applied Mathematics and Computation, Elsevier, vol. 395(C).
  16. Yizhaq Minchuk & Aner Sela, 2018. "Asymmetric sequential search under incomplete information," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 27(2), pages 315-325, June.
  17. Arieh Gavious & Ella Segev, 2017. "Price Discrimination Based on Buyers’ Purchase History," Dynamic Games and Applications, Springer, vol. 7(2), pages 229-265, June.
  18. David Bergman & Jason Imbrogno, 2017. "Surviving a National Football League Survivor Pool," Operations Research, INFORMS, vol. 65(5), pages 1343-1354, October.
  19. 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.
  20. 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.
  21. Baris Ata & Yichuan Ding & Stefanos Zenios, 2021. "An Achievable-Region-Based Approach for Kidney Allocation Policy Design with Endogenous Patient Choice," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 36-54, 1-2.
  22. Kannan Viswanath & James Ward, 2010. "Stochastic Location-assignment on an Interval with Sequential Arrivals," Networks and Spatial Economics, Springer, vol. 10(3), pages 389-410, September.
  23. David, Israel & Levi, Ofer, 2004. "A new algorithm for the multi-item exponentially discounted optimal selection problem," European Journal of Operational Research, Elsevier, vol. 153(3), pages 782-789, March.
  24. Járai, Antal A., 2022. "Asymptotics of the optimum in discrete sequential assignment," Stochastic Processes and their Applications, Elsevier, vol. 148(C), pages 267-277.
  25. C G Lennon & J M McGowan & K Y Lin, 2008. "A game-theoretic model for repeated assignment problem between two selfish agents," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1652-1658, December.
  26. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
  27. 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.
  28. 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.
  29. Gershkov, Alex & Moldovanu, Benny, 2013. "Non-Bayesian optimal search and dynamic implementation," Economics Letters, Elsevier, vol. 118(1), pages 121-125.
  30. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
  31. Stefanos A. Zenios & Glenn M. Chertow & Lawrence M. Wein, 2000. "Dynamic Allocation of Kidneys to Candidates on the Transplant Waiting List," Operations Research, INFORMS, vol. 48(4), pages 549-569, August.
  32. Sheldon Ross & David Wu, 2013. "A generalized coupon collecting model as a parsimonious optimal stochastic assignment model," Annals of Operations Research, Springer, vol. 208(1), pages 133-146, September.
  33. Laura A. McLay & Adrian J. Lee & Sheldon H. Jacobson, 2010. "Risk-Based Policies for Airport Security Checkpoint Screening," Transportation Science, INFORMS, vol. 44(3), pages 333-349, August.
  34. Francis Bloch & Nicolas Houy, 2012. "Optimal assignment of durable objects to successive agents," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(1), pages 13-33, September.
  35. Alexander G. Nikolaev & Sheldon H. Jacobson & Laura A. McLay, 2007. "A Sequential Stochastic Security System Design Problem for Aviation Security," Transportation Science, INFORMS, vol. 41(2), pages 182-194, May.
  36. Jorge A. Sefair & J. Cole Smith, 2017. "Exact algorithms and bounds for the dynamic assignment interdiction problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(5), pages 373-387, August.
  37. Rebecca Dizon-Ross & Sheldon M. Ross, 2020. "Dynamic search models with multiple items," Annals of Operations Research, Springer, vol. 288(1), pages 223-245, May.
  38. 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.
  39. Richard G. Anderson & Suresh K. Nair, 2005. "A specialized inventory problem in banks: optimizing retail sweeps," Working Papers 2005-023, Federal Reserve Bank of St. Louis.
  40. Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
  41. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
  42. Anton J. Kleywegt & Jason D. Papastavrou, 2001. "The Dynamic and Stochastic Knapsack Problem with Random Sized Items," Operations Research, INFORMS, vol. 49(1), pages 26-41, February.
  43. Xuanming Su & Stefanos A. Zenios, 2005. "Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model," Operations Research, INFORMS, vol. 53(3), pages 443-455, June.
  44. Benny Moldovanu & Alex Gershkov, 2008. "The Trade-off Between Fast Learning and Dynamic Efficiency," 2008 Meeting Papers 348, Society for Economic Dynamics.
  45. Sheldon M. Ross & Gideon Weiss & Zhengyu Zhang, 2021. "Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities," Operations Research, INFORMS, vol. 69(1), pages 266-272, January.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.