Pages that link to "Item:Q1017909"
From MaRDI portal
The following pages link to Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909):
Displaying 18 items.
- Traffic routing oligopoly (Q302120) (← links)
- Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
- 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)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- System optimal routing of traffic flows with user constraints using linear programming (Q2030327) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- On Stackelberg Strategies in Affine Congestion Games (Q3460782) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- (Q5365037) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)