Vector Cost Bimatrix Games with Applications to Autonomous Racing Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2507.05171
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.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2507.05171
- https://arxiv.org/pdf/2507.05171
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W4414687842
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4414687842Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2507.05171Digital Object Identifier
- Title
-
Vector Cost Bimatrix Games with Applications to Autonomous RacingWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-07-07Full publication date if available
- Authors
-
Benjamin R. Toaz, Shaunak D. BopardikarList of authors in order
- Landing page
-
https://arxiv.org/abs/2507.05171Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2507.05171Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2507.05171Direct OA link when available
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W4414687842 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2507.05171 |
| ids.doi | https://doi.org/10.48550/arxiv.2507.05171 |
| ids.openalex | https://openalex.org/W4414687842 |
| fwci | |
| type | preprint |
| title | Vector Cost Bimatrix Games with Applications to Autonomous Racing |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T11106 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9424999952316284 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1711 |
| topics[0].subfield.display_name | Signal Processing |
| topics[0].display_name | Data Management and Algorithms |
| topics[1].id | https://openalex.org/T11574 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9283999800682068 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Artificial Intelligence in Games |
| topics[2].id | https://openalex.org/T10317 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9165999889373779 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1705 |
| topics[2].subfield.display_name | Computer Networks and Communications |
| topics[2].display_name | Advanced Database Systems and Queries |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2507.05171 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2507.05171 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2507.05171 |
| locations[1].id | doi:10.48550/arxiv.2507.05171 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2507.05171 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5119790535 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Benjamin R. Toaz |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Toaz, Benjamin R. |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5032061347 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-0813-7867 |
| authorships[1].author.display_name | Shaunak D. Bopardikar |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Bopardikar, Shaunak D. |
| authorships[1].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2507.05171 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Vector Cost Bimatrix Games with Applications to Autonomous Racing |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T11106 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9424999952316284 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1711 |
| primary_topic.subfield.display_name | Signal Processing |
| primary_topic.display_name | Data Management and Algorithms |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2507.05171 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2507.05171 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2507.05171 |
| primary_location.id | pmh:oai:arXiv.org:2507.05171 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2507.05171 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2507.05171 |
| publication_date | 2025-07-07 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 2, 71, 84, 99 |
| abstract_inverted_index.We | 0, 40, 79 |
| abstract_inverted_index.as | 70 |
| abstract_inverted_index.at | 107 |
| abstract_inverted_index.by | 43 |
| abstract_inverted_index.in | 83, 94, 102 |
| abstract_inverted_index.is | 105 |
| abstract_inverted_index.of | 66 |
| abstract_inverted_index.to | 6, 20, 49 |
| abstract_inverted_index.The | 16, 64 |
| abstract_inverted_index.and | 12, 30 |
| abstract_inverted_index.are | 24 |
| abstract_inverted_index.for | 10, 35, 73 |
| abstract_inverted_index.the | 7, 57, 60 |
| abstract_inverted_index.Code | 104 |
| abstract_inverted_index.Nash | 28 |
| abstract_inverted_index.case | 38 |
| abstract_inverted_index.cost | 4, 51, 62, 91 |
| abstract_inverted_index.from | 59 |
| abstract_inverted_index.game | 47 |
| abstract_inverted_index.that | 23 |
| abstract_inverted_index.this | 42, 67, 81 |
| abstract_inverted_index.with | 33, 89, 98 |
| abstract_inverted_index.exact | 45 |
| abstract_inverted_index.fewer | 95 |
| abstract_inverted_index.games | 22 |
| abstract_inverted_index.guide | 50 |
| abstract_inverted_index.pure, | 26 |
| abstract_inverted_index.while | 55 |
| abstract_inverted_index.worst | 37 |
| abstract_inverted_index.Pareto | 31, 76 |
| abstract_inverted_index.agents | 88 |
| abstract_inverted_index.costs. | 15 |
| abstract_inverted_index.method | 9 |
| abstract_inverted_index.metric | 72 |
| abstract_inverted_index.racing | 85 |
| abstract_inverted_index.serves | 69 |
| abstract_inverted_index.unique | 27 |
| abstract_inverted_index.vector | 3 |
| abstract_inverted_index.achieve | 41 |
| abstract_inverted_index.between | 75, 87 |
| abstract_inverted_index.minimal | 100 |
| abstract_inverted_index.optimal | 32, 77 |
| abstract_inverted_index.towards | 53 |
| abstract_inverted_index.approach | 82 |
| abstract_inverted_index.avoiding | 36 |
| abstract_inverted_index.bimatrix | 21 |
| abstract_inverted_index.decrease | 101 |
| abstract_inverted_index.original | 61 |
| abstract_inverted_index.produces | 18 |
| abstract_inverted_index.algorithm | 17 |
| abstract_inverted_index.available | 106 |
| abstract_inverted_index.collision | 96 |
| abstract_inverted_index.combining | 13 |
| abstract_inverted_index.deviation | 58 |
| abstract_inverted_index.enforcing | 44 |
| abstract_inverted_index.formulate | 1 |
| abstract_inverted_index.implement | 80 |
| abstract_inverted_index.incidents | 97 |
| abstract_inverted_index.magnitude | 65 |
| abstract_inverted_index.outcomes. | 39 |
| abstract_inverted_index.potential | 46 |
| abstract_inverted_index.resulting | 93 |
| abstract_inverted_index.solutions | 19 |
| abstract_inverted_index.weighting | 11 |
| abstract_inverted_index.adjustment | 68 |
| abstract_inverted_index.equilibria | 29 |
| abstract_inverted_index.guarantees | 34 |
| abstract_inverted_index.minimizing | 56 |
| abstract_inverted_index.solutions. | 78 |
| abstract_inverted_index.structure. | 63 |
| abstract_inverted_index.adjustments | 52 |
| abstract_inverted_index.alternative | 5 |
| abstract_inverted_index.competition | 86 |
| abstract_inverted_index.constraints | 48 |
| abstract_inverted_index.structures, | 92 |
| abstract_inverted_index.equilibrium, | 54 |
| abstract_inverted_index.performance. | 103 |
| abstract_inverted_index.heterogeneous | 90 |
| abstract_inverted_index.scalarization | 8 |
| abstract_inverted_index.simultaneously | 25 |
| abstract_inverted_index.differentiating | 74 |
| abstract_inverted_index.multi-objective | 14 |
| abstract_inverted_index.https://github.com/toazbenj/race_simulation. | 108 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile |