4 citations · 14 across the 20 of their papers we have counts for
30 papers
Two-stage Stochastic Assignment Games
Laura Sanità, Lucy Verberk
In this paper, we study a two-stage stochastic version of the assignment game, which is a fundamental cooperative game. Given an initial setting, the set of players may change in t…
A Note on the Core of 2-Matching Games
Laura Sanità, Lucy Verberk
Cooperative 2-matching games are a generalization of cooperative matching games, where the value function is given by maximum-weight b-matchings, for a vertex capacity vector $b \l…
Improved Approximations for Flexible Network Design
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanita
Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) f…
On the Hardness of Short and Sign-Compatible Circuit Walks
Steffen Borgwardt, Weston Grewe, Sean Kafer +2
The circuits of a polyhedron are a superset of its edge directions. Circuit walks, a sequence of steps along circuits, generalize edge walks and are "short" if they have few steps…
Node Connectivity Augmentation of Highly Connected Graphs
Waldo Galvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli +1
Node-connectivity augmentation is a fundamental network design problem. We are given a -node connected graph together with an additional set of links, and the goal is to add…
On the Number of Degenerate Simplex Pivots
Kirill Kukharenko, Laura Sanità
The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchange…