In the theory of congestion games, the Braess’ paradox shows that adding one resource to a network may sometimes worsen, rather than improve, the overall network performance. Here the paradox is investigated under a cooperative game-theoretic setting, in contrast to the non-cooperative one typically adopted in the literature. A family of cooperative games on networks is considered, whose utility function, defined in terms of a traffic assignment problem and the associated Wardrop equilibrium, expresses the average quality of service perceived by the network users.
On Braess’ Paradox and Average Quality of Service in Transportation Network Cooperative Games
Giorgio Gnecco;
2021-01-01
Abstract
In the theory of congestion games, the Braess’ paradox shows that adding one resource to a network may sometimes worsen, rather than improve, the overall network performance. Here the paradox is investigated under a cooperative game-theoretic setting, in contrast to the non-cooperative one typically adopted in the literature. A family of cooperative games on networks is considered, whose utility function, defined in terms of a traffic assignment problem and the associated Wardrop equilibrium, expresses the average quality of service perceived by the network users.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
3_corrected.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Nessuna licenza
Dimensione
453.26 kB
Formato
Adobe PDF
|
453.26 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.