Geopolitical congestion game with specified cost function

Geopolitical congestion game with specified cost function

An atomic routing game with limited capacities is considered. Different players in this game have different amounts of transported production and different cost functions. Algorithms finding Nash equilibrium are constructed. These algorithms are compared by time complexity. A numerical example is so...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Malafeev, O., Parfenov, A., Zaitseva, I., Shlaev, D., Orel, Yu
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithms
Cost function
Games
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An atomic routing game with limited capacities is considered. Different players in this game have different amounts of transported production and different cost functions. Algorithms finding Nash equilibrium are constructed. These algorithms are compared by time complexity. A numerical example is solved.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0167434