En poursuivant votre navigation sur ce site, vous acceptez le dépôt de cookies dans votre navigateur. (En savoir plus)
Portail > Offres > Offre UMR6074-OCASAN-001 - H/F Post-doc sur les jeux de congestion

H/F Post-doc on congestion games

This offer is available in the following languages:
Français - Anglais

Date Limite Candidature : vendredi 30 juillet 2021

Assurez-vous que votre profil candidat soit correctement renseigné avant de postuler. Les informations de votre profil complètent celles associées à chaque candidature. Afin d’augmenter votre visibilité sur notre Portail Emploi et ainsi permettre aux recruteurs de consulter votre profil candidat, vous avez la possibilité de déposer votre CV dans notre CVThèque en un clic !

Faites connaître cette offre !

General information

Reference : UMR6074-OCASAN-001
Workplace : RENNES
Date of publication : Friday, July 9, 2021
Type of Contract : FTC Scientist
Contract Period : 12 months
Expected date of employment : 1 October 2021
Proportion of work : Full time
Remuneration : 2900-3000€ monthly gross salary
Desired level of education : PhD
Experience required : Indifferent


Congestion games model selfish resource sharing among several players. A special case is the one of network congestion games, in which players aim at routing traffic through a congested network. Their popularity is certainly due to the fact that they have important practical applications in transportation networks, or in large communication networks. In network congestion games, each player chooses a set of transitions, forming a simple path from a source state to a target state, and the cost of a transition increases with its load, that is, with the number of players using it.
Several works have focused on comparing the social cost of Nash equilibria in this setting compared to an optimal solution implemented by a central authority. The ratio between the two is called the price of anarchy, and several authors have given bounds on this ratio which are valid for all games in a given class. In this project, we will extend these results to the continuous-time setting in which traversing an edge takes a given amount of time, and the cost of a path depends on the time spent with other players while traversing edges. We will explore dynamic strategies in this setting, characterize Nash equilibria, sub-game perfect equilibria and other solution concepts relevant in this setting, develop algorithms to compute these as well as the price of anarchy. In addition, we will explore efficient techniques to handle large numbers of players.




PhD in computer science
Required for all applicants:
- Excellent skills and experience in game theory
- Excellent skills on subgame perfect equilibrium algorithms
- Excellent list of publications in top conferences and journals

Work Context

The candidate will be part of the SUMO team.

Constraints and risks

No risk

We talk about it on Twitter!