Pages that link to "Item:Q3527221"
From MaRDI portal
The following pages link to Stackelberg Strategies for Atomic Congestion Games (Q3527221):
Displaying 7 items.
- Efficient methods for selfish network design (Q442104) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)
