Pages that link to "Item:Q3169096"

The following pages link to Stackelberg Routing in Arbitrary Networks (Q3169096):

Displaying 18 items.

• Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
• 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)
• 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)
• Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
• On Stackelberg strategies in affine congestion games (Q2322708) (← links)
• Collusion in atomic splittable routing games (Q2392243) (← links)
• A Stackelberg strategy for routing flow over time (Q2516242) (← links)
• Stackelberg strategies for network design games (Q2808832) (← links)
• Stackelberg Routing on Parallel Networks With Horizontal Queues (Q2983233) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)
• Directional Routing via Generalized <i>st</i>-Numberings (Q4490784) (← links)
• (Q5365037) (← links)
• Experimental and Efficient Algorithms (Q5710075) (← links)
• Fighting for routes: resource allocation among competing planners in transportation networks (Q6555615) (← links)