TY - GEN
T1 - Timed Congestion Games with Application to Multi-Fleet Platoon Matching
AU - Ibrahim, Adrianto Ravi
AU - Cetinkaya, Ahmet
AU - Kishida, Masako
N1 - Funding Information:
This work is supported by JST ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603); A. Ravi Ibrahim, A. Cetinkaya, and M. Kishida are with the National Institute of Informatics, 100-0003 Tokyo, Japan. a r ibrahim@nii.ac.jp, cetinkaya@nii.ac.jp, kishida@nii.ac.jp
Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - This paper introduces the notion of timed congestion games with agent-specific benefit functions to solve the problem of multi-route multi-fleet platoon matching. The fact that the timed congestion game with agent-specific benefit functions is isomorphic to the congestion game with agent-specific benefit functions is shown. Furthermore, two subclasses of the timed congestion game with agent-specific benefit functions are shown to possess a Nash equilibrium. In addition, in both subclasses, every best response sequence is proven to have finite length. Then, the theoretical results on the timed congestion game with agent-specific benefit functions are applied to the problem of multi-route multi-fleet platoon matching. We illustrate our approach with a numerical example.
AB - This paper introduces the notion of timed congestion games with agent-specific benefit functions to solve the problem of multi-route multi-fleet platoon matching. The fact that the timed congestion game with agent-specific benefit functions is isomorphic to the congestion game with agent-specific benefit functions is shown. Furthermore, two subclasses of the timed congestion game with agent-specific benefit functions are shown to possess a Nash equilibrium. In addition, in both subclasses, every best response sequence is proven to have finite length. Then, the theoretical results on the timed congestion game with agent-specific benefit functions are applied to the problem of multi-route multi-fleet platoon matching. We illustrate our approach with a numerical example.
UR - http://www.scopus.com/inward/record.url?scp=85126001822&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85126001822&partnerID=8YFLogxK
U2 - 10.1109/CDC45484.2021.9683535
DO - 10.1109/CDC45484.2021.9683535
M3 - Conference contribution
AN - SCOPUS:85126001822
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 1677
EP - 1682
BT - 60th IEEE Conference on Decision and Control, CDC 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 60th IEEE Conference on Decision and Control, CDC 2021
Y2 - 13 December 2021 through 17 December 2021
ER -