Atomic routing in a deterministic queuing model

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.

MoreLess

Year of publication:	2014
Authors:	Werth, T. L. ; Holzhauser, M. ; Krumke, Sven O.
Published in:	Operations Research Perspectives. - Amsterdam : Elsevier, ISSN 2214-7160. - Vol. 1.2014, 1, p. 18-41
Publisher:	Amsterdam : Elsevier
Subject:	(I) Game theory \| (B) Routing \| Dynamic atomic unsplittable flows \| Equilibria \| Optimal solutions \| Complexity

freely available

Full text |

More access options

doi.org

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Type of publication (narrower categories):	Article
Language:	English
Other identifiers:	10.1016/j.orp.2014.05.001 [DOI] 1019417706 [GVK] hdl:10419/178243 [Handle] RePEc:eee:oprepe:v:1:y:2014:i:1:p:18-41 [RePEc]
Source:	EconStor

Persistent link: https://www.econbiz.de/10011825905