DocumentCode :
2422646
Title :
Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation
Author :
Marden, Jason R. ; Shamma, Jeff S.
Author_Institution :
Dept. of Electr., Comput., & Energy Eng., Univ. of Colorado at Boulder, Boulder, CO, USA
fYear :
2010
fDate :
Sept. 29 2010-Oct. 1 2010
Firstpage :
1171
Lastpage :
1172
Abstract :
The theory of learning in games has sought to understand how and why equilibria emerge in non-cooperative games. Traditionally, social science literature develops descriptive game theoretic models for players, analyzes the limiting behavior, and generalizes the results for larger classes of games. Recently, there has been a significant amount of research seeking to understand these behavioral models not from a descriptive point of view, but rather from a prescriptive point of view. The goal is to use these behavioral models as a prescriptive control approach in distributed multi-agent systems where the guaranteed limiting behavior would represent a desirable operating condition.
Keywords :
distributed control; game theory; iterative methods; learning systems; Nash equilibrium; asynchrony; distributed control; distributed multiagent systems; game theoretic approach; iterative learning algorithm; log-linear learning; noncooperative games; potential games; prescriptive control; utility function; weakly acyclic games; Economics; Games; Joints; Limiting; Multiagent systems; Nash equilibrium; Noise;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on
Conference_Location :
Allerton, IL
Print_ISBN :
978-1-4244-8215-3
Type :
conf
DOI :
10.1109/ALLERTON.2010.5707044
Filename :
5707044
Link To Document :
بازگشت