Atomic routing in a deterministic queuing model

T.L. Werth, M. Holzhauser and S.O. Krumke

Operations Research Perspectives, 2014, vol. 1, issue 1, 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.

Keywords: (I) Game theory; (B) Routing; Dynamic atomic unsplittable flows; Equilibria; Optimal solutions; Complexity (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S2214716014000049
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:oprepe:v:1:y:2014:i:1:p:18-41

DOI: 10.1016/j.orp.2014.05.001

Access Statistics for this article

Operations Research Perspectives is currently edited by Rubén Ruiz Garcia

More articles in Operations Research Perspectives from Elsevier
Bibliographic data for series maintained by Catherine Liu ().