| KEYWORD |
Coordination, but not too much!
keywords CONGESTION GAMES, GRAPH, INTERACTING AGENTS, OPINION DYNAMICS, RESOURCES ALLOCATION
Reference persons FABIO FAGNANI
External reference persons GIACOMO COMO, Lund University
Research Groups Analisi e controllo di sistemi dinamici
Thesis type THEORETICAL AND SIMULATION
Description Suppose in a small village of 100 people there are two bars each of them having only space for 50 people. Suppose also that friends want to be together in the same bar. Is such a split possible and how, in practice, can be implemented? It is easy to realize that if the network of friendships in the community gives rise to a connected graph, any such split will frustrate some people who will not be able to be with (at least all) their friends. In this case one can ask how to split in such a way to minimize the total frustration of the community. Such problems are quite important and arise quite naturally in many contexts where coordination and resources limitations are both present, especially in socio-economic models. For instance, you may want to buy the same smartphone of your friend, but if all buy the same brand stores will run out of it, prices will go up and this will refrain other people from buying it. In this thesis we will investigate multi-agent dynamical models derived from game theory and incorporating inside both the coordination as well the congestion type features. We will first analyze mean-field approximation models and then consider truly network embedded models.
See also http://calvino.polito.it/~fagnani/topics%20PhD.html
Required skills graphs, probability, basic calculus, differential equations, Matlab
Deadline 28/06/2014
PROPONI LA TUA CANDIDATURA