Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

Competitive Packet Routing with Priority Lists

Competitive Packet Routing with Priority Lists In competitive packet routing games, the packets are routed selfishly through a network and scheduling policies at edges determine which packets are forwarded first if there is not enough capacity on an edge to forward all packets at once. We analyze the impact of priority lists on the worst-case quality of pure Nash equilibria. A priority list is an ordered list of players that may or may not depend on the edge. Whenever the number of packets entering an edge exceeds the inflow capacity, packets are processed in list order. We derive several new bounds on the price of anarchy and stability for global and local priority policies. We also consider the question of the complexity of computing an optimal priority list. It turns out that even for very restricted cases, i.e., for routing on a tree, the computation of an optimal priority list is APX-hard. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Economics and Computation (TEAC) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/competitive-packet-routing-with-priority-lists-sPUQiSLNqy

References (42)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2018 ACM
ISSN
2167-8375
eISSN
2167-8383
DOI
10.1145/3184137
Publisher site
See Article on Publisher Site

Abstract

In competitive packet routing games, the packets are routed selfishly through a network and scheduling policies at edges determine which packets are forwarded first if there is not enough capacity on an edge to forward all packets at once. We analyze the impact of priority lists on the worst-case quality of pure Nash equilibria. A priority list is an ordered list of players that may or may not depend on the edge. Whenever the number of packets entering an edge exceeds the inflow capacity, packets are processed in list order. We derive several new bounds on the price of anarchy and stability for global and local priority policies. We also consider the question of the complexity of computing an optimal priority list. It turns out that even for very restricted cases, i.e., for routing on a tree, the computation of an optimal priority list is APX-hard.

Journal

ACM Transactions on Economics and Computation (TEAC)Association for Computing Machinery

Published: Mar 9, 2018

Keywords: Nash equilibrium

There are no references for this article.