Scheduling games with machine-dependent priority lists
From MaRDI portal
Publication:5896089
DOI10.1007/978-3-030-35389-6_21zbMath1435.90072arXiv1909.10199OpenAlexW2990205799MaRDI QIDQ5896089
Vipin Ravindran Vijayalakshmi, Tami Tamir, Marc Schröder
Publication date: 30 June 2020
Published in: Theoretical Computer Science, Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.10199
Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonpreemptive coordination mechanisms for identical machines
- Congestion games with capacitated resources
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Coordination mechanisms for selfish scheduling
- Congestion games with priority-based scheduling
- The price of anarchy for utilitarian scheduling games on related machines
- Tradeoffs in worst-case equilibria
- Decentralized utilitarian mechanisms for scheduling games
- A class of games possessing pure-strategy Nash equilibria
- Worst-case Nash equilibria in restricted routing
- Tight bounds for worst-case equilibria
- Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
- Intrinsic Robustness of the Price of Anarchy
- The Price of Stability for Network Design with Fair Cost Allocation
- A Unified Approach to Congestion Games and Two-Sided Markets
- Non-clairvoyant Scheduling Games
- Bounds for List Schedules on Uniform Processors
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Computing Nash equilibria for scheduling on restricted parallel links
