Automata, Languages and Programming
From MaRDI portal
Publication:5466475
DOI10.1007/b99859zbMath1098.91079MaRDI 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
90C47: Minimax problems in mathematical programming
91A43: Games involving graphs
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines, Unnamed Item, Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing, Approximate Strong Equilibrium in Job Scheduling Games, Non-cooperative Cost Sharing Games Via Subsidies, Scheduling games with machine-dependent priority lists, Nonpreemptive coordination mechanisms for identical machines, Extending the notion of rationality of selfish agents: second order Nash equilibria, Non-clairvoyant scheduling games, Game-theoretic analysis of Internet switching with selfish users, Randomized truthful algorithms for scheduling selfish tasks on parallel machines, On the Price of Anarchy of cost-sharing in real-time scheduling systems, 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, Truthful algorithms for scheduling selfish tasks on parallel machines, Decentralized subcontractor scheduling with divisible jobs, Cost sharing mechanisms for fair pricing of resource usage, Non-cooperative cost sharing games via subsidies, Price of anarchy in parallel processing, Coordination mechanisms for selfish scheduling, On truthfulness and approximation for scheduling selfish tasks, Scheduling without payments, On the price of anarchy of two-stage machine scheduling games, Multistage interval scheduling games, Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms, Selfish load balancing for jobs with favorite machines, The shortest first coordination mechanism for a scheduling game with parallel-batching machines, Inefficiency of Nash equilibria with parallel processing policy, Coordinating oligopolistic players in unrelated machine scheduling, Coordination Mechanisms for Selfish Parallel Jobs Scheduling, Bounds for the Convergence Time of Local Search in Scheduling Problems, Mechanisms with Monitoring for Truthful RAM Allocation, Plan-Coordination Mechanisms and the Price of Autonomy