The Sequential Price of Anarchy for Atomic Congestion Games

DOI10.1007/978-3-319-13129-0_35zbMath1404.91062OpenAlexW2123036301MaRDI QIDQ2937005

Jasper de Jong, Marc Uetz

Publication date: 7 January 2015

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

Full work available at URL: https://research.utwente.nl/en/publications/the-sequential-price-of-anarchy-for-atomic-congestion-games(12ab2cd2-d0f3-4a72-aaba-8fba9338d91d).html

zbMATH Keywords

linear programmingprice of anarchyatomic congestion games

Mathematics Subject Classification ID

Linear programming (90C05) Games involving graphs (91A43)

Related Items (10)

The limit of targeting in networks ⋮ The Curse of Sequentiality in Routing Games ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Tight bounds for the price of anarchy and stability in sequential transportation games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ Dynamic resource allocation games ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Dynamic Resource Allocation Games ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

This page was built for publication: The Sequential Price of Anarchy for Atomic Congestion Games