Congestion games with priority-based scheduling

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Convergence and approximation in potential games
Tight bounds for selfish and greedy load balancing
Performance of one-round walks in linear congestion games
Non-clairvoyant scheduling games
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
Coordination mechanisms
Selfish load balancing and atomic congestion games
Stackelberg strategies for atomic congestion games
Coordination mechanisms for selfish scheduling
Stackelberg strategies for selfish routing in general multicommodity networks
Non-atomic one-round walks in congestion games
An almost ideal coordination mechanism for unrelated machine scheduling
Potential games
On the robustness of the approximate price of anarchy in generalized congestion games
Congestion games with priority-based scheduling
The online best reply algorithm for resource allocation problems
On Stackelberg strategies in affine congestion games
Efficient coordination mechanisms for unrelated machine scheduling
How much can taxes help selfish routing?
A class of games possessing pure-strategy Nash equilibria
Optimal Cost-Sharing in General Resource Selection Games
Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players
Exact Price of Anarchy for Polynomial Congestion Games
Intrinsic Robustness of the Price of Anarchy
Taxes for linear atomic congestion games
The effectiveness of stackelberg strategies and tolls for network congestion games
How bad is selfish routing?
The Price of Stability for Network Design with Fair Cost Allocation
Optimal Coordination Mechanisms for Unrelated Machine Scheduling
Cost-Balancing Tolls for Atomic Network Congestion Games
The price of anarchy of finite congestion games
Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling
Computing network tolls with support constraints
Stackelberg Scheduling Strategies
Optimal Cost Sharing for Resource Selection Games
The Price of Stability of Weighted Congestion Games
Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
Inner product spaces for MinSum coordination mechanisms
Algorithmic Game Theory
Algorithms – ESA 2005
Equilibrium points in n -person games
The Price of Routing Unsplittable Flow

This page was built for publication: Congestion games with priority-based scheduling