Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McGill University

$30,000.00

Algorithms and game theory in computer science

EF 2008-09

Résumé
The focus of this research is the design and analysis of algorithms. A major goal is the development of efficient algorithms with provably high quality for assorted problems in network design and optimisation. In particular, we are concerned with routing under restrictive internet protocols, and with the design of effective telecommunication and transportation networks. Moreover, I will also investigate the interactions between theoretical computer science and economics, such as the impact of competitive behaviour in computer science. Practical instances of this type include mechanism design, broadcast pricing, fixed investment decisions, routing in networks, and internet auctions. Another example concerns the application of techniques from theoretical computer science to economics. As an illustration, the importance of speed and efficiency in computing equilibria and in auction design is now well accepted. The breadth of application motivates the algorithmic approach used in theoretically analysing these interactions.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
288334-2007
Name nom
Vetta, Adrian
Department département
Computer Science, School of
Organization id
61
Institution établissement
McGill University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
30000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
2
Nb partie
5
Application title
Algorithms and game theory in computer science
Keyword
NA
Application summary
The focus of this research is the design and analysis of algorithms. A major goal is the development of efficient algorithms with provably high quality for assorted problems in network design and optimisation. In particular, we are concerned with routing under restrictive internet protocols, and with the design of effective telecommunication and transportation networks. Moreover, I will also investigate the interactions between theoretical computer science and economics, such as the impact of competitive behaviour in computer science. Practical instances of this type include mechanism design, broadcast pricing, fixed investment decisions, routing in networks, and internet auctions. Another example concerns the application of techniques from theoretical computer science to economics. As an illustration, the importance of speed and efficiency in computing equilibria and in auction design is now well accepted. The breadth of application motivates the algorithmic approach used in theoretically analysing these interactions.