4 citations · 7 across the 3 of their papers we have counts for
5 papers
Computing Equilibria in Integer Programming Games with Shared Constraints
Bainian Hao, Hyunwoo Lee, Robert Hildebrand +1
We develop a cutting-plane algorithm for computing pure Nash equilibria in finite integer games with shared constraints, where a deviation may be feasible against one opponent prof…
Short simplex paths in lattice polytopes
Alberto Del Pia, Carla Michini
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consi…
Scenario Aggregation using Binary Decision Diagrams for Stochastic Programs with Endogenous Uncertainty
Utz-Uwe Haus, Carla Michini, Marco Laumanns
Modeling decision-dependent scenario probabilities in stochastic programs is difficult and typically leads to large and highly non-linear MINLPs that are very difficult to solve. I…
On the diameter of lattice polytopes
Alberto Del Pia, Carla Michini
In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integra…
Totally Unimodular Congestion Games
Alberto Del Pia, Michael Ferris, Carla Michini
We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players' strategies are binary vectors inside polyhedra defined by totall…