Atomic congestion games with random players: network equilibrium and the price of anarchy

DOI10.1007/S10878-020-00583-3MaRDI QIDQ2082222zbMATH OpenOpenAlexFDO

Authors Chenlan Wang, Xuan Vinh Doan, Bo Chen

Publication date 4 October 2022

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10878-020-00583-3

zbMATH Keywords

congestion gamenetwork equilibriumprice of anarchy

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Recommendations

• A convergence analysis of the price of anarchy in atomic congestion games
• Atomic Routing Games on Maximum Congestion
• Atomic routing games on maximum congestion
• Selfish routing with atomic players
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A geometric approach to the price of anarchy in nonatomic congestion games
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Exact price of anarchy for polynomial congestion games
• How bad is selfish routing?
• scientific article; zbMATH DE number 3513051 (Why is no real title available?)
• Population uncertainty and Poisson games
• Selfish Routing in Capacitated Networks
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• The price of routing unsplittable flow
• The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
• Worst-case equilibria

Cited in

(17)

• Non-atomic one-round walks in congestion games
• Congestion games with priority-based scheduling
• Nonatomic aggregative games with infinitely many types
• The price of anarchy in nonatomic consumption-relevance congestion games
• Stochastic congestion games with risk-averse players
• Random order congestion games
• Congestion Pricing and Noncooperative Games in Communication Networks
• Stackelberg Strategies for Atomic Congestion Games
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• Dynamic Atomic Congestion Games with Seasonal Flows
• Rare Nash equilibria and the price of anarchy in large static games
• Atomic Routing Games on Maximum Congestion
• A convergence analysis of the price of anarchy in atomic congestion games
• Approximation and Convergence of Large Atomic Congestion Games
• Computing the price of anarchy in atomic network congestion games (invited talk)
• Bounding the price of anarchy for mixed traffic equilibrium assignment with stochastic demands and road pricing
• Atomic routing games on maximum congestion

This page was built for publication: Atomic congestion games with random players: network equilibrium and the price of anarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082222)