Vector Cost Bimatrix Game Analysis

• Vector Cost Bimatrix Game is a two-player model that represents outcomes with multi-objective, vector-valued costs to balance competing criteria.
• The approach filters strategies to identify moderate Pareto optimal policies, avoiding worst-case outcomes across prioritized objectives.
• An exact-potential adjustment mechanism transforms a moderate Pareto policy into a unique Nash equilibrium, applicable in domains like autonomous racing.

Searching arXiv for recent and related papers on vector-cost bimatrix games and connected bimatrix-game structure. arxiv_search(query="Vector Cost Bimatrix Games autonomous racing bimatrix game Pareto potential game", max_results=10) arxiv_search(query="vector cost bimatrix games", max_results=10) arxiv_search(query="rank-1 bimatrix games polynomial time equilibrium", max_results=10) A vector cost bimatrix game is a two-player simultaneous-action game in which each action pair yields a vector-valued cost rather than a single scalar payoff or cost. In the recent literature, the term denotes a multi-objective decision framework designed to preserve separate objectives long enough to select actions that are Pareto reasonable while excluding policies that are worst-case in any neglected objective, and then to align equilibrium behavior with those robust choices through potential-game-based cost adjustment (Toaz et al., 7 Jul 2025, Toaz et al., 21 Nov 2025). The formulation arose in autonomous racing and behavioral planning, where progress, boundary adherence, and collision-related criteria must be balanced without the failure mode of weighted-sum scalarization: achieving a good aggregate score while producing a worst-case outcome in one objective (Toaz et al., 21 Nov 2025).

1. Formal setup and object of study

In the generalized formulation, there are two players with discrete action sets

$U_1 := \{1,\dots,n\}, \qquad U_2 := \{1,\dots,m\},$

and pure policies

$\gamma \in U_1,\qquad \sigma \in U_2.$

For each player $i\in\{1,2\}$ and each objective $h\in[1,\ldots,g]$, the game has a component cost matrix

$C_i^h \in \mathbb{R}^{n\times m}.$

The full multi-objective cost structure is written as

$$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$

where $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$ is the vector-valued outcome. The objectives are explicitly ordered by priority, with $C_i^1$ highest priority and $C_i^g$ lowest (Toaz et al., 21 Nov 2025).

The earlier two-objective formulation specialized this structure to

$$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$

with a competitive component satisfying

$\gamma \in U_1,\qquad \sigma \in U_2.$0

and a shared or safety-related component $\gamma \in U_1,\qquad \sigma \in U_2.$1 assumed to admit an exact potential function $\gamma \in U_1,\qquad \sigma \in U_2.$2 (Toaz et al., 7 Jul 2025). In that formulation, the game remained a bimatrix game in the normal-form sense, but each matrix entry encoded a 2D cost vector rather than a single scalar cost.

The explicit purpose of the construction is not merely multi-criteria representation. It is to provide a decision rule for player 1 that preserves the multi-objective structure, selects actions that are Pareto reasonable, and avoids the worst-case neglect that can arise when multiple objectives are compressed into a single weighted sum (Toaz et al., 21 Nov 2025).

2. Scalarization baseline and the moderate Pareto criterion

The scalar baseline compresses the $\gamma \in U_1,\qquad \sigma \in U_2.$3 objectives into one matrix:

$\gamma \in U_1,\qquad \sigma \in U_2.$4

with

$\gamma \in U_1,\qquad \sigma \in U_2.$5

In the two-objective version this appears as

$\gamma \in U_1,\qquad \sigma \in U_2.$6

The critique is precise: weighted sums can optimize some objectives “at the expense of others,” are “less robust to worst-case scenarios,” and may hide bad outcomes in one dimension when the chosen $\gamma \in U_1,\qquad \sigma \in U_2.$7 is poorly tuned or environmental conditions change (Toaz et al., 21 Nov 2025).

The vector-cost alternative therefore evaluates actions in the original objective space before any final scalar adjustment. For fixed opponent action $\gamma \in U_1,\qquad \sigma \in U_2.$8, the set of Pareto optimal policies for player 1 is

$\gamma \in U_1,\qquad \sigma \in U_2.$9

The operator $i\in\{1,2\}$0 is used as a vector comparison operator meaning that the candidate is no worse in all objectives and better in at least one. The set of policies producing worst-case outcomes in at least one objective is

$i\in\{1,2\}$1

Fixing player 2’s action as a security policy $i\in\{1,2\}$2, the set of moderate Pareto optimal policies is

$i\in\{1,2\}$3

This is the central compromise notion: not merely Pareto efficiency, but Pareto efficiency after excluding any action that is worst-case in at least one objective (Toaz et al., 21 Nov 2025).

In the two-objective paper, the same idea appears as

$i\in\{1,2\}$4

so the target action is explicitly “moderate”: Pareto-optimal but not an extreme worst-case policy in either component (Toaz et al., 7 Jul 2025).

3. Security policies, Nash equilibrium, and exact-potential adjustment

The vector-cost method does not stop at identifying a moderate Pareto set. Its distinctive move is to turn one such action into an equilibrium outcome. The construction begins by fixing player 2’s policy as a scalar security policy:

$i\in\{1,2\}$5

In the two-objective setting, player 1 then adjusts only its competitive matrix $i\in\{1,2\}$6 by an error matrix $i\in\{1,2\}$7, defining

$i\in\{1,2\}$8

while in the generalized setting the adjusted scalar matrix is written

$i\in\{1,2\}$9

The target row $h\in[1,\ldots,g]$0 is chosen from the moderate Pareto set and the target column $h\in[1,\ldots,g]$1 is chosen as player 2’s security policy $h\in[1,\ldots,g]$2 (Toaz et al., 7 Jul 2025, Toaz et al., 21 Nov 2025).

The key optimization problem is to find the smallest adjustment $h\in[1,\ldots,g]$3 in Frobenius norm such that the resulting game becomes an exact potential game with a unique global minimum at $h\in[1,\ldots,g]$4:

$h\in[1,\ldots,g]$5

In the two-objective presentation the same construction is written with $h\in[1,\ldots,g]$6 and $h\in[1,\ldots,g]$7, and the strict positivity condition is implemented numerically with a very small slack $h\in[1,\ldots,g]$8 (Toaz et al., 7 Jul 2025).

This mechanism uses a standard property of exact potential games: a global minimum of the potential corresponds to a Nash equilibrium. By forcing a unique global minimum, the method forces a pure, unique Nash equilibrium. The standard Nash equilibrium condition employed in the generalized paper is

$h\in[1,\ldots,g]$9

Theorem 1 states that the algorithm output $C_i^h \in \mathbb{R}^{n\times m}.$0 is both a pair of security policies and a Nash equilibrium for the adjusted game (Toaz et al., 21 Nov 2025).

A further structural condition governs whether a chosen minimum $C_i^h \in \mathbb{R}^{n\times m}.$1 is feasible. Using pairwise row differences of $C_i^h \in \mathbb{R}^{n\times m}.$2, Theorem 2 requires

$C_i^h \in \mathbb{R}^{n\times m}.$3

This ensures that the selected column $C_i^h \in \mathbb{R}^{n\times m}.$4 can be the global minimum position in the potential row $C_i^h \in \mathbb{R}^{n\times m}.$5. Feasibility therefore depends strongly on player 2’s fixed cost topography rather than solely on player 1’s preferred Pareto candidate (Toaz et al., 21 Nov 2025).

4. Generalization to arbitrary objectives and algorithmic structure

The 2025 vector-cost paper treated two costs explicitly. The later behavioral-planning paper states that the extension to arbitrary $C_i^h \in \mathbb{R}^{n\times m}.$6 is straightforward because the adjustment step still uses only the prime objective $C_i^h \in \mathbb{R}^{n\times m}.$7; the change lies in Pareto filtering across all objectives. Its summary is explicit: “the only required step to scale from two objectives to any number is to update the Pareto optimality calculation for each additional cost type. The adjustment algorithm will use the prime objective $C_i^h \in \mathbb{R}^{n\times m}.$8 for the creation of the Nash equilibrium policy regardless of the number $C_i^h \in \mathbb{R}^{n\times m}.$9 objectives” (Toaz et al., 21 Nov 2025).

The resulting procedure is:

1. Input $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$0.
2. Compute player 2’s security policy:

$$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$1

1. For each candidate row $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$2, solve the adjustment problem with target minimum $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$3 and keep the solution with smallest $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$4.
2. If a finite $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$5 is found, compute

$$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$6

otherwise fall back to scalarization,

$$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$7

This makes clear that the generalization is not a new equilibrium concept for $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$8-objective games. It is a scalable selection-and-adjustment procedure: multi-objective filtering through $$C_i= \begin{bmatrix} C_i^1\ \vdots\ C_i^g \end{bmatrix}, \qquad J_i(\gamma,\sigma)= \begin{bmatrix} C_i^1(\gamma,\sigma)\ \vdots\ C_i^g(\gamma,\sigma) \end{bmatrix},$$9, $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$0, and $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$1, followed by potential-game mechanism design using $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$2 (Toaz et al., 21 Nov 2025).

The method is computationally more expensive than scalarization. The generalized paper reports time complexity

$J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$3

for scalarization and

$J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$4

for the vector approach. The earlier implementation paper describes the core step as a convex optimization problem and reports that, for square matrices $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$5, the optimized implementation exhibits empirical complexity approximately

$J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$6

which it states is suitable for small action spaces in real time (Toaz et al., 21 Nov 2025, Toaz et al., 7 Jul 2025).

The same papers also state several algorithmic constraints. The method is two-player only, uses discrete action spaces, may fail to find a finite $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$7, and then falls back to scalarization. It also provides no general closed-form solution for $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$8; the convex program is solved numerically for each candidate minimum (Toaz et al., 21 Nov 2025).

5. Autonomous racing, validation, and interpretability

The principal application domain is competitive robotic motion planning. In the later paper, validation is carried out in a two-player racing/overtaking scenario on a circular road: player 1 is the attacker and starts behind, player 2 is the defender and starts ahead, and the attacker must pass the defender while staying in bounds and avoiding collision. The game is embedded as a repeated behavioral planner over 30 rounds, with both vehicles choosing among 9 static trajectories at each decision epoch. The simulator uses the kinematic bicycle model, vehicle size is 4 m length, 2 m width, the circular track has outer radius 40 m and inner radius 25 m, and the attacker’s maximum speed is 50% greater than the defender’s (Toaz et al., 21 Nov 2025).

In this setting the generalized paper uses $J_i(\gamma,\sigma)\in\mathbb{R}^{g\times 1}$9 objectives: progress toward overtaking, boundary adherence, and proximity or collision risk. The final smooth cost design is

$C_i^1$0

The earlier two-objective paper instead grouped undesirable event penalties, including leaving the track and intersecting trajectories, into $C_i^1$1, while retaining competitive progress in $C_i^1$2. Its game is intentionally heterogeneous: player 1 uses vector-cost equilibrium shaping and player 2 uses scalarized security policies (Toaz et al., 7 Jul 2025, Toaz et al., 21 Nov 2025).

The empirical findings are substantial. In the generalized study, across a grid search of 500 races per method, four spawn configurations, and $C_i^1$3 attacker-weight combinations, aggregate results from Table I were: passes 318 vs 448 in favor of scalar vs vector, out-of-bounds 120 vs 50, collisions 0 vs 0, average minimum distance $C_i^1$4 m vs $C_i^1$5 m, average progress cost $C_i^1$6 vs $C_i^1$7, average bounds cost $C_i^1$8 vs $C_i^1$9, average proximity cost $C_i^g$0 vs $C_i^g$1, and proportion in lead $C_i^g$2 vs $C_i^g$3. The same paper reports that SEMBAS boundary-volume analysis consistently gave larger successful performance-mode volumes for the vector method, with several entries reaching 1.0, meaning no failure boundary was found within the sample budget (Toaz et al., 21 Nov 2025).

The earlier racing paper reported that the optimization found a viable global minimum in 49.15% of decision epochs and otherwise defaulted to scalarization. In Scenario II, where player 1 used the vector-cost method as attacker and player 2 used scalarization as defender, collisions dropped from 55 to 21, which the paper interpreted as a 62% decrease in collision rate, while attacker lead time dropped from 64% to 58% and attacker average laps from 1.61 to 1.51. The paper also notes that off-track incidents increased, partly because collision penalties were set higher than off-track penalties, so in some situations the method preferred leaving the track to colliding (Toaz et al., 7 Jul 2025).

The validation strategy in the later paper also includes XAI and sensitivity analysis. SHAP was applied to high-dimensional tabular data of about 15,000 features gathered across rounds to analyze attacker action choice, pass success, out-of-bounds outcomes, and minimum distance to the opponent. A recurring finding was that attacker speed $C_i^g$4 was highly influential, scalarization concentrated importance on a smaller feature set, and the vector method spread importance more broadly. This spread was quantified by Shannon entropy of SHAP importance: scalar attacker $C_i^g$5 nats and $C_i^g$6 nats in two experiments, versus vector attacker $C_i^g$7 nats and $C_i^g$8 nats. The same study cautiously interpreted higher entropy as suggesting greater robustness, while noting that the interpretation is not straightforward (Toaz et al., 21 Nov 2025).

6. Relation to scalar bimatrix-game theory, limitations, and open directions

Vector cost bimatrix games differ sharply from several established scalar-payoff subclasses of bimatrix games. Unit vector games are scalar bimatrix games in which every column of one player’s payoff matrix is a standard basis vector $C_i^g$9; this structure collapses equilibrium analysis to a single labeled polytope, but it does not provide a multi-objective cost model (Savani et al., 2015). Rank-based bimatrix-game research studies scalar games through the matrix rank of $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$0, especially rank-1 cases and strategic equivalence to rank-1 games, yielding polynomial-time algorithms, homeomorphism results, and rank-reduction procedures for scalar equilibria rather than vector-valued costs (Adsul et al., 2010, Adsul et al., 2018, Heyman, 2019, Heyman et al., 2019). Two-person additively-separable sum games likewise remain scalar: $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$1 and $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$2, with an LP characterization of mixed equilibria, but no Pareto or vector-cost equilibrium notion (Lahiri, 25 Jul 2025). These literatures are related because they concern bimatrix structure, equilibrium computation, and tractable subclasses, but they are not direct substitutes for vector-cost behavioral planning.

The current vector-cost formulation also has explicit limits. The generalized paper states: two-player only, discrete action spaces, optimization may fail, convergence depends on cost topography, practical effectiveness is concentrated in critical regions, higher computational cost, no general closed-form solution for $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$3, and incomplete formalization of some details such as the Pareto operator $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$4 and parts of the surrogate-model or SHAP pipeline (Toaz et al., 21 Nov 2025). The earlier paper adds that only two costs were treated explicitly there, player 1’s costs were adjusted while player 2’s scalarized costs were fixed, feasibility depends on the row-difference condition on $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$5, and real-time suitability is limited to small action spaces (Toaz et al., 7 Jul 2025).

The natural extensions are already indicated in the literature. The later work generalizes from two objectives to arbitrary $$J_i(\gamma,\sigma)= \big(A_i(\gamma,\sigma), B_i(\gamma,\sigma)\big),$$6, and the earlier work explicitly suggests extensions to more than two costs and more than two players (Toaz et al., 7 Jul 2025, Toaz et al., 21 Nov 2025). A plausible implication, consistent with the stated dependence on cost topography, is that increasing the number of objectives may make the moderate Pareto set sparser and the adjustment step harder to satisfy. Even so, the existing formulation already establishes a distinctive template: preserve vector costs, exclude objective-wise worst cases, and use exact-potential mechanism design to make a moderate Pareto policy coincide with a pure equilibrium.