Cost-sharing scheduling games on restricted unrelated machines
From MaRDI portal
Publication:3449583
DOI10.1007/978-3-662-48433-3_6zbMATH Open1358.90041OpenAlexW2187134935MaRDI QIDQ3449583FDOQ3449583
Authors: Guy Avni, Tami Tamir 
Publication date: 4 November 2015
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48433-3_6
Recommendations
Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Games involving graphs (91A43)
Cites Work
- Worst-case equilibria
- A class of games possessing pure-strategy Nash equilibria
- Strong price of anarchy
- The Price of Stability for Network Design with Fair Cost Allocation
- Title not available (Why is that?)
- Scheduling
- Restoring Pure Equilibria to Weighted Congestion Games
- 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
- Title not available (Why is that?)
- Algorithms, games, and the internet
- Network-formation games with regular objectives
Cited In (7)
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- Cost-sharing mechanisms for scheduling under general demand settings
- Cost-sharing scheduling games on restricted unrelated machines
- Resource-Aware Cost-Sharing Methods for Scheduling Games
- Cost-sharing games in real-time scheduling systems
- Cost-sharing games in real-time scheduling systems
- The PoA of Scheduling Game with Machine Activation Costs
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 Q3449583)
