Equilibria in routing games with edge priorities

DOI10.1007/978-3-030-04612-5_27zbMath1443.91033arXiv1803.00865OpenAlexW2963900600MaRDI QIDQ2190414

Martin Strehler, Laura Vargas Koch, Robert Scheffler

Publication date: 18 June 2020

Full work available at URL: https://arxiv.org/abs/1803.00865

zbMATH Keywords

algorithmic game theorypure Nash equilibriarouting gameedge prioritiesprice of mistrust

Mathematics Subject Classification ID

Games involving graphs (91A43) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Related Items (2)

Equilibria in routing games with edge priorities ⋮ FIFO and randomized competitive packet routing games

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Nash equilibria and the price of anarchy for flows over time
• Competitive routing over time
• Transient flows in networks
• Equilibria in routing games with edge priorities
• An Introduction to Network Flows over Time
• Existence and Uniqueness of Equilibria for Flows over Time
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• The price of anarchy of finite congestion games
• Nash Equilibria and the Price of Anarchy for Flows over Time
• Competitive Packet Routing with Priority Lists
• Constructing Maximal Dynamic Flows from Static Flows
• Algorithmic Game Theory
• Über ein Paradoxon aus der Verkehrsplanung
• The network equilibrium problem in integers
• The Price of Routing Unsplittable Flow

This page was built for publication: Equilibria in routing games with edge priorities