@inproceedings{68e7cafeaf834c1086d495f8547137d3,
title = "The price of anarchy for selfish ring routing is two",
abstract = "We analyze the network congestion game with atomic players, asymmetric strategies, and the maximum latency among all players as social cost. This important social cost function is much less understood than the average latency. We show that the price of anarchy is at most two, when the network is a ring and the link latencies are linear. Our bound is tight. This is the first sharp bound for the maximum latency objective.",
author = "Xujin Chen and Benjamin Doerr and Xiaodong Hu and Weidong Ma and \{Van Stee\}, Rob and Carola Winzen",
year = "2012",
month = dec,
day = "26",
doi = "10.1007/978-3-642-35311-6\_31",
language = "English",
isbn = "9783642353109",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "420--433",
booktitle = "Internet and Network Economics - 8th International Workshop, WINE 2012, Proceedings",
note = "8th International Workshop on Internet and Network Economics, WINE 2012 ; Conference date: 10-12-2012 Through 12-12-2012",
}