Competitive Packet Routing with Priority Lists

DOI10.4230/LIPIcs.MFCS.2016.49zbMath1398.91111OpenAlexW2541391650MaRDI QIDQ4608611

Britta Peis, Daniel Schmand, Laura Vargas Koch, Tobias Harks

Publication date: 21 March 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#HarksPSK16

zbMATH Keywords

complexityNash equilibriumprice of anarchypacket routingpriority policy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Equilibria in routing games with edge priorities ⋮ Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults ⋮ Identity-Based Hierarchical Key-Insulated Encryption Without Random Oracles

This page was built for publication: Competitive Packet Routing with Priority Lists