Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances

Jochen Koenemann, Kate Larson, David Steiner

We study a network extension to the Nash bargaining game, as introduced by Kleinberg and Tardos (STOC'08), where the set of players corresponds to vertices in a graph $G=(V,E)$ and…