scientific article; zbMATH DE number 2038735

MaRDI QIDQ4449200zbMATH OpenFDO

Authors Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190514.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Traffic problems in operations research (90B20) Applications of game theory (91A80)

Recommendations

• The price of selfish routing
• The price of selfish routing
• scientific article; zbMATH DE number 2156279
• Theoretical Computer Science
• Mathematical Foundations of Computer Science 2003

Cited in

(42)

• How hard is it to find extreme Nash equilibria in network congestion games?
• Approximate equilibria and ball fusion
• The cost of selfishness for maximizing the minimum load on uniformly related machines
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
• Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
• Approximate strong equilibria in job scheduling games with two uniformly related machines
• Selfish routing with incomplete information
• Mixed Nash equilibria in selfish routing problems with dynamic constraints
• Structure and complexity of extreme Nash equilibria
• Selfish unsplittable flows
• Bounds for the convergence time of local search in scheduling problems
• Scheduling to Maximize Participation
• Load balancing via random local search in closed and open systems
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
• Maximizing the minimum load: the cost of selfishness
• Selfish bin coloring
• The price of anarchy on uniformly related machines revisited
• Performance guarantees of jump neighborhoods on restricted related parallel machines
• scientific article; zbMATH DE number 2156279 (Why is no real title available?)
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• Balancing Load via Small Coalitions in Selfish Ring Routing Games
• STACS 2004
• Extending the notion of rationality of selfish agents: second order Nash equilibria
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Mathematical Foundations of Computer Science 2003
• The Price of Anarchy on Uniformly Related Machines Revisited
• Automata, Languages and Programming
• Computing Nash equilibria for scheduling on restricted parallel links
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Distributed algorithms for QoS load balancing
• Sequential solutions in machine scheduling games
• Game-theoretic analysis of Internet switching with selfish users
• Inefficiency of equilibria for the machine covering game on uniform machines
• Coordination mechanisms for scheduling selfish jobs with favorite machines
• The structure and complexity of Nash equilibria for a selfish routing game
• The price of anarchy for polynomial social cost
• Utilitarian resource assignment
• Inefficiency of equilibria for scheduling game with machine activation costs
• Scheduling to maximize participation
• A new model for selfish routing
• Nash equilibria in discrete routing games with convex latency functions
• How to find Nash equilibria with extreme total latency in network congestion games?

This page was built for publication:

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