Stochastic optimization of service provision with selfish users

作者: F. Altarelli , A. Braunstein , C.F. Chiasserini , L. Dall'Asta , P. Giaccone

DOI: 10.1109/ICCW.2013.6649459

关键词:

摘要: We develop a computationally efficient technique to solve fairly general distributed service provision problem with selfish users and imperfect information. In particular, in context which the capacity of existing infrastructure can be partially adapted user load by activating just some units, we aim at finding configuration active units that achieves best trade-off between maintenance (e.g. energetic) costs for provider satisfaction. The core our resides implementation belief-propagation (BP) algorithm evaluate cost configurations. Numerical results confirm effectiveness approach.

参考文章(12)
Evdokia Nikolova, Nicolas E. Stier-Moses, Stochastic selfish routing algorithmic game theory. pp. 314- 325 ,(2011) , 10.1007/978-3-642-24829-0_28
Elias Koutsoupias, Christos Papadimitriou, Worst-case equilibria symposium on theoretical aspects of computer science. pp. 404- 413 ,(1999) , 10.1007/3-540-49116-3_38
F. Altarelli, A. Braunstein, A. Ramezanpour, R. Zecchina, Stochastic Matching Problem Physical Review Letters. ,vol. 106, pp. 190601- 190601 ,(2011) , 10.1103/PHYSREVLETT.106.190601
Eyal Even-Dar, Alex Kesselman, Yishay Mansour, Convergence time to Nash equilibria international colloquium on automata languages and programming. pp. 502- 513 ,(2003) , 10.1007/3-540-45061-0_41
Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis, The Structure and Complexity of Nash Equilibria for a Selfish Routing Game international colloquium on automata languages and programming. pp. 123- 134 ,(2002) , 10.1007/3-540-45465-9_12
A. Goel, P. Indyk, Stochastic load balancing and related problems foundations of computer science. pp. 579- 586 ,(1999) , 10.1109/SFFCS.1999.814632
Tommaso Toffoli, Physics and computation International Journal of Theoretical Physics. ,vol. 21, pp. 165- 175 ,(1982) , 10.1007/BF01857724
Jon Kleinberg, Yuval Rabani, Éva Tardos, Allocating bandwidth for bursty connections symposium on the theory of computing. pp. 664- 673 ,(1997) , 10.1145/258533.258661
Robert W. Rosenthal, A class of games possessing pure-strategy Nash equilibria International Journal of Game Theory. ,vol. 2, pp. 65- 67 ,(1973) , 10.1007/BF01737559