Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/178243
Authors: 
Werth, T. L.
Holzhauser, M.
Krumke, Sven O.
Year of Publication: 
2014
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 1 [Year:] 2014 [Issue:] 1 [Pages:] 18-41
Abstract: 
The issue of selfish routing through a network has received a lot of attention in recent years. We study an atomic dynamic routing scenario, where players allocate resources with load dependent costs only for some limited time.
Subjects: 
(I) Game theory
(B) Routing
Dynamic atomic unsplittable flows
Equilibria
Optimal solutions
Complexity
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/3.0/
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.