Automata, Languages and Programming

DOI10.1007/b99859zbMath1098.91079OpenAlexW2505584480MaRDI QIDQ5466475

Akash Nanavati, Elias Koutsoupias, George Christodoulou

Publication date: 24 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Games involving graphs (91A43) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (34)

The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Strong equilibrium in cost sharing connection games ⋮ The impact of local policies on the quality of packet routing in paths, trees, and rings ⋮ Coordination Mechanisms for Selfish Parallel Jobs Scheduling ⋮ Coordination mechanisms ⋮ Mechanisms with Monitoring for Truthful RAM Allocation ⋮ Truthful algorithms for scheduling selfish tasks on parallel machines ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Scheduling without payments ⋮ Decentralized subcontractor scheduling with divisible jobs ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ Unnamed Item ⋮ Non-clairvoyant scheduling games ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Scheduling games with machine-dependent priority lists ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Game-theoretic analysis of Internet switching with selfish users ⋮ Non-cooperative cost sharing games via subsidies ⋮ Plan-Coordination Mechanisms and the Price of Autonomy ⋮ Price of anarchy in parallel processing ⋮ A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines ⋮ Multistage interval scheduling games ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms ⋮ Non-cooperative Cost Sharing Games Via Subsidies ⋮ Selfish load balancing for jobs with favorite machines ⋮ Coordination mechanisms for selfish scheduling ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Randomized truthful algorithms for scheduling selfish tasks on parallel machines ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ On truthfulness and approximation for scheduling selfish tasks ⋮ Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing

This page was built for publication: Automata, Languages and Programming