2 papers
cs.GT2018
Efficient Black-Box Reductions for Separable Cost Sharing
Tobias Harks, Martin Hoefer, Anja Huber +1
In cost sharing games with delays, a set of agents jointly allocates a finite subset of resources. Each resource has a fixed cost that has to be shared by the players, and each age…
cs.GT2017
A Characterization of Undirected Graphs Admitting Optimal Cost Shares
Tobias Harks, Anja Huber, Manuel Surek
In a seminal paper, Chen, Roughgarden and Valiant studied cost sharing protocols for network design with the objective to implement a low-cost Steiner forest as a Nash equilibrium…