Game theory is a key analytical tool to design Demand-Side Management (DSM) systems, since it can be used to model the complex interactions among the independent actors of the smart grids. In this paper, we propose two learning algorithms to enable the players of game theoretic DSM frameworks to autonomously converge to the Nash equilibria of the game, and we evaluate their performance based on real instances of the problem.
(2014). Distributed learning algorithms for scheduling games in the future smart grid . Retrieved from http://hdl.handle.net/10446/106082
Distributed learning algorithms for scheduling games in the future smart grid
Barbato, Antimo;Martignon, Fabio;
2014-01-01
Abstract
Game theory is a key analytical tool to design Demand-Side Management (DSM) systems, since it can be used to model the complex interactions among the independent actors of the smart grids. In this paper, we propose two learning algorithms to enable the players of game theoretic DSM frameworks to autonomously converge to the Nash equilibria of the game, and we evaluate their performance based on real instances of the problem.File allegato/i alla scheda:
| File | Dimensione del file | Formato | |
|---|---|---|---|
|
NetGCoop2014.pdf
Solo gestori di archivio
Versione:
postprint - versione referata/accettata senza referaggio
Licenza:
Licenza default Aisberg
Dimensione del file
149.6 kB
Formato
Adobe PDF
|
149.6 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo
