5 papers
Complexity of Bilevel Linear Programming with a Single Upper-Level Variable
Nagisa Sugishita, Margarida Carvalho
Bilevel linear programming (LP) is one of the simplest classes of bilevel optimization problems, yet it is known to be NP-hard in general. Specifically, determining whether the opt…
Two-Stage Stochastic Capacity Expansion in Stable Matching under Truthful or Strategic Preference Uncertainty
Maria Bazotte, Margarida Carvalho, Thibaut Vidal
Recent studies on many-to-one matching markets have explored agents with flexible capacity and truthful preference reporting, focusing on mechanisms that jointly design capacities…
Stackelberg Dynamic Location Planning under Cumulative Demand
Warley Almeida Silva, Margarida Carvalho, Sanjay Dominik Jena
Dynamic facility location problems predominantly suppose a monopoly over the service or product provided. Nonetheless, this premise can be a severe oversimplification in the presen…
Competitive EV charging station location with queues
The Minh Nguyen, Nagisa Sugishita, Margarida Carvalho +1
Electric vehicle (EV) public charging infrastructure planning faces significant challenges in competitive markets, where multiple service providers affect congestion and user behav…
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
Quang Minh Bui, Margarida Carvalho, José Neto
The combinatorial pricing problem (CPP) is a bilevel problem in which the leader maximizes their revenue by imposing tolls on certain items that they can control. Based on the toll…