Congestion games : the minimum tollbooth problem and games with resource failures
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Ulm, Universität Ulm, Dissertation, 2022
- Schlagwort
-
Games
Game theory
Externalities (Economics)
Spieltheorie
Komplexität
- DOI
-
10.18725/OPARU-43399
- URN
-
urn:nbn:de:bsz:289-oparu-43475-8
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:41 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
- Nickerl, Julian
- Universität Ulm
Entstanden
- 2022
Ähnliche Objekte (12)
Congestion games with failures : 10th July 2005
The minimum tollbooth problem in atomic network congestion games with unsplittable flows
Congestion management games in electricity markets
Congestion Games: Equilibria, Networks, and Complexity
Weighted congestion games with separable preferences
Congestion management games in electricity markets
Stackelberg pricing games with congestion effects
Minimum Cut Tree Games
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Exact price of anarchy for polynomial congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Congestion games with failures : 10th July 2005
The minimum tollbooth problem in atomic network congestion games with unsplittable flows
Congestion management games in electricity markets
Congestion Games: Equilibria, Networks, and Complexity
Weighted congestion games with separable preferences
Congestion management games in electricity markets
Stackelberg pricing games with congestion effects
Minimum Cut Tree Games
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Exact price of anarchy for polynomial congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Congestion games with failures : 10th July 2005
The minimum tollbooth problem in atomic network congestion games with unsplittable flows
Congestion management games in electricity markets
Congestion Games: Equilibria, Networks, and Complexity
Weighted congestion games with separable preferences
Congestion management games in electricity markets
Stackelberg pricing games with congestion effects
Minimum Cut Tree Games
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Exact price of anarchy for polynomial congestion games