Pages that link to "Item:Q3169096"

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

Displaying 8 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)
• 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)
• Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
• Collusion in atomic splittable routing games (Q2392243) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)