| Full text | |
| Author(s): |
da Silva, Francisco J. M.
;
Miyazawa, Flavio K.
;
Romero, Ieremies V. F.
;
Schouery, Rafael C. S.
Total Authors: 4
|
| Document type: | Journal article |
| Source: | JOURNAL OF COMBINATORIAL OPTIMIZATION; v. 46, n. 2, p. 20-pg., 2023-09-01. |
| Abstract | |
In this paper, we analyze a transportation game first introduced by Fotakis, Gourves, and Monnot in 2017, where players want to be transported to a common destination as quickly as possible and, to achieve this goal, they have to choose one of the available buses. We introduce a sequential version of this game and provide bounds for the Sequential Price of Stability and the Sequential Price of Anarchy in both metric and non-metric instances, considering three social cost functions: the total traveled distance by all buses, the maximum distance traveled by a bus, and the sum of the distances traveled by all players (a new social cost function that we introduce). Finally, we analyze the Price of Stability and the Price of Anarchy for this new function in simultaneous transportation games. (AU) | |
| FAPESP's process: | 17/05223-9 - Game-theoretic analysis of transportation problems |
| Grantee: | Francisco Jhonatas Melo da Silva |
| Support Opportunities: | Scholarships in Brazil - Master |
| FAPESP's process: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points |
| Grantee: | Flávio Keidi Miyazawa |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings |
| Grantee: | Reinaldo Morabito Neto |
| Support Opportunities: | Research Projects - Thematic Grants |