PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishWe analyze Nash games played among leaders of Stackelberg games (NASP). We show it is $Sigma^p_2$-hard to decide if the game has a mixed-strategy Nash equilibrium (MNE), even when there are only two leaders and each leader has one follower. We provide a finite time algorithm with a running time bounded by $O(2^{2^n})$ which computes MNEs for NASP when it exists and returns infeasibility if no MNE exists. We also provide two ways to improve the algorithm which involves constructing a series of inner approximations (alternatively, outer approximations) to the leaders' feasible region that will provably obtain the required MNE. Finally, we test our algorithms on a range of NASPs arising out of a game in the energy market, where countries act as Stackelberg leaders who play a Nash game, and the domestic producers act as the followers.
When Nash Meets Stackelberg / Carvalho, Margarida; Dragotto, Gabriele; Feijoo, Felipe; Lodi, Andrea; Sankaranarayanan, Sriram. - ELETTRONICO. - (2019).
| Titolo: | When Nash Meets Stackelberg | |
| Autori: | ||
| Data di pubblicazione: | 2019 | |
| Citazione: | When Nash Meets Stackelberg / Carvalho, Margarida; Dragotto, Gabriele; Feijoo, Felipe; Lodi, Andrea; Sankaranarayanan, Sriram. - ELETTRONICO. - (2019). | |
| Abstract: | We analyze Nash games played among leaders of Stackelberg games (NASP). We show it is $Sigma^p_2$-hard to decide if the game has a mixed-strategy Nash equilibrium (MNE), even when there are only two leaders and each leader has one follower. We provide a finite time algorithm with a running time bounded by $O(2^{2^n})$ which computes MNEs for NASP when it exists and returns infeasibility if no MNE exists. We also provide two ways to improve the algorithm which involves constructing a series of inner approximations (alternatively, outer approximations) to the leaders' feasible region that will provably obtain the required MNE. Finally, we test our algorithms on a range of NASPs arising out of a game in the energy market, where countries act as Stackelberg leaders who play a Nash game, and the domestic producers act as the followers. | |
| Handle: | http://hdl.handle.net/11583/2858249 | |
| Appare nelle tipologie: | 5.15 Pubblicazione su portale |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| 1910.06452.pdf | Article | 1. Preprint / Submitted Version | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2858249
Copyright © 2021