Coordination mechanisms for selfish scheduling
From MaRDI portal
Publication:1014630
DOI10.1016/j.tcs.2008.12.032zbMath1172.90004OpenAlexW2111714984MaRDI QIDQ1014630
Nicole Immorlica, Andreas S. Schulz, Li (Erran) Li, Vahab S. Mirrokni
Publication date: 29 April 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/52521
Related Items (60)
The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Partition Equilibrium Always Exists in Resource Selection Games ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis ⋮ The impact of local policies on the quality of packet routing in paths, trees, and rings ⋮ Optimal cost sharing for capacitated facility location games ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Coordination mechanisms ⋮ Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Truthful algorithms for scheduling selfish tasks on parallel machines ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Partition equilibrium always exists in resource selection games ⋮ Novel fairness-aware co-scheduling for shared cache contention game on chip multiprocessors ⋮ Coordination mechanisms for parallel machine scheduling ⋮ \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Decentralized subcontractor scheduling with divisible jobs ⋮ Coordination mechanisms for scheduling games with machine modification ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Coordination mechanisms with hybrid local policies ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Strategic Scheduling Games: Equilibria and Efficiency ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ The price of anarchy on uniformly related machines revisited ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Unnamed Item ⋮ Non-clairvoyant scheduling games ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Designing cost-sharing methods for Bayesian games ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ Scheduling games with machine-dependent priority lists ⋮ Competitive multi-agent scheduling with an iterative selection rule ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs ⋮ Congestion games with priority-based scheduling ⋮ Non-cooperative cost sharing games via subsidies ⋮ Competitive routing over time ⋮ Price of anarchy in parallel processing ⋮ Scheduling to minimize the maximum total completion time per machine ⋮ A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Non-cooperative Cost Sharing Games Via Subsidies ⋮ Coordination mechanisms for selfish scheduling ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ A note on the lower bound for the price of anarchy of scheduling games on unrelated machines ⋮ Enforcing efficient equilibria in network design games via subsidies ⋮ THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING ⋮ Two agent scheduling with a central selection mechanism
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Stackelberg differential games in economic models
- Coordination mechanisms for selfish scheduling
- How much can taxes help selfish routing?
- Tradeoffs in worst-case equilibria
- Algorithmic mechanism design (extended abstract)
- Performance Guarantees of Local Search for Multiprocessor Scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Scheduling Independent Tasks on Uniform Processors
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Bounds for List Schedules on Uniform Processors
- Algorithms for Scheduling Tasks on Unrelated Processors
- 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
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Automata, Languages and Programming
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Equilibrium points in n -person games
- Computing Nash equilibria for scheduling on restricted parallel links
This page was built for publication: Coordination mechanisms for selfish scheduling
