KMS Of Academy of mathematics and systems sciences, CAS
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents | |
Cao, Zhigang1; Chen, Bo2; Chen, Xujin3,4![]() ![]() | |
2021-07-20 | |
Source Publication | OPERATIONS RESEARCH
![]() |
ISSN | 0030-364X |
Pages | 17 |
Abstract | We propose a game model for selfish routing of atomic agents, who compete for use of a network to travel from their origins to a common destination as quickly as possible. We follow a frequently used rule that the latency an agent experiences on each edge is a constant transit time plus a variable waiting time in a queue. A key feature that differentiates our model from related ones is an edge-based tie-breaking rule for prioritizing agents in queueing when they reach an edge at the same time. We study both nonadaptive agents (each choosing a one-off origin-destination path simultaneously at the very beginning) and adaptive ones (each making an online decision at every nonterminal vertex they reach as to which next edge to take). On the one hand, we constructively prove that a (pure) Nash equilibrium (NE) always exists for nonadaptive agents and show that every NE is weakly Pareto optimal and globally first-in first-out. We present efficient algorithms for finding an NE and best responses of nonadaptive agents. On the other hand, we are among the first to consider adaptive atomic agents, for which we show that a subgame perfect equilibrium (SPE) always exists and that each NE outcome for nonadaptive agents is an SPE outcome for adaptive agents but not vice versa. |
Keyword | selfish atomic routing deterministic queuing adaptive routing subgame perfect equilibrium Nash equilibrium |
DOI | 10.1287/opre.2021.2105 |
Indexed By | SCI |
Language | 英语 |
Funding Project | Ministry of Science and Technology of China[2018AAA0101002] ; National Natural Science Foundation of China[11601022] ; National Natural Science Foundation of China[11971046] ; National Natural Science Foundation of China[71922003] ; National Natural Science Foundation of China[71871009] ; National Natural Science Foundation of China[71961137005] ; Young Elite Scientists Sponsorship Program by CAST[2018QNRC001] ; Chinese Academy of Sciences[XDA27010102] ; Chinese Academy of Sciences[ZDBS-LY-7008] |
WOS Research Area | Business & Economics ; Operations Research & Management Science |
WOS Subject | Management ; Operations Research & Management Science |
WOS ID | WOS:000708983500001 |
Publisher | INFORMS |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/59429 |
Collection | 应用数学研究所 |
Corresponding Author | Wang, Changjun |
Affiliation | 1.Beijing Jiaotong Univ, Sch Econ & Management, Beijing 100044, Peoples R China 2.Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England 3.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China 4.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China 5.Beijing Univ Technol, Coll Math, Fac Sci, Beijing 100124, Peoples R China |
Recommended Citation GB/T 7714 | Cao, Zhigang,Chen, Bo,Chen, Xujin,et al. Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents[J]. OPERATIONS RESEARCH,2021:17. |
APA | Cao, Zhigang,Chen, Bo,Chen, Xujin,&Wang, Changjun.(2021).Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents.OPERATIONS RESEARCH,17. |
MLA | Cao, Zhigang,et al."Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents".OPERATIONS RESEARCH (2021):17. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment