scientific article; zbMATH DE number 5764807
From MaRDI portal
Publication:3579396
zbMATH Open1192.90060MaRDI QIDQ3579396FDOQ3579396
Authors:
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (28)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- On the price of anarchy of two-stage machine scheduling games
- Decentralized utilitarian mechanisms for scheduling games
- Designing cost-sharing methods for Bayesian games
- Coordination mechanisms
- Worst-case Nash equilibria in restricted routing
- Improving the price of anarchy for selfish routing via coordination mechanisms
- Enforcing efficient equilibria in network design games via subsidies
- Efficient coordination mechanisms for unrelated machine scheduling
- Inefficiency of Nash equilibria with parallel processing policy
- Load rebalancing games in dynamic systems with migration costs
- Designing Networks with Good Equilibria under Uncertainty
- Coordination mechanisms for selfish scheduling
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Selfish Transportation Games
- Price of anarchy in parallel processing
- Coordination mechanisms for parallel machine scheduling
- Coordinating oligopolistic players in unrelated machine scheduling
- Dynamics of Profit-Sharing Games
- Competitive routing over time
- Scheduling games with machine-dependent priority lists
- Unrelated parallel machine scheduling -- perspectives and progress
- A coordination mechanism for a scheduling game with parallel-batching machines
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling
- Non-clairvoyant scheduling games
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579396)