The price of anarchy in nonatomic consumption-relevance congestion games

DOI10.1002/NET.21499zbMATH Open1338.91038OpenAlexW1974252348MaRDI QIDQ2811296FDOQ2811296

Authors: Lasse Kliemann 

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21499

Recommendations

• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• A convergence analysis of the price of anarchy in atomic congestion games
• On the price of anarchy of highly congested nonatomic network games
• Mathematical Foundations of Computer Science 2004
• Atomic congestion games with random players: network equilibrium and the price of anarchy

zbMATH Keywords

nonatomic gamesprice of anarchyselfish routingWardrop modelmulticast routingnonatomic congestion games

Mathematics Subject Classification ID

Games involving graphs (91A43) Network design and communication in computer systems (68M10)

Cites Work

• Non-cooperative games
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• Bounding the inefficiency of equilibria in nonatomic congestion games
• A geometric approach to the price of anarchy in nonatomic congestion games
• Selfish Routing in Capacitated Networks
• A class of games possessing pure-strategy Nash equilibria
• Über ein Paradoxon aus der Verkehrsplanung
• Tight bounds for worst-case equilibria
• The impact of oligopolistic competition in networks
• Traffic assignment problem for a general network
• Selfish unsplittable flows
• Congestion games with player-specific payoff functions
• Generic uniqueness of equilibrium in large crowding games
• Equilibrium points of nonatomic games
• Pure Nash equilibria in player-specific and weighted congestion games
• Social optimality and cooperation in nonatomic congestion games.
• Weighted congestion games with separable preferences
• Network topology and the efficiency of equilibrium
• The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
• Topological Conditions for Uniqueness of Equilibrium in Networks
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Characterizing the existence of potential functions in weighted congestion games
• A new model for selfish routing
• Competitive routing in multicast communications
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands

Cited In (2)

• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions

This page was built for publication: The price of anarchy in nonatomic consumption-relevance congestion games

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