Information collection on a graph

Operations Research

Volumn 59, Issue 1, 2011, Pages 188-201

  Ryzhov, Ilya O ^a   Powell, Warren B ^a  

^a Princeton University   (United States)

Author keywords

Bayesian learning; Knowledge gradient; Optimal learning; Ranking and selection; Stochastic shortest paths

Indexed keywords

BAYESIAN LEARNING; KNOWLEDGE GRADIENT; OPTIMAL LEARNING; RANKING AND SELECTION; STOCHASTIC SHORTEST PATHS;

BAYESIAN NETWORKS; OPTIMIZATION; STOCHASTIC SYSTEMS;

GRAPH THEORY;

EID: 79952942276     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1100.0873     Document Type: Article

References (36)

1. Barabási, A. L., R. Albert. 1999. Emergence of scaling in random networks. Science 286(5439) 509-512.
2. Bechhofer, R. E., T. J. Santner, D. M. Goldsman. 1995. Design and Analysis of Experiments for Statistical Selection, Screening and Multiple Comparisons. John Wiley & Sons, New York.
3. Bernardo, J. M., A. F. M. Smith. 1994. Bayesian Theory. John Wiley & Sons, New York.
4. Branke, J., S. E. Chick, C. Schmidt. 2007. Selecting a selection procedure. Management Sci. 53(12) 1916-1932. (Pubitemid 351159563)
5. Chick, S., N. Gans. 2009. Economic analysis of simulation selection options. Management Sci. 55(3) 421-437.
6. Chick, S. E., P. I. Frazier. 2009. The conjunction of the knowledge gradient and the economic approach to simulation selection. M. D. Rosetti, R. R. Hill, B. Johansson, A. Dunkin, R. G. Ingalls, eds. Proc. 2009 Winter Simulation Conf., IEEE, Austin, TX, 528-539.
7. Chick, S. E., K. Inoue. 2001a. New procedures to select the best simulated system using common random numbers. Management Sci. 47(8) 1133-1149. (Pubitemid 34192811)
8. Chick, S. E., K. Inoue. 2001b. New two-stage and sequential procedures for selecting the best simulated system. Oper. Res. 49(5) 732-743. (Pubitemid 34011324)
9. Chick, S. E., J. Branke, C. Schmidt. 2010. Sequential sampling to myopically maximize the expected value of information. INFORMS J. Comput. 22(1) 71-80.
10. Dearden, R., N. Friedman, S. Russell. 1998. Bayesian Q-learning. Proc. Fifteenth National Conf. Artificial Intelligence (AAAI-98). AAAI Press/MIT Press, Cambridge, MA.
11. DeGroot, M. H. 1970. Optimal Statistical Decisions. John Wiley & Sons, New York.
12. Duff, M. O., A. G. Barto. 1996. Local bandit approximation for optimal learning problems. Advances in Neural Information Processing Systems, Vol. 9. MIT Press, Cambridge, MA, 1019-1025.
13. Erdo's, P., A. Renyi. 1959. On random graphs. Publicationes Mathematicae 6 290-297.
14. Fan, Y. Y., R. E. Kalaba, J. E. Moore. 2005. Shortest paths in stochastic networks with correlated link costs. Comput. Math. Appl. 49(9-10) 1549-1564. (Pubitemid 41101303)
15. Frazier, P. I., W. B. Powell. 2011. Consistency of sequential Bayesian sampling policies. SIAM J. Control Optim. Forthcoming.
16. Frazier, P. I., W. B. Powell, S. Dayanik. 2008. A knowledge gradient policy for sequential information collection. SIAM J. Control Optim. 47(5) 2410-2439.
17. Frazier, P. I., W. B. Powell, S. Dayanik. 2009. The knowledge-gradient policy for correlated normal rewards. INFORMS J. Comput. 21(4) 599-613.
18. Frieze, A., G. Grimmett. 1985. The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10(1) 57-77. (Pubitemid 15475455)
19. Gelman, A. B., J. B. Carlin, H. S. Stern, D. B. Rubin. 2004. Bayesian Data Analysis, 2nd ed. CRC Press, Boca Raton, FL.
20. Gilbert, E. N. 1959. Random graphs. Ann. Math. Statist. 30(4) 1141-1144.
21. Gittins, J. C. 1989. Multi-Armed Bandit Allocation Indices. John Wiley & Sons, New York.
22. Goldsman, D. 1983. Ranking and selection in simulation. Proc. 15th Conf. Winter Simulation, Vol. 2. IEEE Press, Piscataway, NJ, 387-394.
23. Gupta, S. S., K. J. Miescke. 1996. Bayesian look ahead one-stage sampling allocations for selection of the best population. J. Statist. Planning Inference 54(2) 229-244. (Pubitemid 126161097)
24. Hoff, P. D. 2009. A First Course in Bayesian Statistical Methods. Springer- Verlag, New York.
25. Inoue, K., S. E. Chick, C. Chen. 1999. An empirical evaluation of several methods to select the best system. ACM Trans. Model. Comput. Simulation (TOMACS) 9(4) 381-407.
26. Kim, S. H., B. L. Nelson. 2006. Selecting the best system. S. G. Henderson, B. L. Nelson, eds. Simulation. Handbooks in Operations Research and Management Science, Vol. 13. North-Holland Publishing Company, Amsterdam, 501-534.
27. Kim, S. H., B. L. Nelson. 2007. Recent advances in ranking and selection. Proc. 39th Conf. Winter Simulation. IEEE Press, Piscataway, NJ, 162-172.
28. Kulkarni, V. G. 1986. Shortest paths in networks with exponentially distributed arc lengths. Networks 16(3) 255-274. (Pubitemid 18633397)
29. Law, A. M., W. D. Kelton. 1991. Simulation Modeling and Analysis, 2nd ed. McGraw-Hill, Inc., New York.
30. Lukacs, E. 1942. A characterization of the normal distribution. Ann. Math. Statist. 13(1) 91-93.
31. Peer, S. K., D. K. Sharma. 2007. Finding the shortest path in stochastic networks. Comput. Math. Appl. 53(5) 729-740. (Pubitemid 46726975)
32. Ryzhov, I. O., W. B. Powell. 2009. The knowledge gradient algorithm for online subset selection. Proc. 2009 IEEE Sympos. Adaptive Dynamic Programming and Reinforcement Learn., Nashville, TN, 137-144.
33. Ryzhov, I. O., W. B. Powell, P. I. Frazier. 2011. The knowledge gradient algorithm for a general class of online learning problems. Submitted for publication.
34. Schmeiser, B. 1982. Batch size effects in the analysis of simulation output. Oper. Res. 30(3) 556-568. (Pubitemid 12553644)
35. Snyder, T. L., J. M. Steele. 1995. Probabilistic networks and network algorithms. M. Ball, T. Magnanti, C. Monma, eds. Networks. Handbooks in Operations Research and Management Science, Vol. 7. North- Holland Publishing Company, Amsterdam, 401-424.
36. Watkins, C. J. C. H., P. Dayan. 1992. Q-Learning. Machine Learn. 8(3) 279-292.