Cost-sharing scheduling games on restricted unrelated machines
From MaRDI portal
Publication:306273
DOI10.1016/j.tcs.2016.07.012zbMath1348.90241OpenAlexW2486041805MaRDI QIDQ306273
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
Nash equilibriumcost-sharing gamesequilibrium inefficiencyscheduling on restricted unrelated machinesstrong equilibrium
Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)
Related Items
Unnamed Item ⋮ Cost-sharing games with rank-based utilities ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ The power of one evil secret agent ⋮ Scheduling games with rank-based utilities ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ Efficient Black-Box Reductions for Separable Cost Sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- Network design with weighted players
- Strong equilibrium in cost sharing connection games
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
- Strong price of anarchy
- Weighted congestion games with separable preferences
- Congestion games with player-specific payoff functions
- Scheduling games on uniform machines with activation cost
- Efficiency analysis of load balancing games with and without activation costs
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Network Cost-Sharing without Anonymity
- Restoring Pure Equilibria to Weighted Congestion Games
- The Price of Stability for Network Design with Fair Cost Allocation
- On the Value of Coordination in Network Design
- Conflicting Congestion Effects in Resource Allocation Games
- Reducibility among Combinatorial Problems
- Optimal Cost Sharing for Resource Selection Games
- Algorithms, games, and the internet
- Network-Formation Games with Regular Objectives
- The network equilibrium problem in integers
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Scheduling
