Cost-Balancing Tolls for Atomic Network Congestion Games

Fotakis, D; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T01:55:52Z
dc.date.available	2014-03-01T01:55:52Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27871
dc.subject	Congestion Game	en
dc.subject	Linear Time	en
dc.subject	Network Congestion	en
dc.subject	Optimal Solution	en
dc.subject	Nash Equilibria	en
dc.subject	Nash Equilibrium	en
dc.subject	Series Parallel	en
dc.title	Cost-Balancing Tolls for Atomic Network Congestion Games	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-77105-0_19	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-77105-0_19	en
heal.publicationDate	2007	en
heal.abstract	We investigate the existence of optimal tolls for atomic symmetric network congestion games with unsplittable traffic and arbitrary non-negative and non-decreasing latency functions. We focus on pure Nash equilibria and a natural toll mechanism, which we call cost-balancing tolls. A set of cost-balancing tolls turns every path with positive traffic on its edges into a minimum cost path. Hence any	en
heal.journalName	Internet Mathematics	en
dc.identifier.doi	10.1007/978-3-540-77105-0_19	en