On 26 October-30 October 2020 NETWORKS organizes the tenth Training Week for PhD Students of NETWORKS.
Lecturer: Guido Schäfer
Abstract: Many network applications are inherently decentralized involving several independent decision makers (agents) who act strategically and on their own behalf. Algorithmic game theory (AGT) provides models and solution concepts to study such situations of strategic decision making, with a particular focus on computational and algorithmic issues.
The study of “network games” (in a very broad sense) has recently attracted a lot of attention in the algorithmic game theory community and led to several new insights and novel techniques. In this lecture series, we review some fundamental and more advanced results on network games with a particular focus on the new techniques that emerged from their studies.
Some topics that we will cover in this lecture series are:
- network routing games and Braess paradox
- Stackelberg routing and taxing subnetworks
- network coordination games and social context games
- best-response dynamics and no-regret learning
- smoothness of games and robust price of anarchy
Monday, Tuesday, Thursday & Friday
09.30 - 10.30: Minicourse Guido Schäfer (CWI): Network Games
10.30 - 11.00: break
11.00 - 11.30: Research Presentations
16.00 - 18.00: Social event