Welcome to Dr. Brigitte Jaumard's Website

Concordia University

CSE - Computer Science and Software Engineering

Mailing address

1455 de Maisonneuve Blvd. West
EV-003-189
Montreal, Quebec
H3G 1M8, Canada

Civic address

1515 St. Catherine Street West
S-EV 003.189 (Office)
S-EV 003.139 (Reception)
Montreal, Quebec
H3G 2W1, Canada

Map of the SWG Campus
(search for the EV building)

Phone : 1 (514) 848-2424 # 5380
Fax : 1 (514) 848-2830

GERAD

Campus de l'Université de Montréal
Pavillon André-Aisenstadt
2920, Chemin de la Tour
4th Floor, Office 4451
Montréal, Quebec
H3T 1J4, Canada

Map of the Universite de Montreal Campus

Phone : 1 (514) 340-4711 # 4509

Research Projects

Multi Agent Systems and Mechanism Design

A multi-agent system, sometimes refer to a self organized system, corresponds to a scenario where multiple entities interact within a given environment to achieve individual or collective goals. Co-operative systems are been studied extensively while situations where the individual objectives do not align with each other or the common goal have been much less studied.

Computational problems involving multiple interacting agents have exploded in significance along with the rise of the Internet and the social networks due to the massive volume of applications they provide or generate. As communication between entities becomes easier, the number of interested parties in any situation rises. From a computational point of view, the presence of multiple agents not only introduces strategic and temporal issues, but also enhances the difficulties of optimizing the coordination among the agents, hence the motivation for mechanism design.

Mechanism design is the sub-fi eld of microeconomics and game theory that considers how to implement good system-wide solutions to problems that involve multiple self-interested agents, each with private information about their preferences. In recent years mechanism design has found many important applications; e.g., in electronic market design, in distributed scheduling problems, and in combinatorial resource allocation problems.

Classical mechanism design deals with the design of incentives for a distributed population of agents to behave in a way that will lead to an optimal global outcome. The meaning of \optimal" depends on the mechanism designer's interests. These are represented by a social choice function that maps any type pro le of the agents to the outcome that the designer would like to see occur if that type pro le is realized.

While classic mechanism design has not directly deal with the computational questions of the process, such as the representations of the outcome and preference spaces, or the complexity of choosing the optimal outcome , the idea of computational mechanism design is to maintain useful economic properties but also achieve useful computational properties.