scientific article; zbMATH DE number 2038735
From MaRDI portal
Publication:4449200
zbMath1060.68531MaRDI QIDQ4449200
Burkhard Monien, Thomas Lücking, Martin Gairing, Manuel Rode, Rainer Feldmann
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190514.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Traffic problems in operations research (90B20)
Related Items
The structure and complexity of Nash equilibria for a selfish routing game ⋮ The price of anarchy for polynomial social cost ⋮ Utilitarian resource assignment ⋮ Load balancing via random local search in closed and open systems ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Selfish bin coloring ⋮ Inefficiency of equilibria for scheduling game with machine activation costs ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ The price of anarchy on uniformly related machines revisited ⋮ Performance guarantees of jump neighborhoods on restricted related parallel machines ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Distributed algorithms for QoS load balancing ⋮ Scheduling to maximize participation ⋮ 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 ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Game-theoretic analysis of Internet switching with selfish users ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ Scheduling to Maximize Participation ⋮ Computing Nash equilibria for scheduling on restricted parallel links ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Structure and complexity of extreme Nash equilibria ⋮ Selfish unsplittable flows ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
This page was built for publication:
