Cost-sharing scheduling games on restricted unrelated machines
DOI10.1016/J.TCS.2016.07.012zbMATH Open1348.90241OpenAlexW2486041805MaRDI QIDQ306273FDOQ306273
Authors: Guy Avni, Tami Tamir 
Publication date: 31 August 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.012
Recommendations
- Cost-sharing scheduling games on restricted unrelated machines
- Scheduling games on uniform machines with activation cost
- An allocation game on two uniform machines with activation cost
- Cost-sharing games in real-time scheduling systems
- Inefficiency of equilibria for scheduling game with machine activation costs
Nash equilibriumcost-sharing gamesequilibrium inefficiencyscheduling on restricted unrelated machinesstrong equilibrium
Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Noncooperative games (91A10)
Cites Work
- Worst-case equilibria
- Reducibility among combinatorial problems
- A class of games possessing pure-strategy Nash equilibria
- Strong price of anarchy
- The Price of Stability for Network Design with Fair Cost Allocation
- Selfish unsplittable flows
- Title not available (Why is that?)
- On the existence of pure Nash equilibria in weighted congestion games
- Scheduling
- Congestion games with player-specific payoff functions
- Selfish load balancing
- Restoring Pure Equilibria to Weighted Congestion Games
- On the value of coordination in network design
- Optimal cost sharing for resource selection games
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- Weighted congestion games with separable preferences
- Scheduling games on uniform machines with activation cost
- Efficiency analysis of load balancing games with and without activation costs
- Network cost-sharing without anonymity
- Title not available (Why is that?)
- Conflicting congestion effects in resource allocation games
- Algorithms, games, and the internet
- Network-formation games with regular objectives
- The network equilibrium problem in integers
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
Cited In (13)
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Cost-sharing mechanisms for scheduling under general demand settings
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- Scheduling games with rank-based utilities
- Cost-sharing games in real-time scheduling systems
- Cost-sharing scheduling games on restricted unrelated machines
- Cost-sharing games with rank-based utilities
- Cost-sharing games in real-time scheduling systems
- The PoA of Scheduling Game with Machine Activation Costs
- The power of one evil secret agent
- The power of one secret agent
This page was built for publication: Cost-sharing scheduling games on restricted unrelated machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306273)
