Resource Buying Games

In resource buying games a set of players jointly buys a subset of a finite resource set $$E$$E (e.g., machines, edges, or nodes in a digraph). The cost of a resource $$e$$e depends on the number (or load) of players using $$e$$e, and has to be paid completely by the players before it becomes available. Each player $$i$$i needs at least one set of a predefined family $${\mathcal S}_i\subseteq 2^E$$Si⊆2E to be available. Thus, resource buying games can be seen as a variant of congestion games in which the load-dependent costs of the resources can be shared arbitrarily among the players. A strategy of player $$i$$i in resource buying games is a tuple consisting of one of $$i$$i’s desired configurations $$S_i\in {\mathcal S}_i$$Si∈Si together with a payment vector $$p_i\in {\mathbb R}^E_+$$pi∈R+E indicating how much $$i$$i is willing to contribute towards the purchase of the chosen resources. In this paper, we study the existence and computational complexity of pure Nash equilibria (PNE, for short) of resource buying games. In contrast to classical congestion games for which equilibria are guaranteed to exist, the existence of equilibria in resource buying games strongly depends on the underlying structure of the families $${\mathcal S}_i$$Si and the behavior of the cost functions. We show that for marginally non-increasing cost functions, matroids are exactly the right structure to consider, and that resource buying games with marginally non-decreasing cost functions always admit a PNE.