The Curse of Sequentiality in Routing Games

DOI10.1007/978-3-662-48995-6_19zbMath1404.91047OpenAlexW2200247592MaRDI QIDQ3460793

Jasper de Jong, Marc Uetz, José R. Correa, Bart de Keijzer

Publication date: 8 January 2016

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48995-6_19

zbMATH Keywords

subgame perfect equilibriumNP-hardnessprice of anarchysequentialityrouting games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Games in extensive form (91A18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games ⋮ Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ The Curse of Sequentiality in Routing Games ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Dynamic resource allocation games ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Unnamed Item ⋮ Dynamic Resource Allocation Games

Cites Work

• Unnamed Item
• Unnamed Item
• Crowding games are sequentially solvable
• The curse of simultaneity
• Some Anomalies of Farsighted Strategic Behavior
• The Sequential Price of Anarchy for Atomic Congestion Games
• The Price of Stability for Network Design with Fair Cost Allocation
• The Curse of Sequentiality in Routing Games
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Sequential Equilibria
• Decentralized Throughput Scheduling
• On the Sequential Price of Anarchy of Isolation Games
• The Price of Routing Unsplittable Flow

This page was built for publication: The Curse of Sequentiality in Routing Games