IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v59y2011i1p188-201.html

Information Collection on a Graph

Author

Listed:
  • Ilya O. Ryzhov

    (Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08540)

  • Warren B. Powell

    (Department of Operations Research and Financial Engineering, Princeton University, Princeton, New Jersey 08540)

Abstract

We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values in order to learn about the best path. This problem differs from traditional ranking and selection in that the implementation decision (the path we choose) is distinct from the measurement decision (the edge we measure). Our decision rule is easy to compute and performs competitively against other learning policies, including a Monte Carlo adaptation of the knowledge gradient policy for ranking and selection.

Suggested Citation

  • Ilya O. Ryzhov & Warren B. Powell, 2011. "Information Collection on a Graph," Operations Research, INFORMS, vol. 59(1), pages 188-201, February.
    • Handle: RePEc:inm:oropre:v:59:y:2011:i:1:p:188-201
    DOI: 10.1287/opre.1100.0873
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1100.0873
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1100.0873?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. Peter Frazier & Warren Powell & Savas Dayanik, 2009. "The Knowledge-Gradient Policy for Correlated Normal Beliefs," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 599-613, November.
    2. Stephen E. Chick & Noah Gans, 2009. "Economic Analysis of Simulation Selection Problems," Management Science, INFORMS, vol. 55(3), pages 421-437, March.
    3. Stephen E. Chick & Koichiro Inoue, 2001. "New Procedures to Select the Best Simulated System Using Common Random Numbers," Management Science, INFORMS, vol. 47(8), pages 1133-1149, August.
    4. Stephen E. Chick & Jürgen Branke & Christian Schmidt, 2010. "Sequential Sampling to Myopically Maximize the Expected Value of Information," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 71-80, February.
    5. Bruce Schmeiser, 1982. "Batch Size Effects in the Analysis of Simulation Output," Operations Research, INFORMS, vol. 30(3), pages 556-568, June.
    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. Tomás Lagos & Ramón Auad & Felipe Lagos, 2025. "The Online Shortest Path Problem: Learning Travel Times Using a Multiarmed Bandit Framework," Transportation Science, INFORMS, vol. 59(1), pages 28-59, January.
    2. William N. Caballero & Phillip R. Jenkins & David Banks & Matthew Robbins, 2026. "Bayesian Graph Traversal," Decision Analysis, INFORMS, vol. 23(1), pages 11-27, March.
    3. Daniel R. Jiang & Warren B. Powell, 2018. "Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures," Mathematics of Operations Research, INFORMS, vol. 43(2), pages 554-579, May.
    4. Ilya O. Ryzhov, 2016. "On the Convergence Rates of Expected Improvement Methods," Operations Research, INFORMS, vol. 64(6), pages 1515-1528, December.
    5. Susan Jia Xu & Mehdi Nourinejad & Xuebo Lai & Joseph Y. J. Chow, 2018. "Network Learning via Multiagent Inverse Transportation Problems," Service Science, INFORMS, vol. 52(6), pages 1347-1364, December.
    6. Melih Çelik & Özlem Ergun & Pınar Keskinocak, 2015. "The Post-Disaster Debris Clearance Problem Under Incomplete Information," Operations Research, INFORMS, vol. 63(1), pages 65-85, February.
    7. Ilya O. Ryzhov & Warren B. Powell & Peter I. Frazier, 2012. "The Knowledge Gradient Algorithm for a General Class of Online Learning Problems," Operations Research, INFORMS, vol. 60(1), pages 180-195, February.
    8. Boris Defourny & Ilya O. Ryzhov & Warren B. Powell, 2015. "Optimal Information Blending with Measurements in the L 2 Sphere," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1060-1088, October.
    9. Borrero, Juan S. & Sauré, Denis & Trigo, Natalia, 2025. "Optimal sequential stochastic shortest path interdiction," European Journal of Operational Research, Elsevier, vol. 326(3), pages 641-655.

    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. Stephen E. Chick & Noah Gans & Özge Yapar, 2022. "Bayesian Sequential Learning for Clinical Trials of Multiple Correlated Medical Interventions," Management Science, INFORMS, vol. 68(7), pages 4919-4938, July.
    2. Jing Xie & Peter I. Frazier, 2013. "Sequential Bayes-Optimal Policies for Multiple Comparisons with a Known Standard," Operations Research, INFORMS, vol. 61(5), pages 1174-1189, October.
    3. Powell, Warren B., 2019. "A unified framework for stochastic optimization," European Journal of Operational Research, Elsevier, vol. 275(3), pages 795-821.
    4. Eric M. Schwartz & Eric T. Bradlow & Peter S. Fader, 2017. "Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments," Marketing Science, INFORMS, vol. 36(4), pages 500-522, July.
    5. Diana M. Negoescu & Peter I. Frazier & Warren B. Powell, 2011. "The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 346-363, August.
    6. Ilya O. Ryzhov & Warren B. Powell & Peter I. Frazier, 2012. "The Knowledge Gradient Algorithm for a General Class of Online Learning Problems," Operations Research, INFORMS, vol. 60(1), pages 180-195, February.
    7. David J. Eckman & Shane G. Henderson, 2022. "Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1711-1728, May.
    8. Yuhang Wu & Zeyu Zheng & Guangyu Zhang & Zuohua Zhang & Chu Wang, 2025. "Nonstationary A/B Tests: Optimal Variance Reduction, Bias Correction, and Valid Inference," Management Science, INFORMS, vol. 71(6), pages 4707-4727, June.
    9. Bin Han & Ilya O. Ryzhov & Boris Defourny, 2016. "Optimal Learning in Linear Regression with Combinatorial Feature Selection," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 721-735, November.
    10. Jack P. C. Kleijnen & Susan M. Sanchez & Thomas W. Lucas & Thomas M. Cioppa, 2005. "State-of-the-Art Review: A User’s Guide to the Brave New World of Designing Simulation Experiments," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 263-289, August.
    11. Weiwei Fan & L. Jeff Hong & Xiaowei Zhang, 2020. "Distributionally Robust Selection of the Best," Management Science, INFORMS, vol. 66(1), pages 190-208, January.
    12. Emre Barut & Warren Powell, 2014. "Optimal learning for sequential sampling with non-parametric beliefs," Journal of Global Optimization, Springer, vol. 58(3), pages 517-543, March.
    13. Daniel Russo, 2020. "Simple Bayesian Algorithms for Best-Arm Identification," Operations Research, INFORMS, vol. 68(6), pages 1625-1647, November.
    14. Peter I. Frazier & Warren B. Powell, 2010. "Paradoxes in Learning and the Marginal Value of Information," Decision Analysis, INFORMS, vol. 7(4), pages 378-403, December.
    15. Gongbo Zhang & Yijie Peng & Jianghua Zhang & Enlu Zhou, 2023. "Asymptotically Optimal Sampling Policy for Selecting Top- m Alternatives," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1261-1285, November.
    16. Bolong Cheng & Arta Jamshidi & Warren Powell, 2015. "Optimal learning with a local parametric belief model," Journal of Global Optimization, Springer, vol. 63(2), pages 401-425, October.
    17. Huashuai Qu & Ilya O. Ryzhov & Michael C. Fu & Zi Ding, 2015. "Sequential Selection with Unknown Correlation Structures," Operations Research, INFORMS, vol. 63(4), pages 931-948, August.
    18. Jason R. W. Merrick, 2009. "Bayesian Simulation and Decision Analysis: An Expository Survey," Decision Analysis, INFORMS, vol. 6(4), pages 222-238, December.
    19. Weiwei Chen & Siyang Gao & Wenjie Chen & Jianzhong Du, 2023. "Optimizing resource allocation in service systems via simulation: A Bayesian formulation," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 65-81, January.
    20. Somayeh Moazeni & Boris Defourny & Monika J. Wilczak, 2020. "Sequential Learning in Designing Marketing Campaigns for Market Entry," Management Science, INFORMS, vol. 66(9), pages 4226-4245, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:inm:oropre:v:59:y:2011:i:1:p:188-201. 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.