Timed Congestion Games with Application to Multi-Fleet Platoon Matching

Adrianto Ravi Ibrahim, Ahmet Cetinkaya, Masako Kishida

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication60th IEEE Conference on Decision and Control, CDC 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1677-1682
Number of pages6
ISBN (Electronic)9781665436595
DOIs
Publication statusPublished - 2021
Externally publishedYes
Event60th IEEE Conference on Decision and Control, CDC 2021 - Austin, United States
Duration: 2021 Dec 132021 Dec 17

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume2021-December
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference60th IEEE Conference on Decision and Control, CDC 2021
Country/TerritoryUnited States
CityAustin
Period21/12/1321/12/17

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Timed Congestion Games with Application to Multi-Fleet Platoon Matching'. Together they form a unique fingerprint.

Cite this