Coordination mechanisms

DOI10.1016/J.TCS.2009.01.005MaRDI QIDQ838145zbMATH OpenOpenAlexFDO

Authors George Christodoulou, Elias Koutsoupias, Akash Nanavati

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

zbMATH Keywords

game theoryprice of anarchycongestion gamesmechanismselfish task allocation

Mathematics Subject Classification ID

Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10)

Recommendations

• Automata, Languages and Programming
• Coordination
• scientific article; zbMATH DE number 4023302
• Coordination cycles
• Self organization and coordination
• Coordinating action systems
• Coordination Capacity
• scientific article; zbMATH DE number 3887416
• Coordination logic

Cites work

• scientific article; zbMATH DE number 5764807 (Why is no real title available?)
• scientific article; zbMATH DE number 2079853 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• scientific article; zbMATH DE number 2119764 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• A course in game theory.
• Algorithmic mechanism design
• Algorithms – ESA 2005
• Algorithms, games, and the internet
• Approximate equilibria and ball fusion
• Automata, Languages and Programming
• Bounds for Certain Multiprocessing Anomalies
• Congestion games with player-specific payoff functions
• Coordination mechanisms for selfish scheduling
• Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
• Efficient coordination mechanisms for unrelated machine scheduling
• Exact Price of Anarchy for Polynomial Congestion Games
• How bad is selfish routing?
• How much can taxes help selfish routing?
• Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
• Potential games
• Pricing network edges for heterogeneous selfish users
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Worst-case equilibria
• \(k\)-price auctions

Cited in

(44)

• Reducing price of anarchy of selfish task allocation with more selfishness
• Mixed coordination mechanisms for scheduling games on hierarchical machines
• Price-based coordinability in hierarchical systems with information asymmetry: a comparative analysis of Nash equilibrium conditions
• Decentralized utilitarian mechanisms for scheduling games
• Designing cost-sharing methods for Bayesian games
• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Designing cost-sharing methods for Bayesian games
• The price of anarchy for utilitarian scheduling games on related machines
• Approximate strong equilibria in job scheduling games with two uniformly related machines
• Non-monetary coordination mechanisms for time slot allocation in warehouse delivery
• A Stackelberg strategy for routing flow over time
• Worst-case Nash equilibria in restricted routing
• Enforcing efficient equilibria in network design games via subsidies
• Coordinating action systems
• Graphical congestion games
• Efficient coordination mechanisms for unrelated machine scheduling
• Selfish transportation games
• Coordination mechanisms with hybrid local policies
• Self-fulfilling signal of an endogenous state in network congestion games
• Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
• Automata, Languages and Programming
• Coordination complexity: small information coordinating large populations
• An improved upper bound for the universal TSP on the grid
• Primary versus secondary infrastructure capacity allocation mechanisms
• Optimal externalities in a parallel transportation network
• Coordination mechanisms for scheduling games with machine modification
• Congestion games with priority-based scheduling
• Decentralized task coordination
• Coordination mechanisms for parallel machine scheduling
• A Two-Dimensional Self-coordination Mechanism of Agents in a Minority Game
• Coordination mechanisms for scheduling selfish jobs with favorite machines
• Competitive routing over time
• Designing budget-balanced best-response mechanisms for network coordination games
• Incentives and coordination in bottleneck models
• A coordination mechanism for a scheduling game with parallel-batching machines
• Sequential solutions in machine scheduling games
• Mathematical Foundations of Computer Science 2004
• The price of optimum: complexity and approximation for a matching game
• Optimal cost-sharing in general resource selection games
• On Stackelberg strategies in affine congestion games
• Coordination mechanisms for scheduling games with proportional deterioration
• The price of anarchy of affine congestion games with similar strategies
• Designing networks with good equilibria under uncertainty
• A note on the lower bound for the price of anarchy of scheduling games on unrelated machines

This page was built for publication: Coordination mechanisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838145)