Mixed complementarity problems for robust optimization equilibrium in bimatrix game.
From MaRDI portal
Publication:1928177
DOI10.1007/s10492-012-0029-4zbMath1265.91003MaRDI QIDQ1928177
Publication date: 2 January 2013
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/142913
mixed complementarity problem; bimatrix game; robust optimization equilibrium; \(l_1\cap l_\infty \)-norm
90C46: Optimality conditions and duality in mathematical programming
90C05: Linear programming
91A05: 2-person games
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Cites Work
- Unnamed Item
- Unnamed Item
- Robust linear optimization under general norms.
- Formulation of Bayesian analysis for games with incomplete information
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Tractable approximations to robust conic optimization problems
- Robust game theory
- Non-cooperative games
- Robust Convex Optimization
- A Robust Optimization Perspective on Stochastic Programming
- The Price of Robustness
- Efficient and Durable Decision Rules with Incomplete Information
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Games with Incomplete Information Played by “Bayesian” Players Part II. Bayesian Equilibrium Points
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Equilibrium points in n -person games
