The following pages link to Stackelberg scheduling strategies (Q5175958):
Displaying 17 items.
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Game-theoretic static load balancing for distributed systems (Q635345) (← links)
- Equilibria for networks with malicious users (Q985313) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- A mixed traffic assignment problem and its upper bound of efficiency loss (Q2336305) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games (Q3511399) (← links)
- Management of Variable Data Streams in Networks (Q3637322) (← links)
- An approximation algorithm for Stackelberg network pricing (Q5318277) (← links)
- “Beat-Your-Rival” Routing Games (Q5899478) (← links)
- The price of anarchy is independent of the network topology (Q5917582) (← links)
