Mixed complementarity problems for robust optimization equilibrium in bimatrix game.
The author studies the problem of finding the robust optimization equilibrium of a bimatrix game in which each player attempts to minimize his own cost with either each player's cost matrix or his opponent's uncertain strategies. Let \(Y\), \(Z\) denote the sets of mixed strategies of Player one and Player two, \(D_A\), \(D_B\) be bounded sets of matrices and \(Y^U\), \(Z^U\) bounded sets of the opponents' strategies. Player one solves the problem \[ \min _{y \in Y}\max _{\tilde {A} \in D_A, \tilde {z} \in Z^U}(y^T\tilde {A}\tilde {z}). \tag{1} \] Player two solves the problem \[ \min _{z \in Z}\max _{\tilde {B} \in D_B, \tilde {y} \in Y^U}(\tilde {y}^T\tilde {B}z). \tag{2} \] A pair of strategies (\(\hat {y}, \hat {z}\)) which solve problems (1) and (2), respectively, is called a robust equilibrium for the players. The author proposes a method for finding strategies \(\hat {y}\), \(\hat {z}\) based on linear programming and solving a mixed complementarity problem, which can be solved by methods known from the literature. The proposed procedure reduces the computational complexity as compared with other methods known from the literature, which lead to solving the second-order cone complementarity problem. The last section of the paper contains numerical examples illustrating the theoretical results of the preceding sections.
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Robust Optimization Perspective on Stochastic Programming
- Efficient and Durable Decision Rules with Incomplete Information
- Equilibrium points in n -person games
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Formulation of Bayesian analysis for games with incomplete information
- Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
- scientific article; zbMATH DE number 5618680 (Why is no real title available?)
- scientific article; zbMATH DE number 2212211 (Why is no real title available?)
- Non-cooperative games
- Robust convex optimization
- Robust game theory
- Robust linear optimization under general norms.
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- Tractable approximations to robust conic optimization problems
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- scientific article; zbMATH DE number 5964918 (Why is no real title available?)
- Mixed complementarity problems for robust optimization equilibrium under \(l_1\cap l_\infty\)-norm
- Linear games and complementarity problems
- scientific article; zbMATH DE number 2212211 (Why is no real title available?)
This page was built for publication: Mixed complementarity problems for robust optimization equilibrium in bimatrix game.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928177)
