Bounding Residence Times for Atomic Dynamic Routings

doi:10.1287/moor.2021.1242

	Bounding Residence Times for Atomic Dynamic Routings
	Cao, Zhigang 1; Chen, Bo 2; Chen, Xujin 3,4; Wang, Changjun 3
刊名	MATHEMATICS OF OPERATIONS RESEARCH
	2022-02-17
页码	22
关键词	atomic dynamic routing residence time token technique selfish routing Nash equilibrium
ISSN号	0364-765X
DOI	10.1287/moor.2021.1242
英文摘要	In this paper, we are concerned with bounding agents' residence times in the network for a broad class of atomic dynamic routings. We explore novel token techniques to circumvent direct analysis on complicated chain effects of dynamic routing choices. Even though agents may enter the network over time for an infinite number of periods, we prove that under a mild condition, the residence time of every agent is upper bounded (by a network-dependent constant plus the total number of agents inside the network at the entry time of the agent). Applying this result to three game models of atomic dynamic routing in the recent literature, we establish that the residence times of selfish agents in a series-parallel network with a single origin-destination pair are upper bounded at equilibrium, provided the number of incoming agents at each time point does not exceed the network capacity (i.e., the smallest total capacity of edges in the network whose removal separates the origin from the destination).
资助项目	Ministry of Science and Technology of the People's Republic of China[2018AAA0101002] ; National Natural Science Foundation of China[72192804] ; National Natural Science Foundation of China[11971046] ; National Natural Science Foundation of China[71871009] ; National Natural Science Foundation of China[71922003] ; Chinese Academy of Sciences[XDA27000000] ; Chinese Academy of Sciences[ZDBS-LY-7008] ; Young Elite Scientists Sponsorship Programby CAST[2018QNRC001]
WOS研究方向	Operations Research & Management Science ; Mathematics
语种	英语
出版者	INFORMS
WOS记录号	WOS:000804386100001
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/61484]
专题	中国科学院数学与系统科学研究院
通讯作者	Wang, Changjun
作者单位	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
推荐引用方式 GB/T 7714	Cao, Zhigang,Chen, Bo,Chen, Xujin,et al. Bounding Residence Times for Atomic Dynamic Routings[J]. MATHEMATICS OF OPERATIONS RESEARCH,2022:22.
APA	Cao, Zhigang,Chen, Bo,Chen, Xujin,&Wang, Changjun.(2022).Bounding Residence Times for Atomic Dynamic Routings.MATHEMATICS OF OPERATIONS RESEARCH,22.
MLA	Cao, Zhigang,et al."Bounding Residence Times for Atomic Dynamic Routings".MATHEMATICS OF OPERATIONS RESEARCH (2022):22.