Weighted congestion games with separable preferences

DOI10.1016/j.geb.2009.03.009zbMath1180.91026OpenAlexW1993103111MaRDI QIDQ1036603

Igal Milchtaich

Publication date: 13 November 2009

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2009.03.009

zbMATH Keywords

potentialcongestion gamesfinite improvement propertyseparable preferencespure equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06)

Related Items (11)

A survey of static and dynamic potential games ⋮ Cost-Sharing Scheduling Games on Restricted Unrelated Machines ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ Network-formation games with regular objectives ⋮ Representation of finite games as network congestion games ⋮ The potential of iterative voting to solve the separability problem in referendum elections ⋮ Hierarchical Network Formation Games ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ Fault-Tolerant Aggregate Signatures ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach

Cites Work

• Unnamed Item
• Unnamed Item
• Network topology and equilibrium existence in weighted network congestion games
• Network topology and the efficiency of equilibrium
• Congestion models and weighted Bayesian potential games
• Pure strategy Nash equilibrium in a group formation game with positive externalities
• Potential games
• Congestion games with player-specific payoff functions
• On the existence of a pure strategy Nash equilibrium in group formation games
• A geometric approach to the price of anarchy in nonatomic congestion games
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Congestion Games with Player-Specific Constants
• The complexity of pure Nash equilibria
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Atomic resource sharing in noncooperative networks

This page was built for publication: Weighted congestion games with separable preferences