Thursday, 14:15 - 14:40 h, Room: H 3008


Britta Peis
Resource buying games

Coauthor: Tobias Harks


In resource buying games, players jointly buy a subset of a given resource set. As in classical congestion games, each player has a predefined family of subsets of the resources from which she needs at least one to be available. However, a resource is only available if the sum of payments of all players cover the load-dependent cost of that resource. A strategy of a player is therefore a tupel consisting of one of her resource sets together with a payment vector indicating how much she is willing to contribute towards the purchase of each resource. During the talk, we study the existence and computability of pure Nash equilibria (PNEs) in resource buying games.
Resource buying games reduce to connection games in the special case where the costs are fixed and the players' resource sets are
network-paths connecting two player-specific terminals,
While there exist very simple connection games without PNE, we will see that PNEs exist and can be efficiently computed if each player's strategy set is the base set of a matroid and the marginal cost of each resource is monotone.


Talk 3 of the invited session Thu.2.H 3008
"Discrete structures and algorithms II" [...]
Cluster 2
"Combinatorial optimization" [...]


  The main criterion for them is your ability to repay any Wisconsin Payday Loans, they are not interested in your previous attempts, the current one is all that matters. Moreover, to order Cialis Daily online is highly advantageous because it interacts well with the small portions of alcohol and food.