Mixed complementarity problems for robust optimization equilibrium under \(l_1\cap l_\infty\)-norm
type: Item
instance of: scholarly article
title: Mixed complementarity problems for robust optimization equilibrium under \(l_1\cap l_\infty\)-norm
zbMATH Open document ID: 1293.91011
author: Gui-Mei Luo
published in: Journal of the Franklin Institute
publication date: 2014-08-15T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 6330761
zbMATH Keywords: robust optimization equilibrium
zbMATH Keywords: bimatrix game
zbMATH Keywords: mixed complementarity problem (MCP)
MaRDI profile type: Publication
full work available at URL: j.jfranklin.2013.10.004
OpenAlex ID: W1982679970
cites work: Robust game theory
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Robust linear optimization under general norms.
cites work: The Price of Robustness
cites work: Tractable approximations to robust conic optimization problems
cites work: A Robust Optimization Perspective on Stochastic Programming
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
cites work: Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
cites work: Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
cites work: Efficient and Durable Decision Rules with Incomplete Information
cites work: Q3183650
cites work: Robust optimization with applications to game theory
cites work: Robust Adversarial Risk Analysis: A Level-k Approach
cites work: Formulation of Bayesian analysis for games with incomplete information
cites work: Equilibrium points in n -person games
cites work: Non-cooperative games
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
DOI: 10.1016/J.JFRANKLIN.2013.10.004
Recommended article: Mixed complementarity problems for robust optimization equilibrium in bimatrix game.
Recommended article: Q4983756
Recommended article: Γ-robust linear complementarity problems
Recommended article: Q5084582
Recommended article: On \(\epsilon\)-solutions for robust semi-infinite optimization problems
Recommended article: Robustness and nondegenerateness for linear complementarity problems
Recommended article: Robust solution of monotone stochastic linear complementarity problems
Recommended article: Generalized mixed equilibria, variational inequalities and constrained convex minimization
Recommended article: OPTIMALITY CONDITIONS AND DUALITY IN NONDIFFERENTIABLE ROBUST OPTIMIZATION PROBLEMS
Recommended article: Solving generalized mixed equilibria, variational inequalities, and constrained convex minimization
description: scientific article; zbMATH DE number 6330761