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

A new algorithm for the multi-item exponentially discounted optimal selection problem

Author

Listed:
  • David, Israel
  • Levi, Ofer

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:153:y:2004:i:3:p:782-789
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00809-3
    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. J. MacQueen & R. G. Miller, 1960. "Optimal Persistence Policies," Operations Research, INFORMS, vol. 8(3), pages 362-380, June.
    2. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    3. Saario, Vesa, 1985. "Limiting properties of the discounted house-selling problem," European Journal of Operational Research, Elsevier, vol. 20(2), pages 206-210, May.
    4. 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.
    5. S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
    6. David, Israel, 1998. "Explicit results for a class of asset-selling problems," European Journal of Operational Research, Elsevier, vol. 110(3), pages 576-584, November.
    7. Toru Nakai, 1986. "A Sequential Stochastic Assignment Problem in a Partially Observable Markov Chain," Mathematics of Operations Research, INFORMS, vol. 11(2), pages 230-240, May.
    8. D. P. Kennedy, 1986. "Optimal Sequential Assignment," Mathematics of Operations Research, INFORMS, vol. 11(4), pages 619-626, November.
    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. 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. Deutsch, Yael & David, Israel, 2021. "Promoting assets selling through advertisement channels," Applied Mathematics and Computation, Elsevier, vol. 395(C).

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Anton J. Kleywegt & Jason D. Papastavrou, 1998. "The Dynamic and Stochastic Knapsack Problem," Operations Research, INFORMS, vol. 46(1), pages 17-35, February.
    10. Georgy Sofronov, 2020. "An Optimal Decision Rule for a Multiple Selling Problem with a Variable Rate of Offers," Mathematics, MDPI, vol. 8(5), pages 1-11, May.
    11. 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.
    12. 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.
    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. Georgy Yu. Sofronov, 2020. "An Optimal Double Stopping Rule for a Buying-Selling Problem," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 1-12, March.
    15. 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.
    16. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    17. 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.
    18. 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.
    19. Deutsch, Yael & David, Israel, 2021. "Promoting assets selling through advertisement channels," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    20. 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.

    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:153:y:2004:i:3:p:782-789. 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.