Cost-sharing scheduling games on restricted unrelated machines

DOI10.1016/J.TCS.2016.07.012MaRDI QIDQ306273zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Nash equilibriumcost-sharing gamesequilibrium inefficiencyscheduling on restricted unrelated machinesstrong equilibrium

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Noncooperative games (91A10)

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

Cites work

• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• scientific article; zbMATH DE number 2079324 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Algorithms, games, and the internet
• Conflicting congestion effects in resource allocation games
• Congestion games with player-specific payoff functions
• Efficiency analysis of load balancing games with and without activation costs
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• Network cost-sharing without anonymity
• Network design with weighted players
• Network-formation games with regular objectives
• On the existence of pure Nash equilibria in weighted congestion games
• On the value of coordination in network design
• Optimal cost sharing for resource selection games
• Reducibility among combinatorial problems
• Restoring Pure Equilibria to Weighted Congestion Games
• Scheduling
• Scheduling games on uniform machines with activation cost
• Selfish load balancing
• Selfish unsplittable flows
• Strong equilibrium in cost sharing connection games
• Strong price of anarchy
• The Price of Stability for Network Design with Fair Cost Allocation
• The network equilibrium problem in integers
• Weighted congestion games with separable preferences
• Worst-case equilibria

Cited in

(14)

• Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
• Cost-sharing games in real-time scheduling systems
• The PoA of Scheduling Game with Machine Activation Costs
• Scheduling games with rank-based utilities
• Cost-sharing scheduling games on restricted unrelated machines
• Cost-sharing games with rank-based utilities
• The power of one evil secret agent
• Efficient black-box reductions for separable cost sharing
• Efficient black-box reductions for separable cost sharing
• Approximate strong equilibria in job scheduling games with two uniformly related machines
• Resource-Aware Cost-Sharing Methods for Scheduling Games
• The power of one secret agent
• Cost-sharing mechanisms for scheduling under general demand settings
• Cost-sharing games in real-time scheduling systems

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)