Algorithmics-Graphs-Combinatorics
- Domaine
- Algorithmics-Graphs-Combinatorics
- Domain - extra
- Année
- 2013
- Starting
- 09/2014
- État
- Open
- Sujet
- Some fundamental algorithmic game theoretical problems
in graphs: from searching and rendezvous games to congestion games
- Thesis advisor
- MANOUSSAKIS Yannis
- Co-advisors
- LIn CHEN
- Laboratory
- Collaborations
- Abstract
- The objective of the Ph.D. thesis is to establish a systematical framework on the study of some algorithmic game theoretical problems in graphs of fundamental importance such as rendezvous and searching games, congestion and load balancing games. We propose to study the rendezvous and searching games as a starting point, with the flexibility of tackling other fundamental games suggested by the candidate. We put particular emphasis on the generality and the structural properties of the problem of which the theoretical solution and the related analysis can bring new insights on the methodology of solving a class of generic problems. We also expect that the analysis conducted in the thesis will lead to a several distributed algorithms that can work in practical engineering scenarios, especially in distributed communication and networking paradigms.
- Context
- Objectives
- Work program
- Extra information
- Prerequisite
- Détails
Some fundamental algorithmic game theoretical problems.pdf- Expected funding
- Institutional funding
- Status of funding
- Expected
- Candidates
- Utilisateur
- lin.chen2
- Créé
- Mercredi 23 octobre 2013 15:14:03 CEST
- dernière modif.
- Mercredi 23 octobre 2013 15:14:03 CEST
Connexion
Ecole Doctorale Informatique Paris-Sud
Directrice
Nicole Bidoit
Assistante
Stéphanie Druetta
Conseiller aux thèses
Dominique Gouyou-Beauchamps
ED 427 - Université Paris-Sud
UFR Sciences Orsay
Bat 650 - aile nord - 417
Tel : 01 69 15 63 19
Fax : 01 69 15 63 87
courriel: ed-info à lri.fr