Optimization Online


The Price of Atomic Selfish Ring Routing

Bo Chen (b.chen***at***warwick.ac.uk)
Xujin Chen (xchen***at***amss.ac.cn)
Xiaodong Hu (xdhu***at***amss.ac.cn)

Abstract: We study selfish routing in ring networks with respect to minimizing the maximum latency. Our main result is an establishement of constant bounds on the price of stability (PoS) for routing unsplittable flows with linear latency. We show that the PoS is at most 6.83, which reduces to 4:57 when the linear latency functions are homogeneous. We also show the existence of a (54,1)-approximate Nash equilibrium. Additionally we address some algorithmic issues for computing an approximate Nash equilibrium.

Keywords: selfish routing, Nash equilibrium, price of stability

Category 1: Other Topics (Game Theory )

Category 2: Network Optimization

Citation: Journal of Combinatorial Optimization; DOI: 10.1007/s10878-008-9171-z


Entry Submitted: 05/27/2008
Entry Accepted: 06/01/2008
Entry Last Modified: 06/02/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society