Congestion games with linearly independent paths: Convergence time and price of Anarchy

Fotakis, D

dc.contributor.author	Fotakis, D	en
dc.date.accessioned	2014-03-01T01:33:03Z
dc.date.available	2014-03-01T01:33:03Z
dc.date.issued	2010	en
dc.identifier.issn	1432-4350	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20291
dc.subject	Best response dynamics	en
dc.subject	Network congestion games	en
dc.subject	Price of anarchy	en
dc.subject	Price of stability	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.classification	Mathematics	en
dc.subject.other	NASH EQUILIBRIA	en
dc.subject.other	NETWORK TOPOLOGY	en
dc.subject.other	SELFISH	en
dc.title	Congestion games with linearly independent paths: Convergence time and price of Anarchy	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s00224-009-9205-7	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s00224-009-9205-7	en
heal.language	English	en
heal.publicationDate	2010	en
heal.abstract	We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anarchy. In particular, we consider symmetric congestion games on extension-parallel networks, an interesting class of networks with linearly independent paths, and establish two remarkable properties previously known only for parallel-link games. We show that for arbitrary (non-negative and non-decreasing) latency functions, any best improvement sequence reaches a pure Nash equilibrium in at most as many steps as the number of players, and that for latency functions in class D, the pure Price of Anarchy is at most ρ(D), i.e. it is bounded by the Price of Anarchy for non-atomic congestion games. As a by-product of our analysis, we obtain that for symmetric network congestion games with latency functions in class D, the Price of Stability is at most ρ(D). © Springer Science+Business Media, LLC 2009.	en
heal.publisher	SPRINGER	en
heal.journalName	Theory of Computing Systems	en
dc.identifier.doi	10.1007/s00224-009-9205-7	en
dc.identifier.isi	ISI:000276746800006	en
dc.identifier.volume	47	en
dc.identifier.issue	1	en
dc.identifier.spage	113	en
dc.identifier.epage	136	en