Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond

Congestion games offer a primary model of non-cooperative games, and a number of generalizations have been proposed, such as weighted congestion games, congestion games with mixed costs, and congestion games with complementarities. In this paper, we prove the existence of pure Nash equilibria in weighted matroid congestion games with complementarities and their further generalization, under a simplified assumption. Some extensions of previous results on congestion games with mixed costs are also presented.