Subject: Learning automata, distributed optimization, stochastic stability | Computer Science - Computer Science and Game Theory
This paper considers a class of reinforcement-based learning (namely, perturbed learning automata) and provides a stochastic-stability analysis in repeatedly-played, positive-utility, finite strategic-form games. Prior work in this class of learning dynamics primarily a... View more
 G. C. Chasparis, “Stochastic stability analysis of perturbed learning automata with constant step-size in strategic-form games,” in American Control Conference, Seattle, USA, 2017, pp. 4607-4612.
 B. G. Chun, R. Fonseca, I. Stoica, and J. Kubiatowicz, “Characterizing selfishly constructed overlay routing networks,” in Proc. of IEEE INFOCOM 04, Hong-Kong, 2004.
 R. Komali, A. B. MacKenzie, and R. P. Gilles, “Effect of selfish node behavior on efficient topology design,” IEEE Transactions on Mobile Computing, vol. 7, no. 9, pp. 1057-1070, 2008.
 G. Wei, A. V. Vasilakos, Y. Zheng, and N. Xiong, “A game-theoretic method of fair resource allocation for cloud computing services,” The Journal of Supercomputing, vol. 54, no. 2, pp. 252-269, Nov. 2010.
 W. B. Arthur, “On designing economic agents that behave like human agents,” J. Evolutionary Econ., vol. 3, pp. 1-22, 1993.
 T. Bo¨rgers and R. Sarin, “Learning through reinforcement and replicator dynamics,” J. Econ. Theory, vol. 77, no. 1, pp. 1-14, 1997.
 I. Erev and A. Roth, “Predicting how people play games: reinforcement learning in experimental games with unique, mixed strategy equilibria,” Amer. Econ. Rev., vol. 88, pp. 848-881, 1998.
 E. Hopkins and M. Posch, “Attainability of boundary points under reinforcement learning,” Games Econ. Behav., vol. 53, pp. 110-125, 2005.
 A. Beggs, “On the convergence of reinforcement learning,” J. Econ. Theory, vol. 122, pp. 1-36, 2005.
 M. Thathachar and P. Sastry, Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers, 2004.