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, S.O.
Published in:	Operations Research Perspectives. - Elsevier, ISSN 2214-7160. - Vol. 1.2014, 1, p. 18-41
Publisher:	Elsevier
Subject:	(I) Game theory \| (B) Routing \| Dynamic atomic unsplittable flows \| Equilibria \| Optimal solutions \| Complexity

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

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