The following pages link to Stackelberg Scheduling Strategies (Q4651467):
Displayed 40 items.
- Backward induction algorithm for a class of closed-loop Stackelberg games (Q296624) (← links)
- Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- On Stackelberg mixed strategies (Q516242) (← 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)
- A selfish routing based network improvement problem (Q545450) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- Phenomena in inverse Stackelberg games. I: Static problems (Q846943) (← 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)
- Bilevel programming and applications (Q1665319) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- System optimal routing of traffic flows with user constraints using linear programming (Q2030327) (← links)
- Modeling and mitigating link-flooding distributed denial-of-service attacks via learning in Stackelberg games (Q2094044) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- Improving selfish routing for risk-averse players (Q2300632) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Solution for a class of closed-loop leader-follower games with convexity conditions on the payoffs (Q2399326) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Stackelberg network pricing games (Q2429327) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Stackelberg network pricing is hard to approximate (Q3082599) (← links)
- On Stackelberg Strategies in Affine Congestion Games (Q3460782) (← links)
- Improving Selfish Routing for Risk-Averse Players (Q3460799) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints (Q5152476) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)
- Using Temporal Dummy Players in Cost-Sharing Games (Q6165463) (← links)