Grant: Discovery Grants Program - Individual
McGill University
$42,000.00
Computation in Games and Networks
FY 2015-16
Summary
The aim of this proposal is to provide quantitative analyses of decision making, where decision makers may be single authorities, such as a network operator attempting to minimize traffic congestion, or participants in multi-agent systems such as auctions or social networks.
In practice all decision makers are computationally bounded. Thus, for multi-agent systems, we need to know how computational considerations affect game-play; despite its widespread applicability and importance, there is currently little understanding with respect to this question. Furthermore, an agent's choice of action may be heavily influenced by mechanistic restrictions within the system, for example, the actual pricing mechanism used within a market or the actual routing protocol used within a network. Consequently, this proposal focuses on the implications of computational and mechanistic constraints on decision making, with a particular emphasis on applications related to networks.
Thus, at a high level, we are interested in the following type of question. Can we build a cheap but functionally effective network? Can we design a market mechanism that leads to high social welfare? What are the dynamics and quality of outcomes produced by specific game-playing strategies (in particular, strategies that agents actually use rather than those prescribed by theoretical behavioural assumptions)? What are the effects of an intervention into a system? Clearly, to model and answer such questions we require tools from a wide range of areas. Towards this end, we utilize techniques from algorithm design and analysis, optimization, game theory, behavioural economics, graph theory, and causal inference.
Program
Discovery Grants Program - Individual
Recipient
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
288334-2012
Name nom
Vetta, Adrian
Department département
Mathematics and Statistics
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
2015
Competition year année de concours
2012
Award amount
42000
Program id
RGPIN
Program name 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
4
Nb partie
5
Application title
Computation in Games and Networks
Keyword
NSERC
Application summary
The aim of this proposal is to provide quantitative analyses of decision making, where decision makers may be single authorities, such as a network operator attempting to minimize traffic congestion, or participants in multi-agent systems such as auctions or social networks.
In practice all decision makers are computationally bounded. Thus, for multi-agent systems, we need to know how computational considerations affect game-play; despite its widespread applicability and importance, there is currently little understanding with respect to this question. Furthermore, an agent's choice of action may be heavily influenced by mechanistic restrictions within the system, for example, the actual pricing mechanism used within a market or the actual routing protocol used within a network. Consequently, this proposal focuses on the implications of computational and mechanistic constraints on decision making, with a particular emphasis on applications related to networks.
Thus, at a high level, we are interested in the following type of question. Can we build a cheap but functionally effective network? Can we design a market mechanism that leads to high social welfare? What are the dynamics and quality of outcomes produced by specific game-playing strategies (in particular, strategies that agents actually use rather than those prescribed by theoretical behavioural assumptions)? What are the effects of an intervention into a system? Clearly, to model and answer such questions we require tools from a wide range of areas. Towards this end, we utilize techniques from algorithm design and analysis, optimization, game theory, behavioural economics, graph theory, and causal inference.