@InProceedings{harks_et_al:LIPIcs.MFCS.2016.49,
author = {Harks, Tobias and Peis, Britta and Schmand, Daniel and Vargas Koch, Laura},
title = {{Competitive Packet Routing with Priority Lists}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.49},
URN = {urn:nbn:de:0030-drops-64622},
doi = {10.4230/LIPIcs.MFCS.2016.49},
annote = {Keywords: packet routing, Nash equilibrium, price of anarchy, priority policy, complexity}
}