Stackelberg scheduling strategies
From MaRDI portal
Publication:5175958
DOI10.1145/380752.380783zbMath1323.90022OpenAlexW2012552037MaRDI QIDQ5175958
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380783
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
Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ An approximation algorithm for Stackelberg network pricing ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games ⋮ Game-theoretic static load balancing for distributed systems ⋮ A network pricing game for selfish traffic ⋮ Computational aspects of uncertainty profiles and angel-daemon games ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Equilibria for networks with malicious users ⋮ Non-cooperative cost sharing games via subsidies ⋮ Price of anarchy in parallel processing ⋮ The price of anarchy is independent of the network topology ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Coordination mechanisms for selfish scheduling ⋮ Management of Variable Data Streams in Networks ⋮ “Beat-Your-Rival” Routing Games ⋮ A mixed traffic assignment problem and its upper bound of efficiency loss
Cites Work
