文章基本信息

标题：Multi-Source Multi-Sink Nash Flows over Time
本地全文：下载
作者：Leon Sering ; Martin Skutella
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：65
页码：1-20
DOI：10.4230/OASIcs.ATMOS.2018.12
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Nash flows over time describe the behavior of selfish users eager to reach their destination as early as possible while traveling along the arcs of a network with capacities and transit times. Throughout the past decade, they have been thoroughly studied in single-source single-sink networks for the deterministic queuing model, which is of particular relevance and frequently used in the context of traffic and transport networks. In this setting there exist Nash flows over time that can be described by a sequence of static flows featuring special properties, so-called `thin flows with resetting'. This insight can also be used algorithmically to compute Nash flows over time. We present an extension of these results to networks with multiple sources and sinks which are much more relevant in practical applications. In particular, we come up with a subtle generalization of thin flows with resetting, which yields a compact description as well as an algorithmic approach for computing multi-terminal Nash flows over time.
关键词：Network congestion; Nash equilibrium; dynamic routing game; deterministic queuing model