Displaying similar documents to “Mixed complementarity problems for robust optimization equilibrium in bimatrix game”

Split of an Optimization Variable in Game Theory

R. Aboulaich, A. Habbal, N. Moussaid (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

In the present paper, a general multiobjective optimization problem is stated as a Nash game. In the nonrestrictive case of two objectives, we address the problem of the splitting of the design variable between the two players. The so-called territory splitting problem is solved by means of an allocative approach. We propose two algorithms in order to find fair allocation tables

Interval valued bimatrix games

Milan Hladík (2010)

Kybernetika

Similarity:

Payoffs in (bimatrix) games are usually not known precisely, but it is often possible to determine lower and upper bounds on payoffs. Such interval valued bimatrix games are considered in this paper. There are many questions arising in this context. First, we discuss the problem of existence of an equilibrium being common for all instances of interval values. We show that this property is equivalent to solvability of a certain linear mixed integer system of equations and inequalities....

An open toss problem.

Bajaj, Prem N., Mendieta, G.R. (1993)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Fast computation of the leastcore and prenucleolus of cooperative games

Joseph Frédéric Bonnans, Matthieu André (2008)

RAIRO - Operations Research

Similarity:

The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among players. It has, however, the drawback being a linear programming problem with 2 - 2 constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially...