The Complexity of Equilibria in Cost Sharing Games

Abstract

We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open question. Specifically we prove that when the cost functions have the form f(x) = cr/x (Fair Cost Allocation) then it is PLS-complete to compute a Pure Nash Equilibrium even in the… (More)
DOI: 10.1007/978-3-642-17572-5_30

Topics

4 Figures and Tables

Slides referencing similar topics