Abstract
An atomic routing game is a multiplayer game on a directed graph. Each player in the game chooses a path - a sequence of links that connect its origin node to its destination node - with the lowest cost, where the cost of each link is a function of all players' choices. We develop a novel numerical method to design the link cost function in atomic routing games such that the players' choices at the Nash equilibrium minimize a given smooth performance function. This method first approximates the nonsmooth Nash equilibrium conditions with smooth ones, then iteratively improves the link cost function via implicit differentiation. We demonstrate the application of this method to atomic routing games that model noncooperative agents navigating in grid worlds.
| Original language | English (US) |
|---|---|
| Title of host publication | 2023 American Control Conference, ACC 2023 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1704-1709 |
| Number of pages | 6 |
| ISBN (Electronic) | 9798350328066 |
| DOIs | |
| State | Published - 2023 |
| Externally published | Yes |
| Event | 2023 American Control Conference, ACC 2023 - San Diego, United States Duration: May 31 2023 → Jun 2 2023 |
Publication series
| Name | Proceedings of the American Control Conference |
|---|---|
| Volume | 2023-May |
| ISSN (Print) | 0743-1619 |
Conference
| Conference | 2023 American Control Conference, ACC 2023 |
|---|---|
| Country/Territory | United States |
| City | San Diego |
| Period | 5/31/23 → 6/2/23 |
Bibliographical note
Publisher Copyright:© 2023 American Automatic Control Council.