- Weitere Titel
-
Auslastungsspiele: Gleichgewichte, Netzwerke und Komplexität
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
München, Technische Universität München, Dissertation, 2022
- Schlagwort
-
Games
- Ereignis
-
Veröffentlichung
- (wo)
-
München
- (wer)
-
Universitätsbibliothek der TU München
- (wann)
-
2022
- Urheber
-
Waldmann, Clara
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bvb:91-diss-20220408-1633794-1-2
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:46 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Waldmann, Clara
- Schulz, Andreas S.
- Klimm, Max
- Universitätsbibliothek der TU München
Entstanden
- 2022
Ähnliche Objekte (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
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
The complexity of nash equilibria in stochastic multiplayer games
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?
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.
Congestion management games in electricity markets
Weighted congestion games with separable preferences
Congestion management games in electricity markets
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
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
The complexity of nash equilibria in stochastic multiplayer games
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?
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.
Congestion management games in electricity markets
Weighted congestion games with separable preferences
Congestion management games in electricity markets
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
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
The complexity of nash equilibria in stochastic multiplayer games
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?
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.
Congestion management games in electricity markets
Weighted congestion games with separable preferences