Inefficiency of equilibria for scheduling game with machine activation costs
From MaRDI portal
Publication:897948
DOI10.1016/J.TCS.2015.05.035zbMATH Open1333.91010OpenAlexW618543335MaRDI QIDQ897948FDOQ897948
Xing He, Ling Lin, Zhiyi Tan, Yujie Yan, Xiaochen Xian
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.035
Recommendations
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
- The PoA of Scheduling Game with Machine Activation Costs
- Scheduling games on uniform machines with activation cost
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- An allocation game on two uniform machines with activation cost
Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Noncooperative games (91A10)
Cites Work
- Worst-case equilibria
- Tight bounds for worst-case equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- Strong equilibrium in cost sharing connection games
- Efficiency analysis of load balancing games with and without activation costs
- Conflicting Congestion Effects in Resource Allocation Games
- Title not available (Why is that?)
- The price of anarchy on uniformly related machines revisited
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- The structure and complexity of Nash equilibria for a selfish routing game
- Utilitarian resource assignment
Cited In (9)
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- Efficiency analysis with respect to the unit cost objectives in scheduling games
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- Coordination mechanisms for scheduling games with machine modification
- The PoA of Scheduling Game with Machine Activation Costs
- Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games
- Coordination mechanisms for scheduling games with proportional deterioration
This page was built for publication: Inefficiency of equilibria for scheduling game with machine activation costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897948)