The minimum tollbooth problem in atomic network congestion games with unsplittable flows
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Theory of Computing Systems ; 65 (2021). - S. 1094-1109. - ISSN 1432-4350. - eISSN 1433-0490
- Schlagwort
-
Spieltheorie
Nash-Gleichgewicht
- Ereignis
-
Veröffentlichung
- (wo)
-
Ulm
- (wer)
-
Universität Ulm
- (wann)
-
2021
- Urheber
-
Nickerl, Julian
- DOI
-
10.18725/OPARU-49441
- URN
-
urn:nbn:de:bsz:289-oparu-49517-0
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 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
- 2021
Ähnliche Objekte (12)
Congestion games : the minimum tollbooth problem and games with resource failures
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Minimum Cost Flows
Probabilistic Congestion Control for Non-Adaptable Flows
The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games.
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
Congestion games with failures : 10th July 2005
Congestion games : the minimum tollbooth problem and games with resource failures
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Minimum Cost Flows
Probabilistic Congestion Control for Non-Adaptable Flows
The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games.
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
Congestion games with failures : 10th July 2005
Congestion games : the minimum tollbooth problem and games with resource failures
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Experimental studies of the price of anarchy in non-atomic consumption-relevance congestion games.
Minimum Cost Flows
Probabilistic Congestion Control for Non-Adaptable Flows
The price of anarchy and computation of equilibria in non-atomic consumption-relevance congestion games.
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