Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.05171 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911081114370048 |
|---|---|
| author | Toaz, Benjamin R. Bopardikar, Shaunak D. |
| author_facet | Toaz, Benjamin R. Bopardikar, Shaunak D. |
| contents | We formulate a vector cost alternative to the scalarization method for weighting and combining multi-objective costs. The algorithm produces solutions to bimatrix games that are simultaneously pure, unique Nash equilibria and Pareto optimal with guarantees for avoiding worst case outcomes. We achieve this by enforcing exact potential game constraints to guide cost adjustments towards equilibrium, while minimizing the deviation from the original cost structure. The magnitude of this adjustment serves as a metric for differentiating between Pareto optimal solutions. We implement this approach in a racing competition between agents with heterogeneous cost structures, resulting in fewer collision incidents with a minimal decrease in performance. Code is available at https://github.com/toazbenj/race_simulation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05171 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Vector Cost Bimatrix Games with Applications to Autonomous Racing Toaz, Benjamin R. Bopardikar, Shaunak D. Computer Science and Game Theory We formulate a vector cost alternative to the scalarization method for weighting and combining multi-objective costs. The algorithm produces solutions to bimatrix games that are simultaneously pure, unique Nash equilibria and Pareto optimal with guarantees for avoiding worst case outcomes. We achieve this by enforcing exact potential game constraints to guide cost adjustments towards equilibrium, while minimizing the deviation from the original cost structure. The magnitude of this adjustment serves as a metric for differentiating between Pareto optimal solutions. We implement this approach in a racing competition between agents with heterogeneous cost structures, resulting in fewer collision incidents with a minimal decrease in performance. Code is available at https://github.com/toazbenj/race_simulation. |
| title | Vector Cost Bimatrix Games with Applications to Autonomous Racing |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2507.05171 |