论文信息 - Stochastic Games for Cooperative Network Routing and Epidemic Spread - 字舞流文

Stochastic Games for Cooperative Network Routing and Epidemic Spread

We study a cooperative game in networks with several information sources and one destination. Some providers share the same network and control the routing in disjoint sets of nodes. We use a stochastic game model.

Laura Cottatellucci | Konstantin Avrachenkov | Lorenzo Maggi | L. Cottatellucci | L. Maggi | Konstantin Avrachenkov

[1] K. Knopp. Theory and Application of Infinite Series , 1990 .

[2] T. E. S. Raghavan,et al. A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information , 2003, Math. Program..

[3] Roger B. Myerson,et al. Game theory - Analysis of Conflict , 1991 .

[4] Rommert Dekker,et al. Sensitivity-analysis in discounted Markovian decision problems , 1985 .

[5] Laura Cottatellucci,et al. Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information , 2012, Oper. Res. Lett..

[6] T. Roughgarden. Algorithmic Game Theory: Routing Games , 2007 .

[7] J. Filar,et al. Competitive Markov Decision Processes , 1996 .