Cost-sharing games in real-time scheduling systems
From MaRDI portal
Publication:5918882
DOI10.1007/978-3-030-04612-5_28zbMath1443.91018OpenAlexW2901000215MaRDI QIDQ5918882
Publication date: 18 June 2020
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-04612-5_28
Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Cost-sharing scheduling games on restricted unrelated machines
- Network-formation games with regular objectives
- Worst-case equilibria
- A model for minimizing active processor time
- Tight bounds for selfish and greedy load balancing
- Minimizing total busy time in parallel scheduling with application to optical networks
- Network design with weighted players
- Real-time scheduling to minimize machine busy times
- Strong price of anarchy
- Batching identical jobs
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- Efficiency of Equilibria in Uniform Matroid Congestion Games
- The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
- Optimal Cost-Sharing in General Resource Selection Games
- Broadcast scheduling
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- On the Value of Coordination in Network Design
- Optimal Cost Sharing for Resource Selection Games
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
This page was built for publication: Cost-sharing games in real-time scheduling systems
