Margarida Carvalho est spécialiste de la théorie des jeux. Son programme s’appuie sur des approches tirées de la recherche opérationnelle et de l’apprentissage automatique, deux piliers de la science des données.

Arka Mukherjee

Alfredo Torrico

Doctorat

Bui Quang Minh

Federico Bobbio

Maîtrise

William St-Arnaud

Flore Caye

Moustafa Elarabi

Adel Nabli

Raphaël-James Lebel

Assistants de recherche

Kia Babashahi

• Atelier: Comportement des agents dans la théorie des jeux combinatoires /Agents behaviour in combinatorial game theory
• Semestre thématique du CRM: Les mathématiques de la prise de décision/ The mathematics of decision making
• Journal Club - Communauté d’échanges entre scientifiques des données et scientifiques de la santé

M. Carvalho, J. P. Pedroso, C. Telha, and M. Van Vyve. Competitive uncapacitated lot-sizing game.
International Journal of Production Economics, 204:148 – 159, 2018.

M. Carvalho, A. Lodi, and J.P. Pedroso. Existence of Nash equilibria on integer programming games.
In A. Ismael F. Vaz, João Paulo Almeida, José Fernando Oliveira, and Alberto Adrego Pinto, editors,
Operational Research, pages 11–23, Cham, 2018. Springer International Publishing.

M. Carvalho, A. Lodi, and P. Marcotte. A polynomial algorithm for a continuous bilevel knapsack
problem. Operations Research Letters, 46(2):185 – 188, 2018.

M. Carvalho, X. Klimentova, and A. Viana. Observability of power systems with optimal pmu placement.
Computers & Operations Research, 96:330 – 349, 2018.

M. Carvalho, A. Lodi, J. P. Pedroso, and A. Viana. Nash equilibria in the two-player kidney exchange
game. Math. Program., 161(1-2):389–417, January 2017.

A. Caprara, M. Carvalho, A. Lodi, and G. J. Woeginger. Bilevel knapsack with interdiction constraints.
INFORMS Journal on Computing, 28(2):319–333, 2016.

M. Carvalho, J. P. Pedroso, and J. Saraiva. Electricity day-ahead markets: Computation of Nash
equilibria. Journal of Industrial & Management Optimization, 11:985, 2015.

A. Caprara, M. Carvalho, A. Lodi, and G. J. Woeginger. A study on the computational complexity
of the bilevel knapsack problem. SIAM Journal on Optimization, 24(2):823–838, 2014.

A. Caprara, M. Carvalho, A. Lodi, and G. J. Woeginger. A complexity and approximability study of
the bilevel knapsack problem. In Michel Goemans and José Correa, editors, Integer Programming
and Combinatorial Optimization - IPCO 2013, pages 98–109, Berlin, Heidelberg, 2013. Springer
Berlin Heidelberg.