2012/03/26 by Cheng Wan, Wan, Cheng
Computer Science · Decision Sciences · Mathematics · #90B10 (Primary) 90B20 #91A13 #91B18 (Secondary) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Mathematics #Game Theory and Applications #Optimization and Control (math.OC) #Social and Information Networks (cs.SI) #cs.GT #cs.SI #math.OC #msc:90B10 #msc:90B20 #msc:91A13 #msc:91B18
paper · pdf · doi:10.48550/arxiv.1203.5822
22 pages, 2 figures
openalex publication_date 2012/03/26 · arxiv created 2012/05/12 · arxiv updated 2015/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work shows that the formation of a finite number of coalitions in a nonatomic network congestion game benefits everyone. At the equilibrium of the composite game played by coalitions and individuals, the average cost to each coalition and the individuals' common cost are all lower than in the corresponding nonatomic game (without coalitions). The individuals' cost is lower than the average cost to any coalition. Similarly, the average cost to a coalition is lower than that to any larger coalition. Whenever some members of a coalition become individuals, the individuals' payoff is increased. In the case of a unique coalition, both the average cost to the coalition and the individuals' cost are decreasing with respect to the size of the coalition. In a sequence of composite games, if a finite number of coalitions are fixed, while the size of the remaining coalitions goes to zero, the equilibria of these games converge to the equilibrium of a composite game played by the same fixed coalitions and the remaining individuals.