IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v51y2003i6p908-921.html
   My bibliography  Save this article

Resource Allocation Among Simulation Time Steps

Author

Listed:
  • Paul Glasserman

    (Graduate School of Business, Columbia University, New York, New York 10027)

  • Jeremy Staum

    (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208)

Abstract

Motivated by the problem of efficient estimation of expected cumulative rewards or cashflows, this paper proposes and analyzes a variance reduction technique for estimating the expectation of the sum of sequentially simulated random variables. In some applications, simulation effort is of greater value when applied to early time steps rather than shared equally among all time steps; this occurs, for example, when discounting renders immediate rewards or cashflows more important than those in the future. This suggests that deliberately stopping some paths early may improve efficiency. We formulate and solve the problem of optimal allocation of resources to time horizons with the objective of minimizing variance subject to a cost constraint. The solution has a simple characterization in terms of the convex hull of points defined by the covariance matrix of the cashflows. We also develop two ways to enhance variance reduction through early stopping. One takes advantage of the statistical theory of missing data. The other redistributes the cumulative sum to make optimal use of early stopping.

Suggested Citation

  • Paul Glasserman & Jeremy Staum, 2003. "Resource Allocation Among Simulation Time Steps," Operations Research, INFORMS, vol. 51(6), pages 908-921, December.
  • Handle: RePEc:inm:oropre:v:51:y:2003:i:6:p:908-921
    DOI: 10.1287/opre.51.6.908.24922
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.51.6.908.24922
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.51.6.908.24922?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Awi Federgruen & Yu-Sheng Zheng, 1992. "The Joint Replenishment Problem with General Joint Cost Structures," Operations Research, INFORMS, vol. 40(2), pages 384-403, April.
    2. Bennett L. Fox & Peter W. Glynn, 1989. "Simulating Discounted Costs," Management Science, INFORMS, vol. 35(11), pages 1297-1315, November.
    3. William L. Maxwell & John A. Muckstadt, 1985. "Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems," Operations Research, INFORMS, vol. 33(6), pages 1316-1341, December.
    4. Michael Curran, 1994. "Valuing Asian and Portfolio Options by Conditioning on the Geometric Mean Price," Management Science, INFORMS, vol. 40(12), pages 1705-1711, 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. Nabil Kahale, 2023. "Simulating Gaussian vectors via randomized dimension reduction and PCA," Papers 2304.07377, arXiv.org.
    2. Cui, Zhenyu & Lee, Chihoon & Zhu, Lingjiong & Zhu, Yunfan, 2021. "Non-convex isotonic regression via the Myersonian approach," Statistics & Probability Letters, Elsevier, vol. 179(C).
    3. Cui, Zhenyu & Fu, Michael C. & Peng, Yijie & Zhu, Lingjiong, 2020. "Optimal unbiased estimation for expected cumulative discounted cost," European Journal of Operational Research, Elsevier, vol. 286(2), pages 604-618.

    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. Li, Xiuhui & Wang, Qinan, 2007. "Coordination mechanisms of supply chain systems," European Journal of Operational Research, Elsevier, vol. 179(1), pages 1-16, May.
    2. Ian R. Webb & Bruce R. Buzby & Gerard M. Campbell, 1997. "Cyclical schedules for the joint replenishment problem with dynamic demands," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 577-589, September.
    3. Julien Bramel & Shobhna Goyal & Paul Zipkin, 2000. "Coordination of Production/Distribution Networks with Unbalanced Leadtimes," Operations Research, INFORMS, vol. 48(4), pages 570-577, August.
    4. Jean-Yves Datey & Genevieve Gauthier & Jean-Guy Simonato, 2003. "The Performance of Analytical Approximations for the Computation of Asian Quanto-Basket Option Prices," Multinational Finance Journal, Multinational Finance Journal, vol. 7(1-2), pages 55-82, March-Jun.
    5. Simai He & Jay Sethuraman & Xuan Wang & Jiawei Zhang, 2017. "A NonCooperative Approach to Cost Allocation in Joint Replenishment," Operations Research, INFORMS, vol. 65(6), pages 1562-1573, December.
    6. Zhang, Wei & Rajaram, Kumar, 2017. "Managing limited retail space for basic products: Space sharing vs. space dedication," European Journal of Operational Research, Elsevier, vol. 263(3), pages 768-781.
    7. Padilla Tinoco, Silvia Valeria & Creemers, Stefan & Boute, Robert N., 2017. "Collaborative shipping under different cost-sharing agreements," European Journal of Operational Research, Elsevier, vol. 263(3), pages 827-837.
    8. Kevin H. Shang & Jing-Sheng Song & Paul H. Zipkin, 2009. "Coordination Mechanisms in Decentralized Serial Inventory Systems with Batch Ordering," Management Science, INFORMS, vol. 55(4), pages 685-695, April.
    9. Luca Bertazzi & Maria Grazia Speranza, 1999. "Minimizing logistic costs in multistage supply chains," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 399-417, June.
    10. Kirkby, J. Lars & Nguyen, Duy, 2021. "Equity-linked Guaranteed Minimum Death Benefits with dollar cost averaging," Insurance: Mathematics and Economics, Elsevier, vol. 100(C), pages 408-428.
    11. Jacob Lundgren & Yuri Shpolyanskiy, 2017. "Approaches to Asian Option Pricing with Discrete Dividends," Papers 1702.00994, arXiv.org, revised Mar 2021.
    12. Adeinat, Hamza & Pazhani, Subramanian & Mendoza, Abraham & Ventura, Jose A., 2022. "Coordination of pricing and inventory replenishment decisions in a supply chain with multiple geographically dispersed retailers," International Journal of Production Economics, Elsevier, vol. 248(C).
    13. Griselda Deelstra & Jan Liinev & Michèle Vanmaele, 2004. "Pricing of arithmetic basket options by conditioning," ULB Institutional Repository 2013/7600, ULB -- Universite Libre de Bruxelles.
    14. Runhuan Feng & Hans W. Volkmer, 2015. "Conditional Asian Options," Papers 1505.06946, arXiv.org.
    15. Stephen E. Chick & Noah Gans, 2009. "Economic Analysis of Simulation Selection Problems," Management Science, INFORMS, vol. 55(3), pages 421-437, March.
    16. Xu, Guoping & Zheng, Harry, 2010. "Basket options valuation for a local volatility jump-diffusion model with the asymptotic expansion method," Insurance: Mathematics and Economics, Elsevier, vol. 47(3), pages 415-422, December.
    17. Dan Pirjol & Lingjiong Zhu, 2023. "Sensitivities of Asian options in the Black-Scholes model," Papers 2301.06460, arXiv.org.
    18. Luca Bertazzi & Maria Grazia Speranza & Walter Ukovich, 2000. "Exact and Heuristic Solutions for a Shipment Problem with Given Frequencies," Management Science, INFORMS, vol. 46(7), pages 973-988, July.
    19. Don M. Chance & Eric Hillebrand & Jimmy E. Hilliard, 2008. "Pricing an Option on Revenue from an Innovation: An Application to Movie Box Office Revenue," Management Science, INFORMS, vol. 54(5), pages 1015-1028, May.
    20. David B. Brown & James E. Smith, 2013. "Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats," Operations Research, INFORMS, vol. 61(3), pages 644-665, June.

    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:inm:oropre:v:51:y:2003:i:6:p:908-921. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.