scientific article
From MaRDI portal
Publication:3579396
zbMath1192.90060MaRDI QIDQ3579396
No author found.
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (28)
The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Coordination mechanisms ⋮ Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Worst-case Nash equilibria in restricted routing ⋮ Coordination mechanisms for parallel machine scheduling ⋮ \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games ⋮ Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games ⋮ Selfish Transportation Games ⋮ Non-clairvoyant scheduling games ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Designing cost-sharing methods for Bayesian games ⋮ 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 ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ Competitive routing over time ⋮ Price of anarchy in parallel processing ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Coordination mechanisms for selfish scheduling ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Dynamics of Profit-Sharing Games ⋮ 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
This page was built for publication:
