- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games ; 2010, 16
Preprint Reihe Mathematik ; 2010, 16
- Classification
-
Mathematik
- Creator
- DOI
-
10.14279/depositonce-14461
- Handle
-
11303/15688
- URN
-
urn:nbn:de:101:1-2021122201560868816284
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:23 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
- Harks, Tobias
- Hoefer, Martin
- Klimm, Max
- Skopalik, Alexander
Other Objects (12)
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Equilibria in bottleneck games
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Bottleneck Congestion and Modal Split Revisited
Bottleneck Congestion: Differentiating the Coarse Charge
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?
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
Teleworking and Congestion: A Dynamic Bottleneck Analysis
Approximations of Nash equilibria
Viable Nash Equilibria: An Experiment
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Equilibria in bottleneck games
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Bottleneck Congestion and Modal Split Revisited
Bottleneck Congestion: Differentiating the Coarse Charge
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?
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
Teleworking and Congestion: A Dynamic Bottleneck Analysis
Approximations of Nash equilibria
Viable Nash Equilibria: An Experiment
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Equilibria in bottleneck games
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Bottleneck Congestion and Modal Split Revisited
Bottleneck Congestion: Differentiating the Coarse Charge
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?
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
Teleworking and Congestion: A Dynamic Bottleneck Analysis
Approximations of Nash equilibria