Timed Congestion Games with Application to Multi-Fleet Platoon Matching

Adrianto Ravi Ibrahim, Ahmet Cetinkaya, Masako Kishida

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトル60th IEEE Conference on Decision and Control, CDC 2021
出版社Institute of Electrical and Electronics Engineers Inc.
ページ1677-1682
ページ数6
ISBN(電子版)9781665436595
DOI
出版ステータスPublished - 2021
外部発表はい
イベント60th IEEE Conference on Decision and Control, CDC 2021 - Austin, United States
継続期間: 2021 12月 132021 12月 17

出版物シリーズ

名前Proceedings of the IEEE Conference on Decision and Control
2021-December
ISSN(印刷版)0743-1546
ISSN(電子版)2576-2370

Conference

Conference60th IEEE Conference on Decision and Control, CDC 2021
国/地域United States
CityAustin
Period21/12/1321/12/17

ASJC Scopus subject areas

  • 制御およびシステム工学
  • モデリングとシミュレーション
  • 制御と最適化

フィンガープリント

「Timed Congestion Games with Application to Multi-Fleet Platoon Matching」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル