The following pages link to (Q3579396):
Displaying 10 items.
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Competitive routing over time (Q719282) (← links)
- Coordination mechanisms (Q838145) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
