Balancing Load via Small Coalitions in Selfish Ring Routing Games
From MaRDI portal
Publication:5245837
DOI10.1142/S0217595915400035zbMath1311.90019OpenAlexW2101336750MaRDI QIDQ5245837
Xiao-Dong Hu, Weidong Ma, Xu-jin Chen
Publication date: 15 April 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595915400035
ring networksload balancingprice of anarchyselfish routing\(k\)-strong equilibriumbottleneck congestion game
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15) General equilibrium theory (91B50)
Cites Work
- Pairwise-stability and Nash equilibria in network formation
- Strong equilibrium in cost sharing connection games
- Atomic routing games on maximum congestion
- The price of atomic selfish ring routing
- Strong price of anarchy
- Multicuts and integral multiflows in rings
- Network structure and strong equilibrium in route selection games.
- A strategic model of social and economic networks
- How bad is selfish routing?
- Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
- The Price of Stability for Network Design with Fair Cost Allocation
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Network Games with Atomic Players
- On the Value of Coordination in Network Design
- The Ring Loading Problem
- Linear time algorithms for the ring loading problem with demand splitting
- Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
- Path decomposition under a new cost measure with applications to optical network design
- Network Formation: Bilateral Contracting and Myopic Dynamics
- Strong Price of Anarchy for Machine Load Balancing
This page was built for publication: Balancing Load via Small Coalitions in Selfish Ring Routing Games
