Complexity and Efficiency of Nash Equilibria in Noncooperative Simple Platoon Games

Adrianto Ravi Ibrahim, Ahmet Cetinkaya, Masako Kishida

研究成果: Conference contribution

抄録

We investigate the problem of platoon matching through the lens of complexity and efficiency. Specifically, we consider a noncooperative game among a number of vehicles that decide to form or not to form a platoon on a single road. To characterize the computational complexity of calculating the Nash equilibria in this game, we obtain a general upper bound for the length of any best response sequence. Then, we completely characterize the Nash equilibrium when the vehicles are interchangeable. Regarding the efficiency, we show that platooning games can be very inefficient in the worst case, as they can always have zero price of anarchy even when the vehicles have the same cost function.

本文言語English
ホスト出版物のタイトル2022 IEEE 61st Conference on Decision and Control, CDC 2022
出版社Institute of Electrical and Electronics Engineers Inc.
ページ4449-4454
ページ数6
ISBN(電子版)9781665467612
DOI
出版ステータスPublished - 2022
イベント61st IEEE Conference on Decision and Control, CDC 2022 - Cancun, Mexico
継続期間: 2022 12月 62022 12月 9

出版物シリーズ

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

Conference

Conference61st IEEE Conference on Decision and Control, CDC 2022
国/地域Mexico
CityCancun
Period22/12/622/12/9

ASJC Scopus subject areas

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

フィンガープリント

「Complexity and Efficiency of Nash Equilibria in Noncooperative Simple Platoon Games」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル