There are three types of discrete fixed point theorems: type M and type C deal with monotone mappings and contraction mappings, respectively. Type B is based on Brouwer's fixed point theorem. The main aim of this paper is to compare type B with type M by applying them to a bimatrix game. For this purpose we characterize the direction preserving condition that is used in type B in terms of the best response mappings of the bimatrix game. Further we extend the characterization to a non-cooperative n-person game.
|ジャーナル||Journal of Nonlinear and Convex Analysis|
|出版ステータス||出版済み - 2015|
!!!All Science Journal Classification (ASJC) codes