- Alternative title
-
Auslastungsspiele: Gleichgewichte, Netzwerke und Komplexität
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
München, Technische Universität München, Dissertation, 2022
- Keyword
-
Games
- Event
-
Veröffentlichung
- (where)
-
München
- (who)
-
Universitätsbibliothek der TU München
- (when)
-
2022
- Creator
-
Waldmann, Clara
- Contributor
- URN
-
urn:nbn:de:bvb:91-diss-20220408-1633794-1-2
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 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
- Waldmann, Clara
- Schulz, Andreas S.
- Klimm, Max
- Universitätsbibliothek der TU München
Time of origin
- 2022
Other Objects (12)
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Approximate pure nash equilibria in congestion, opinion formation and facility location games
The complexity of nash equilibria in stochastic multiplayer games
How to find Nash equilibria with extreme total latency in network congestion games?
On the complexity of equilibria in games with succinct representation
The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games.
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Approximate pure nash equilibria in congestion, opinion formation and facility location games
The complexity of nash equilibria in stochastic multiplayer games
How to find Nash equilibria with extreme total latency in network congestion games?
On the complexity of equilibria in games with succinct representation
The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games.
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Approximate pure nash equilibria in congestion, opinion formation and facility location games
The complexity of nash equilibria in stochastic multiplayer games
How to find Nash equilibria with extreme total latency in network congestion games?
On the complexity of equilibria in games with succinct representation