In this paper, we examine the class of congestion games with player-specific payoff functions introduced by Milchtaich, I. (1996). Focusing on the special case of two resources, we give a short and simple method for identifying all Nash equilibria in pure strategies. We also provide a computation algorithm based on our theoretical analysis.
No takes yet. Share an insight, caveat, or question.
Khanchouche et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: