This preview shows page 1. Sign up to view the full content.
Unformatted text preview: is the set of resource combinations (e.g., links or common
resources) that player i can take/use. A strategy for player i is si ∈ Si ,
corresponding to the subset of resources that this player is using.
c j (k ) is the beneﬁt for the negative of the cost to each user who uses
resource j if k users are using it.
Deﬁne congestion game �I , (Si ), (ui )� with utilities
ui ( s i , s − i ) = ∑ c j (kj ), j ∈si where kj is the number of users of resource j under strategy s .
22 Game Theory: Lecture 8 Potential Games Congestion and Potential Games
Theorem (Rosenthal (73))...
View Full Document
This document was uploaded on 03/19/2014 for the course EECS 6.254 at MIT.
- Spring '10