Grant: Discovery Grants Program - Individual
Université de Montréal
$50,000.00
Mixed-integer programming for multi-agent settings
EF 2024-25
Résumé
Where should competing retailers locate their stores? How should countries form cross-boarder kidney exchange program alliances? These are a few examples among many in which agents such as companies, organizations or people interact and make decisions with the goal of optimizing their individual outcomes. In these contexts, policymakers and antitrust authorities are tasked with designing mechanisms and laws that regulate agents' interactions. To this end, a crucial step is to model the agents' incentives through an equilibrium concept, taking us into the domain of game theory. This makes it possible to anticipate whether policy changes are needed to achieve certain goals (e.g., the optimal patients' welfare in a cross-boarder kidney exchange program). The questions related to an equilibrium concept include its existence, uniqueness, and viability, while in the context of policy changes, there is the question of optimizing their design. Moreover, such settings often involve discrete decisions (e.g., location of retailers' stores and alliances among agents), placing us in the realm of combinatorial problems. Tackling these multi-agent games with an exponential number of discrete decisions (modeled as mixed-integer constraints) is very difficult, even using (when applicable) the few existing approaches.
This research program is dedicated to the modeling and development of methods to tackle multi-agent problems with discrete decisions whose accurate study requires considering preferences, strategic behavior, and fairness among multiple agents. This research program aims to amplify the applicant's endeavors in bridging combinatorial optimization and game theory, in order to expand our capacity to solve decision-making problems of practical value. Our long-term vision is to gain a comprehensive understanding of agents' equilibrium behavior, develop and implement methodologies for computing equilibria, and devise optimization techniques in the context of mechanism design, thereby empowering policymakers with appropriate tools to analyze and address challenges in socio-economic applications. The goals of our research program are (1) to expand the mathematical foundations of mixed-integer programming (combinatorial optimization), (2) to advance the capacity to tackle real-world settings, (3) to develop responsible algorithms, and (4) to leverage the knowledge to applicable policy-aid.
Our research program in multi-agent settings is driven by real-world socio-economic challenges of great interest to Canadian organizations, businesses, and people. These challenges include pricing problems, competitive location, collaboration in forestry, kidney exchanges and school choice. Our end goal is to develop adequate methods that provide valuable insights to policymakers, assisting them in analyzing and designing policies to promote behaviors that benefit social welfare, ensure equity/fairness or align with other specific objectives.
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
RGPIN-2024-04051
Name nom
da Silva Carvalho, Maria Margarida
Department département
Department of Computer Science and Operations Research
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
50000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
1100
Area of application group en
Health, education and social services
Area of application group fr
Santé publique, éducation et services sociaux
Area of application en
Health, education and social services
Area of application fr
Santé publique, éducation et services sociaux
Research subject code
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Mixed-integer programming for multi-agent settings
Keywords
mixed-integer programming; bilevel programming; mathematical programming; combinatorial optimization; decomposition; game theory; nash equilibria; matching markets; kidney exchange programs; stable matchings
Application summary
Where should competing retailers locate their stores? How should countries form cross-boarder kidney exchange program alliances? These are a few examples among many in which agents such as companies, organizations or people interact and make decisions with the goal of optimizing their individual outcomes. In these contexts, policymakers and antitrust authorities are tasked with designing mechanisms and laws that regulate agents' interactions. To this end, a crucial step is to model the agents' incentives through an equilibrium concept, taking us into the domain of game theory. This makes it possible to anticipate whether policy changes are needed to achieve certain goals (e.g., the optimal patients' welfare in a cross-boarder kidney exchange program). The questions related to an equilibrium concept include its existence, uniqueness, and viability, while in the context of policy changes, there is the question of optimizing their design. Moreover, such settings often involve discrete decisions (e.g., location of retailers' stores and alliances among agents), placing us in the realm of combinatorial problems. Tackling these multi-agent games with an exponential number of discrete decisions (modeled as mixed-integer constraints) is very difficult, even using (when applicable) the few existing approaches.
This research program is dedicated to the modeling and development of methods to tackle multi-agent problems with discrete decisions whose accurate study requires considering preferences, strategic behavior, and fairness among multiple agents. This research program aims to amplify the applicant's endeavors in bridging combinatorial optimization and game theory, in order to expand our capacity to solve decision-making problems of practical value. Our long-term vision is to gain a comprehensive understanding of agents' equilibrium behavior, develop and implement methodologies for computing equilibria, and devise optimization techniques in the context of mechanism design, thereby empowering policymakers with appropriate tools to analyze and address challenges in socio-economic applications. The goals of our research program are (1) to expand the mathematical foundations of mixed-integer programming (combinatorial optimization), (2) to advance the capacity to tackle real-world settings, (3) to develop responsible algorithms, and (4) to leverage the knowledge to applicable policy-aid.
Our research program in multi-agent settings is driven by real-world socio-economic challenges of great interest to Canadian organizations, businesses, and people. These challenges include pricing problems, competitive location, collaboration in forestry, kidney exchanges and school choice. Our end goal is to develop adequate methods that provide valuable insights to policymakers, assisting them in analyzing and designing policies to promote behaviors that benefit social welfare, ensure equity/fairness or align with other specific objectives.