Martina Vanelli
On network games with coordinating and anti-coordinating agents.
Rel. Fabio Fagnani, Giacomo Como. Politecnico di Torino, Corso di laurea magistrale in Ingegneria Matematica, 2019
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (1MB) | Preview |
Abstract
Network games are a useful model to study strategic interactions over interconnected systems. When the individual decisions are binary, agents might prefer one action over the other according to the number of friends that are playing it. For instance, in the spread of innovations and beliefs, as well as in contagion, individuals adopt the new strategy if enough neighbors are choosing it. On the other hand, if a resource is shared, as in traffic flows and division of work, too many people taking an action can be an incentive for the player to choose the opposite one. These two emblematic situations are modeled as network games with coordinating and anti-coordinating agents.
Thanks to their wide use and the simplicity of their definition, network coordination and anti-coordination games have been largely studied in the literature and many results have been achieved when all the players have the same behavior
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
Ente in cotutela
URI
![]() |
Modifica (riservato agli operatori) |
