54 citations · 134 across the 18 of their papers we have counts for
21 papers
Intermittency for the parabolic Anderson model on spaces with sub-Gaussian heat kernel estimates
Fabrice Baudoin, Hongyi Chen, Li Chen +1
We study the parabolic Anderson model on an unbounded Ahlfors -regular Dirichlet metric measure space whose heat kernel satisfies two-sided sub-…
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs
Margarida Carvalho, Alison Caulfield, Yi Lin +1
A kidney exchange program, also called a kidney paired donation program, can be viewed as a repeated, dynamic trading and allocation mechanism. This suggests that a dynamic algorit…
Integer Programming Games: A Gentle Computational Overview
Margarida Carvalho, Gabriele Dragotto, Andrea Lodi +1
In this tutorial, we present a computational overview on computing Nash equilibria in Integer Programming Games (s), , how to compute solutions for a class of non-cooper…
Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
Quang Minh Bui, Margarida Carvalho, José Neto
The network pricing problem (NPP) is a bilevel problem, where the leader optimizes its revenue by deciding on the prices of certain arcs in a graph, while expecting the followers (…
A stochastic integer programming approach to reserve staff scheduling with preferences
Carl Perreault-Lafleur, Margarida Carvalho, Guy Desaulniers
Nowadays, reaching a high level of employee satisfaction in efficient schedules is an important and difficult task faced by companies. We tackle a new variant of the personnel sche…
Adaptation, Comparison and Practical Implementation of Fairness Schemes in Kidney Exchange Programs
William St-Arnaud, Margarida Carvalho, Golnoosh Farnadi
In Kidney Exchange Programs (KEPs), each participating patient is registered together with an incompatible donor. Donors without an incompatible patient can also register. Then, KE…
Optimising Electric Vehicle Charging Station Placement using Advanced Discrete Choice Models
Steven Lamontagne, Margarida Carvalho, Emma Frejinger +3
We present a new model for finding the optimal placement of electric vehicle charging stations across a multi-period time frame so as to maximise electric vehicle adoption. Via the…
Capacity Variation in the Many-to-one Stable Matching
Federico Bobbio, Margarida Carvalho, Andrea Lodi +1
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. The agen…
ZERO: Playing Mathematical Programming Games
Gabriele Dragotto, Sriram Sankaranarayanan, Margarida Carvalho +1
We present ZERO, a modular and extensible C++ library interfacing Mathematical Programming and Game Theory. ZERO provides a comprehensive toolkit of modeling interfaces and algorit…
The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
Margarida Carvalho, Gabriele Dragotto, Andrea Lodi +1
We introduce Cut-and-Play, a practically-efficient algorithm for computing Nash equilibria in simultaneous non-cooperative games where players decide via nonconvex and possibly unb…
Capacity Planning in Stable Matching
Federico Bobbio, Margarida Carvalho, Andrea Lodi +2
Motivated by the shortage of seats that the Chilean school choice system is facing, we introduce the problem of jointly increasing school capacities and finding a student-optimal a…
A Catalog of Formulations for the Network Pricing Problem
Quang Minh Bui, Bernard Gendron, Margarida Carvalho
We study the network pricing problem where the leader maximizes their revenue by determining the optimal amounts of tolls to charge on a set of arcs, under the assumption that the…
Computing Nash equilibria for integer programming games
Margarida Carvalho, Andrea Lodi, João Pedro Pedroso
The recently defined class of integer programming games (IPG) models situations where multiple self-interested decision makers interact, with their strategy sets represented by a f…
Curriculum learning for multilevel budgeted combinatorial problems
Adel Nabli, Margarida Carvalho
Learning heuristics for combinatorial optimization problems through graph neural networks have recently shown promising results on some classic NP-hard problems. These are single-l…
Complexity of the Multilevel Critical Node Problem
Adel Nabli, Margarida Carvalho, Pierre Hosteins
In this work, we analyze a sequential game played in a graph called the Multilevel Critical Node problem (MCN). A defender and an attacker are the players of this game. The defende…
Multi-agent Assortment Optimization in Sequential Matching Markets
Alfredo Torrico, Margarida Carvalho, Andrea Lodi
Motivated by the challenges faced by choice-based matching platforms, in this work, we study a generalization of the foundational model introduced by Ashlagi et al. (2022). Specifi…
Segmentation and Optimal Region Selection of Physiological Signals using Deep Neural Networks and Combinatorial Optimization
Jorge Oliveira, Margarida Carvalho, Diogo Marcelo Nogueira +1
Physiological signals, such as the electrocardiogram and the phonocardiogram are very often corrupted by noisy sources. Usually, artificial intelligent algorithms analyze the signa…
Identifying Critical Neurons in ANN Architectures using Mixed Integer Programming
Mostafa ElAraby, Guy Wolf, Margarida Carvalho
We introduce a mixed integer program (MIP) for assigning importance scores to each neuron in deep neural network architectures which is guided by the impact of their simultaneous p…
Game theoretical analysis of Kidney Exchange Programs
Margarida Carvalho, Andrea Lodi
The goal of a kidney exchange program (KEP) is to maximize number of transplants within a pool of incompatible patient-donor pairs by exchanging donors. A KEP can be modelled as a…
When Nash Meets Stackelberg
Margarida Carvalho, Gabriele Dragotto, Felipe Feijoo +2
This article introduces a class of games among players (), namely, a class of simultaneous non-cooperative games where the players solve sequential Stac…
A note on the complexity of integer programming games
Margarida Carvalho
In this brief note, we prove that the existence of Nash equilibria on integer programming games is -complete.