The minimum tollbooth problem in atomic network congestion games with unsplittable flows
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Theory of Computing Systems ; 65 (2021). - S. 1094-1109. - ISSN 1432-4350. - eISSN 1433-0490
- Keyword
-
Spieltheorie
Nash-Gleichgewicht
- Event
-
Veröffentlichung
- (where)
-
Ulm
- (who)
-
Universität Ulm
- (when)
-
2021
- Creator
-
Nickerl, Julian
- DOI
-
10.18725/OPARU-49441
- URN
-
urn:nbn:de:bsz:289-oparu-49517-0
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:55 PM CET
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
- Nickerl, Julian
- Universität Ulm
Time of origin
- 2021
Other Objects (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