Congestion Games on Networks and the Price of Anarchy: Theory and Applications
|
Organizer(s): |
Name:
|
Affiliation:
|
Country:
|
Armen Bagdasaryan
|
American University of the Middle East
|
Kuwait
|
Mansur Saburov
|
Department of Mathematics and Natural Science, College of Arts and Sciences (CAS), Center for Applied Mathematics and Bioinformatics (CAMB), Gulf University for Science and Technology (GUST)
|
Kuwait
|
|
|
|
|
|
|
|
|
Introduction:
| | The special session deals with games on networks, network equilibrium and the price of anarchy, with their various applications, where decisions/behaviors of agents depend on the actions of their peers. This area has witnessed recent breakthroughs and advances related to the optimal flow distribution on congested networks; the study of the price of anarchy in congestion games on networks; the analysis of network game dynamics and its long-term behavior; the mean-field games in the study of traffic and pedestrian flows; and the price of anarchy in multi-agent learning. The session will focus on connections between network games, dynamical systems, optimization, and learning dynamics in games on networks.
The main topics include, but not limited to: evolutionary game dynamics and Wardrop optimal networks, with applications in neural networks and learning; mean-field games on networks and Wardrop-Nash equilibria; congestion games and the price of anarchy; dynamic network games with applications to transportation, communication, social and economic, and neural networks.
By bringing together specialists working in Dynamic Network Games field, we want to stimulate and initiate future developments and possible collaborations in this active field of study lying at the intersection of game theory, network dynamics and optimization, multi-agent learning and dynamical systems.
|
|
|
List of abstracts and speakers |
|
|
|
|
