Abstract
In this paper, we investigate the bimatrix game using the robust optimization approach, in which each player may neither exactly estimate his opponent’s strategies nor evaluate his own cost matrix accurately while he may estimate a bounded uncertain set. We obtain computationally tractable robust formulations which turn to be linear programming problems and then solving a robust optimization equilibrium can be converted to solving a mixed complementarity problem under the l 1 ∩ l ∞-norm. Some numerical results are presented to illustrate the behavior of the robust optimization equilibrium.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Aghassi, D. Bertsimas: Robust game theory. Math. Program. 107 (2006), 231–273.
A. Ben-Tal, A. Nemirovski: Robust convex optimization. Math. Oper. Res. 23 (1998), 769–805.
A. Ben-Tal, A. Nemirovski: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25 (1999), 1–13.
A. Ben-Tal, A. Nemirovski: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88 (2000), 411–424.
D. Bertsimas, D. Pachamanova, M. Sim: Robust linear optimization under general norms. Oper. Res. Lett. 32 (2004), 510–516.
D. Bertsimas, M. Sim: The price of robustness. Oper. Res. 52 (2004), 35–53.
D. Bertsimas, M. Sim: Tractable approximations to robust conic optimization problems. Math. Program. 107 (2006), 5–36.
X. Chen, M. Sim, P. Sun: A robust optimization perspective of stochastic programming. Oper. Res. 55 (2007), 1058–1071.
L. El Ghaoui, F. Oustry, H. Lebret: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18 (1997), 1035–1064.
L. El Ghaoui, F. Oustry, H. Lebret: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9 (1998), 33–52.
F. Facchinei, J. S. Pang: Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. I. Springer, New York, 2003.
S. Hayashi, N. Yamashita, M. Fukushima: A combined smoothing and regularization method for monotone second-order cone complementarity problems. SIAM J. Optim. 15 (2005), 593–615.
S. Hayashi, N. Yamashita, M. Fukushima: Robust Nash equilibria and second-order cone complementarity problems. J. Nonlinear. Convex Anal. 6 (2005), 283–296.
J.C. Harsanyi: Games with incomplete information played by “Bayesian” playes, Part II. Manage. Sci. 14 (1968), 320–334.
B. Holmström, R. Myerson: Efficient and durable decision rules with incomplete information. Econometrica 51 (1983), 1799–1820.
G.M. Luo, D.H. Li: Robust optimization equilibrium with deviation measures. Pac. J. Optim. 5 (2009), 427–441.
J. Mertens, S. Zamir: Formualation of Bayesian analysis for games with incomplete information. Int. J. Game Theory 14 (1985), 1–29.
J.F. Nash jun.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. USA 36 (1950), 48–49.
J. Nash: Non-cooperative games. Ann. Math. 54 (1951), 286–295.
A. L. Soyster: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21 (1973), 1154–1157.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the Major Project of the Ministry of Education of China granted 309023.
Rights and permissions
About this article
Cite this article
Luo, G. Mixed complementarity problems for robust optimization equilibrium in bimatrix game. Appl Math 57, 503–520 (2012). https://doi.org/10.1007/s10492-012-0029-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10492-012-0029-4