{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_52807"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_52807","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"VECTOR COST BIMATRIX GAMES FOR ADVERSARIAL MOTION PLANNING","abstract":"Thesis (M.S.)--Michigan State University. Electrical and Computer Engineering - Master of Science, 2025","abstract_html":"Thesis (M.S.)--Michigan State University. Electrical and Computer Engineering - Master of Science, 2025","abstract_has_math":false,"creators":["Toaz, Benjamin Ryan"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Bopardikar, Shaunak D","Morris, Daniel","Srivastava, Vaibhav"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-11-18T18:59:28Z","subjects":["Robotics"],"languages":["eng"],"rights":["Attribution-NoDerivatives 4.0 International"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:52807","local:Toaz_grad.msu_0128N_21827"],"render_values":[{"text":"etd:52807","href":null,"code":true},{"text":"local:Toaz_grad.msu_0128N_21827","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/me8y-dw26","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/me8y-dw26","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_52807","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bopardikar, Shaunak D","Morris, Daniel","Srivastava, Vaibhav"]},{"key":"dc:creator","label":"Author","values":["Toaz, Benjamin Ryan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["text","Electronic dissertations"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Robotics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NoDerivatives 4.0 International"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:52807","local:Toaz_grad.msu_0128N_21827","https://doi.org/doi:10.25335/me8y-dw26"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M.S.)--Michigan State University. Electrical and Computer Engineering - Master of Science, 2025","The vector cost bimatrix game is a method for multi-objective decision making that enables agents to optimize for multiple goals at once while avoiding the neglect of other objectives. We formulate this 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.We then expand this approach to arbitrary numbers of objectives and conduct an in-depth comparative study using state-of-the-art validation tools. Explainable Artificial Intelligence (XAI) software is used to aid in the analysis of high dimensional decision-making data. Statespace Exploration of Multidimensional Boundaries using Adherence Strategies (SEMBAS) is applied to explore performance modes in the parameter space as a sensitivity study for the baseline and proposed frameworks. While some works have explored aspects of game theoretic planning and autonomous vehicle validation separately, we combine each of these into a novel and comprehensive simulation pipeline. This integration demonstrates a dramatic improvement of the vector cost method over scalarization and offers an interpretable and generalizable framework for autonomous vehicle behavioral planning.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","1 online resource (53 p.) : ill."]},{"key":"dc:title","label":"Title","values":["VECTOR COST BIMATRIX GAMES FOR ADVERSARIAL MOTION PLANNING"]}]}],"canonical_facts":{"dc:contributor":["Bopardikar, Shaunak D","Morris, Daniel","Srivastava, Vaibhav"],"dc:creator":["Toaz, Benjamin Ryan"],"dc:date":["2025"],"dc:description":["Thesis (M.S.)--Michigan State University. Electrical and Computer Engineering - Master of Science, 2025","The vector cost bimatrix game is a method for multi-objective decision making that enables agents to optimize for multiple goals at once while avoiding the neglect of other objectives. We formulate this 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.We then expand this approach to arbitrary numbers of objectives and conduct an in-depth comparative study using state-of-the-art validation tools. Explainable Artificial Intelligence (XAI) software is used to aid in the analysis of high dimensional decision-making data. Statespace Exploration of Multidimensional Boundaries using Adherence Strategies (SEMBAS) is applied to explore performance modes in the parameter space as a sensitivity study for the baseline and proposed frameworks. While some works have explored aspects of game theoretic planning and autonomous vehicle validation separately, we combine each of these into a novel and comprehensive simulation pipeline. This integration demonstrates a dramatic improvement of the vector cost method over scalarization and offers an interpretable and generalizable framework for autonomous vehicle behavioral planning.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."],"dc:format":["application/pdf","1 online resource (53 p.) : ill."],"dc:identifier":["etd:52807","local:Toaz_grad.msu_0128N_21827","https://doi.org/doi:10.25335/me8y-dw26"],"dc:language":["eng"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["Attribution-NoDerivatives 4.0 International"],"dc:subject":["Robotics"],"dc:title":["VECTOR COST BIMATRIX GAMES FOR ADVERSARIAL MOTION PLANNING"],"dc:type":["text","Electronic dissertations"]},"updated_at":"2026-11-18T18:59:28Z"}