Experimental Results for Stackelberg Scheduling Strategies

In large scale networks users often behave selfishly trying to minimize their routing cost. Modelling this as a noncooperative game, may yield a Nash equilibrium with unboundedly poor network performance. To measure this inefficacy, the Coordination Ratio or Price of Anarchy (PoA) was introduced. It...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kaporis, A. C., Kirousis, L. M., Politopoulou, E. I., Spirakis, P. G.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Latency Function Leader Strategy Nash Equilibrium Noncooperative Game Optimum Load Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!