Speaker：Xujin Chen（Chinese Academy of Sciences）

Time：2021-07-08 10:00

Location：Conference Room 686 at the 6th floor of Shuli Building at Haiyun Campus

Abstract:

In this talk, we will discuss recent progress on the problem as to whether selfish agents can find a maximum flow in a given network.  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). Joint work with Zhigang Cao, Bo Chen, and Changjun Wang.