The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2192-6247
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Technische Berichte des Instituts für Informatik ; Nr. 08,14
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Kiel
- (who)
-
Institut für Informatik / Christian-Albrechts-Universität zu Kiel
- (when)
-
2008
- Creator
- URN
-
urn:nbn:de:101:1-201204206195
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:20 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kliemann, Lasse
- Institut für Informatik / Christian-Albrechts-Universität zu Kiel
Time of origin
- 2008
Other Objects (12)
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Exact price of anarchy for polynomial congestion games
Equilibria for two parallel links : the strong price of anarchy versus the price of anarchy
Congestion Games: Equilibria, Networks, and Complexity
A convergence analysis of the price of anarchy in atomic congestion games
Nash Equilibria and the Price of Anarchy for Flows Over Time
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Anarchy
Atomic congestion games with random players: network equilibrium and the price of anarchy
Program equilibria and discounted ComputationTime
Parametric computation of equilibria and flows
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Exact price of anarchy for polynomial congestion games
Equilibria for two parallel links : the strong price of anarchy versus the price of anarchy
Congestion Games: Equilibria, Networks, and Complexity
A convergence analysis of the price of anarchy in atomic congestion games
Nash Equilibria and the Price of Anarchy for Flows Over Time
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Anarchy
Atomic congestion games with random players: network equilibrium and the price of anarchy
Program equilibria and discounted ComputationTime
Parametric computation of equilibria and flows
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Exact price of anarchy for polynomial congestion games
Equilibria for two parallel links : the strong price of anarchy versus the price of anarchy
Congestion Games: Equilibria, Networks, and Complexity
A convergence analysis of the price of anarchy in atomic congestion games
Nash Equilibria and the Price of Anarchy for Flows Over Time
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Anarchy
Atomic congestion games with random players: network equilibrium and the price of anarchy
Program equilibria and discounted ComputationTime