The following pages link to (Q4737207):
Displaying 11 items.
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Stackelberg scheduling strategies (Q5175958) (← links)
- Automata, Languages and Programming (Q5466502) (← links)