54 citations · 134 across the 18 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2022★ 1 cited
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…
cs.CC2020
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…
cs.CC2019★ 2 cited
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.