The price of anarchy in nonatomic consumption-relevance congestion games

DOI10.1002/NET.21499MaRDI QIDQ2811296zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)