This paper is concerned mainly with two-stage Max-Min problems, in which the minimizing "player" acts after the maximizing "player" and with full knowledge of the choice of the maximizing player. Such ...

We consider variants of the max-flow min-cut problems in the plane, motivated by models of damage, where certain sets of edges of the graph can be simultaneously removed, rather than one edge at a ...