Playing Stackelberg security games in perfect formulations

Protecting critical infrastructure from intentional damage requires foreseeing the strategies of possible attackers. The problem faced by the defender of such infrastructure can be formulated as a Stackelberg security game. A defender must decide what specific targets to protect with limited resources, maximizing their expected utility (e.g., minimizing damage value) and considering that a second … Read more

A dynamic programming approach to segmented isotonic regression

This paper proposes a polynomial-time algorithm to construct the monotone stepwise curve that minimizes the sum of squared errors with respect to a given cloud of data points. The fitted curve is also constrained on the maximum number of steps it can be composed of and on the minimum step length. Our algorithm relies on … Read more

Benders decomposition for Network Design Covering Problems

We consider two covering variants of the network design problem. We are given a set of origin/destination(O/D) pairs and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length is not larger than a given threshold. In the first problem, called the maximal … Read more