Stackelberg Scheduling Strategies
From MaRDI portal
Publication:4651467
DOI10.1137/S0097539701397059zbMath1080.90046MaRDI QIDQ4651467
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Hierarchical games (including Stackelberg games) (91A65) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (40)
Stackelberg thresholds in network routing games or the value of altruism ⋮ Backward induction algorithm for a class of closed-loop Stackelberg games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Phenomena in inverse Stackelberg games. I: Static problems ⋮ Strategic decentralization in binary choice composite congestion games ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ Improving Selfish Routing for Risk-Averse Players ⋮ A Selective Tour Through Congestion Games ⋮ Collusion in atomic splittable routing games ⋮ Solution for a class of closed-loop leader-follower games with convexity conditions on the payoffs ⋮ Bilevel programming and applications ⋮ Resolving Braess's paradox in random networks ⋮ Using Temporal Dummy Players in Cost-Sharing Games ⋮ Stackelberg network pricing games ⋮ Efficient methods for selfish network design ⋮ Non-atomic one-round walks in congestion games ⋮ A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints ⋮ On Stackelberg mixed strategies ⋮ Line planning with user-optimal route choice ⋮ The price of optimum: complexity and approximation for a matching game ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ A selfish routing based network improvement problem ⋮ Connectivity and equilibrium in random games ⋮ Congestion games with priority-based scheduling ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Stackelberg strategies for atomic congestion games ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ System optimal routing of traffic flows with user constraints using linear programming ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ A Stackelberg strategy for routing flow over time ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Stackelberg network pricing is hard to approximate ⋮ Improving selfish routing for risk-averse players ⋮ Stackelberg strategies for selfish routing in general multicommodity networks ⋮ On Stackelberg strategies in affine congestion games ⋮ Modeling and mitigating link-flooding distributed denial-of-service attacks via learning in Stackelberg games ⋮ Enforcing efficient equilibria in network design games via subsidies
This page was built for publication: Stackelberg Scheduling Strategies
