Conference paper Open Access

Aspiration-based Perturbed Learning Automata

Chasparis, Georgios

This paper introduces a novel payoff-based learning scheme for distributed optimization in repeatedly-played strategic-form games. Standard reinforcement-based learning exhibits several limitations with respect to their asymptotic stability. For example, in two-player coordination games, payoff-dominant (or efficient) Nash equilibria may not be stochastically stable. In this work, we present an extension of perturbed learning automata, namely aspiration-based perturbed learning automata (APLA) that overcomes these limitations. We provide a stochastic stability analysis in multi-player coordination games. In the case of two-player coordination games, we show that the payoff-dominant Nash equilibrium is the unique stochastically stable state.

Files (307.3 kB)
Name Size
2017_ECC18_AspirationBasedReinforcementLearning_final.pdf
md5:81a328c1ef9fe40cc1354e22b059b085
307.3 kB Download
8
15
views
downloads
All versions This version
Views 88
Downloads 1515
Data volume 4.6 MB4.6 MB
Unique views 88
Unique downloads 1515

Share

Cite as