How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract)

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)82-93
JournalLecture notes in computer science
Volume5385
Publication statusPublished - 2008

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)
  • Theoretical

Cite this

How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract). / Gassner, Elisabeth; Hatzl, Johannes; Krumke, Sven; Sperber, Heike; Wöginger, Gerhard Johannes.

In: Lecture notes in computer science, Vol. 5385, 2008, p. 82-93.

Research output: Contribution to journalArticleResearchpeer-review

@article{9cdae7e56a804f5b8089cacd5313f288,
title = "How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract)",
author = "Elisabeth Gassner and Johannes Hatzl and Sven Krumke and Heike Sperber and W{\"o}ginger, {Gerhard Johannes}",
year = "2008",
language = "English",
volume = "5385",
pages = "82--93",
journal = "Lecture notes in computer science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - How hard is it to find extreme Nash equilibria in network congestion games? (extended abstract)

AU - Gassner, Elisabeth

AU - Hatzl, Johannes

AU - Krumke, Sven

AU - Sperber, Heike

AU - Wöginger, Gerhard Johannes

PY - 2008

Y1 - 2008

M3 - Article

VL - 5385

SP - 82

EP - 93

JO - Lecture notes in computer science

JF - Lecture notes in computer science

SN - 0302-9743

ER -