The following pages link to (Q2934708):
Displaying 17 items.
- 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)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← 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)
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724) (← links)
- Equilibrium network design of shared-vehicle systems (Q2256243) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks (Q6163985) (← links)