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
-
07.03.2025, 1:52 PM CET
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)
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Congestion Games: Equilibria, Networks, and Complexity
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Program equilibria and discounted ComputationTime
Parametric computation of equilibria and flows
Computation of Equilibria in OLGModels with Many Heterogeneous Households
Approximate pure nash equilibria in congestion, opinion formation and facility location games
How to find Nash equilibria with extreme total latency in network congestion games?
Multi-Agent Reinforcement Learning for the Computation of Market Equilibria
Computation of equilibria in OLG models with many heterogeneous households
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Congestion Games: Equilibria, Networks, and Complexity
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Program equilibria and discounted ComputationTime
Parametric computation of equilibria and flows
Computation of Equilibria in OLGModels with Many Heterogeneous Households
Approximate pure nash equilibria in congestion, opinion formation and facility location games
How to find Nash equilibria with extreme total latency in network congestion games?
Multi-Agent Reinforcement Learning for the Computation of Market Equilibria
Computation of equilibria in OLG models with many heterogeneous households
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Congestion Games: Equilibria, Networks, and Complexity
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Program equilibria and discounted ComputationTime
Parametric computation of equilibria and flows
Computation of Equilibria in OLGModels with Many Heterogeneous Households
Approximate pure nash equilibria in congestion, opinion formation and facility location games
How to find Nash equilibria with extreme total latency in network congestion games?
Multi-Agent Reinforcement Learning for the Computation of Market Equilibria