论文信息 - Algorithms for Informed Cows

Algorithms for Informed Cows

We extend the classic on-line search problem known as the cow-path problem to the case in which goal locations are selected according to one of a set of possible known probability distributions. We present a polynomial-time linear-programming algorithm for this problem.

Ming-Yang Kao | Michael L. Littman | M. Littman | M. Kao

[1] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[2] Leon A. Petrosyan,et al. Game Theory (Second Edition) , 1996 .

[3] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.

[4] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.

[5] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[6] John N. Tsitsiklis,et al. The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[7] Ming-Yang Kao,et al. Optimal constructions of hybrid algorithms , 1994, SODA '94.

[8] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..

[9] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.

[10] Ming-Yang Kao,et al. Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[11] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[12] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.