Coordination mechanisms
From MaRDI portal
Publication:838145
DOI10.1016/j.tcs.2009.01.005zbMath1177.91016OpenAlexW2914699946MaRDI QIDQ838145
Akash Nanavati, Elias Koutsoupias, George Christodoulou
Publication date: 21 August 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.005
Noncooperative games (91A10) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (34)
Efficient coordination mechanisms for unrelated machine scheduling ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Worst-case Nash equilibria in restricted routing ⋮ Self-fulfilling signal of an endogenous state in network congestion games ⋮ Primary versus secondary infrastructure capacity allocation mechanisms ⋮ Optimal externalities in a parallel transportation network ⋮ Coordination mechanisms for parallel machine scheduling ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Coordination mechanisms for scheduling games with machine modification ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Coordination mechanisms with hybrid local policies ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Selfish Transportation Games ⋮ Graphical congestion games ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Designing cost-sharing methods for Bayesian games ⋮ An almost ideal coordination mechanism for unrelated machine scheduling ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ The price of optimum: complexity and approximation for a matching game ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ Congestion games with priority-based scheduling ⋮ Competitive routing over time ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ A Stackelberg strategy for routing flow over time ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Designing Cost-Sharing Methods for Bayesian Games ⋮ Improved price of anarchy for machine scheduling games with coordination mechanisms ⋮ On Stackelberg strategies in affine congestion games ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ A note on the lower bound for the price of anarchy of scheduling games on unrelated machines ⋮ Enforcing efficient equilibria in network design games via subsidies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Coordination mechanisms for selfish scheduling
- \(k\)-price auctions
- Approximate equilibria and ball fusion
- Potential games
- Congestion games with player-specific payoff functions
- How much can taxes help selfish routing?
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- The complexity of pure Nash equilibria
- Pricing network edges for heterogeneous selfish users
- The price of anarchy of finite congestion games
- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- Algorithms, games, and the internet
- Exact Price of Anarchy for Polynomial Congestion Games
- Automata, Languages and Programming
- Algorithms – ESA 2005
- Bounds for Certain Multiprocessing Anomalies
- The Price of Routing Unsplittable Flow
- Algorithmic mechanism design
This page was built for publication: Coordination mechanisms
