Tight bounds for worst-case equilibria

Tight bounds for worst-case equilibria (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Artur Czumaj , Berthold Vöcking

Venue:	Proc. 13th SODA
Citations:	131 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Tight bounds for worst-case equilibria	INFERENCE
AUTHOR NAME	Artur Czumaj	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; New Jersey Institute of Technology	SVM HeaderParse 0.2
AUTHOR ADDR	Newark, NJ 07102, USA	SVM HeaderParse 0.2
AUTHOR NAME	Berthold Vöcking	SVM HeaderParse 0.2
AUTHOR AFFIL	Max-Planck-Institut für Informatik	SVM HeaderParse 0.2
AUTHOR ADDR	66123 Saarbrücken; Germany	SVM HeaderParse 0.2
ABSTRACT	We study the problem of traffic routing in non-cooperative networks. In such networks, users may follow selfish strategies to optimize their own performance measure and therefore their behavior does not have to lead to optimal performance of the entire network. In this paper we investigate the worst-case coordination ratio, which is a game theoretic measure aiming to reflect the price of selfish routing. Following a line of previous work, we focus on the most basic networks consisting of parallel links with linear latency functions. Our main result is that the worst-case coordination ratio on m parallel links of possibly different speeds is logm Θ log log logm In fact, we are able to give an exact description of the worst-case coordination ratio depending on the number of links and the ratio of the speed of the fastest link over the speed of the slowest link. For example, for the special case in which all m parallel links have the same speed, we can prove that the worst-case coordination ratio is Γ (−1) (m) + Θ(1) with Γ denoting the Gamma (factorial) function. Our bounds entirely resolve an open problem posed recently by Koutsoupias and Papadimitriou [KP99].	SVM HeaderParse 0.2
YEAR	2002	INFERENCE
VENUE	Proc. 13th SODA	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	12 found	ParsCit 1.0