Efficient coordination mechanisms for unrelated machine scheduling
From MaRDI portal
Publication:2375956
DOI10.1007/s00453-012-9650-6zbMath1267.68072arXiv1107.1814MaRDI QIDQ2375956
Publication date: 25 June 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1814
91A80: Applications of game theory
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Dynamics of Profit-Sharing Games, Designing Networks with Good Equilibria under Uncertainty, Congestion games with priority-based scheduling, On the Price of Anarchy of cost-sharing in real-time scheduling systems, Coordination mechanisms for scheduling selfish jobs with favorite machines, An almost ideal coordination mechanism for unrelated machine scheduling, Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs, Improved price of anarchy for machine scheduling games with coordination mechanisms, Enforcing efficient equilibria in network design games via subsidies, Implementation of optimal schedules in outsourcing with identical suppliers, Optimal Cost-Sharing in General Resource Selection Games, Selfish Transportation Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Coordination mechanisms
- Selfish load balancing and atomic congestion games
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Coordination mechanisms for selfish scheduling
- How easy is local search?
- Potential games
- Congestion games with player-specific payoff functions
- How much can taxes help selfish routing?
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A class of games possessing pure-strategy Nash equilibria
- Radiocoloring in planar graphs: Complexity and approximations
- Performance Guarantees of Local Search for Multiprocessor Scheduling
- Tight bounds for worst-case equilibria
- Designing Network Protocols for Good Equilibria
- Taxes for linear atomic congestion games
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- The Speed of Convergence in Congestion Games under Best-Response Dynamics
- Convergence time to Nash equilibrium in load balancing
- The complexity of pure Nash equilibria
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- The Competitiveness of On-Line Assignments
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- Stackelberg Scheduling Strategies
- Intrinsic robustness of the price of anarchy
- Algorithms, games, and the internet
- Preference-constrained oriented matching
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Inner product spaces for MinSum coordination mechanisms
- Algorithmic Game Theory
- Convergence and Approximation in Potential Games
