scientific article; zbMATH DE number 5764807
From MaRDI portal
Publication:3579396
Cited in
(26)- \(\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
- Coordination mechanisms
- Designing cost-sharing methods for Bayesian games
- Optimal coordination mechanisms for unrelated machine scheduling
- Worst-case Nash equilibria in restricted routing
- Enforcing efficient equilibria in network design games via subsidies
- Efficient coordination mechanisms for unrelated machine scheduling
- Selfish transportation games
- Inefficiency of Nash equilibria with parallel processing policy
- Load rebalancing games in dynamic systems with migration costs
- Coordination mechanisms for selfish scheduling
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Price of anarchy in parallel processing
- Coordination mechanisms for parallel machine scheduling
- Coordinating oligopolistic players in unrelated machine scheduling
- Competitive routing over time
- Dynamics of Profit-Sharing Games
- Unrelated parallel machine scheduling -- perspectives and progress
- A coordination mechanism for a scheduling game with parallel-batching machines
- Non-clairvoyant scheduling games
- Designing networks with good equilibria under uncertainty
- 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)
