Pages that link to "Item:Q1006047"
From MaRDI portal
The following pages link to The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047):
Displaying 11 items.
- Efficient methods for selfish network design (Q442104) (← 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)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
