Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Heterogeneous Routing Game
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
University of California at Berkeley.
University of California at Berkeley.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
2013 (English)In: 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, IEEE conference proceedings, 2013, 448-455 p.Conference paper, Published paper (Refereed)
Abstract [en]

Most literature on routing games make the assumption that drivers or vehicles are of the same type and, hence, experience the same latency or cost when traveling along the edges of the network. In contrast, in this article, we propose a heterogeneous routing game in which each driver or vehicle belongs to a certain type. The type determines the cost of traveling along an edge as a function of the flow of all types of drivers or vehicles over that edge. We examine the existence of a Nash equilibrium in this heterogeneous routing game. We study the conditions for which the problem of finding a Nash equilibrium can be posed as a convex optimization problem and is therefore numerically tractable. Numerical simulations are presented to validate the results.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 448-455 p.
Keyword [en]
Routing Game, Potential Game, Convex Optimization
National Category
Transport Systems and Logistics Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-138597DOI: 10.1109/Allerton.2013.6736559ISI: 000350802400063Scopus ID: 2-s2.0-84897743316ISBN: 978-147993409-6 (print)OAI: oai:DiVA.org:kth-138597DiVA: diva2:681495
Conference
51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013; Monticello, IL; United States; 2 October 2013 through 4 October 2013
Note

QC 20140618

Available from: 2013-12-20 Created: 2013-12-20 Last updated: 2015-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusPublication at Berkeley web

Authority records BETA

Johansson, Karl Henrik

Search in DiVA

By author/editor
Farokhi, FarhadJohansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
Transport Systems and LogisticsControl Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf