Approximate equilibria and ball fusion

DOI10.1007/s00224-003-1131-5zbMath1101.68336OpenAlexW2061145134MaRDI QIDQ1762998

Paul G. Spirakis, Marios Mavronicolas, Elias Koutsoupias

Publication date: 11 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.9146

zbMATH Keywords

load balancing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (38)

Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ Tight bounds for parallel randomized load balancing ⋮ On the complexity of constrained Nash equilibria in graphical games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Coordination mechanisms ⋮ Atomic routing games on maximum congestion ⋮ The Price of Matching with Metric Preferences ⋮ On weighted balls-into-bins games ⋮ A Glimpse at Paul G. Spirakis ⋮ A Selective Tour Through Congestion Games ⋮ The price of anarchy for polynomial social cost ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Parallel load balancing on constrained client-server topologies ⋮ On the structure and complexity of worst-case equilibria ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ The price of anarchy on uniformly related machines revisited ⋮ Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Tight bounds for selfish and greedy load balancing ⋮ Worst-case equilibria ⋮ Selfish Bin Packing ⋮ Strong stability of Nash equilibria in load balancing games ⋮ Scheduling to maximize participation ⋮ Cost sharing mechanisms for fair pricing of resource usage ⋮ A new model for selfish routing ⋮ Selfish routing with incomplete information ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ Selfish bin packing ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Scheduling to Maximize Participation ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Selfish load balancing for jobs with favorite machines ⋮ Structure and complexity of extreme Nash equilibria ⋮ Selfish unsplittable flows

This page was built for publication: Approximate equilibria and ball fusion