Shared lexicographic equilibrium strategy profile for a finite number of pair-valued bi-matrix games

Abstract

We show that a strategy profile is a lexicographic equilibrium strategy profile for an arbitrary finite set of pair-valued bi-matrix games if and only if it solves a bi-linear programming problem and the optimal value pair of the bi-linear programming problem is zero.  An immediate consequence of this result, is that if the outcome matrix for the row player is a convex combination of its outcome matrices in the finite collection and the outcome matrix for the column player is a (possibly different) convex combination of its outcome matrices in the finite collection, then a strategy profile is a lexicographic equilibrium strategy profile for the game associated with pair of pair-valued matrices if and only if it satisfies the same two conditions.