Existence of Lexicographic Max-min Strategy For Pair-Valued Matrix Games
DOI:
https://doi.org/10.31224/7841Keywords:
pair-valued matrix game, lexicographic max-min, bi-level linear programmingAbstract
We prove the existence of a lexicographic max-min strategy for pair-valued matrix game. Such a strategy emerges from the solution of a two-level linear programming problem.
Downloads
Download data is not yet available.
Downloads
Posted
2026-08-04
License
Copyright (c) 2026 Somdeb Lahiri

This work is licensed under a Creative Commons Attribution 4.0 International License.