Tesi etd-06272013-172938 |
Link copiato negli appunti
Tipo di tesi
Tesi di laurea magistrale
Autore
TAMBUSCIO, MARCELLA
URN
etd-06272013-172938
Titolo
Worst-case (in)efficiency of a congested network game on equilibria and Edgeworth cycles
Dipartimento
INFORMATICA
Corso di studi
INFORMATICA
Relatori
relatore Codenotti, Bruno
Parole chiave
- congested games oligopolistic equilibria efficienc
Data inizio appello
19/07/2013
Consultabilità
Non consultabile
Data di rilascio
19/07/2053
Riassunto
1 Introduction
1.1 Related Work
1.2 Notations
2 The model
2.1 General Description
2.2 Solution Concepts
2.3 Elastic demand variant
3 Linear Latencies: existence of provider equilibria
3.1 Best-Response dynamics
3.2 Convergence
4 Bound on efficiency of provider equilibria
4.1 Price of Anarchy
4.2 PoA of provider equilibria with non-smooth latencies
5 Non-smooth latencies and Edgeworth cycles
5.1 Non-existence of PE for higly convex latencies
5.2 Edgeworth cycles
5.3 Efficiency of cycles
6 Conclusions
1.1 Related Work
1.2 Notations
2 The model
2.1 General Description
2.2 Solution Concepts
2.3 Elastic demand variant
3 Linear Latencies: existence of provider equilibria
3.1 Best-Response dynamics
3.2 Convergence
4 Bound on efficiency of provider equilibria
4.1 Price of Anarchy
4.2 PoA of provider equilibria with non-smooth latencies
5 Non-smooth latencies and Edgeworth cycles
5.1 Non-existence of PE for higly convex latencies
5.2 Edgeworth cycles
5.3 Efficiency of cycles
6 Conclusions
File
| Nome file | Dimensione |
|---|---|
La tesi non è consultabile. |
|