Foundations of Lexicographic Cooperative Game Theory

In the article dimensional lexicographic noncooperative games are defined for the players’ for which there exists a characteristic function . Some main features are proved of function in a lexicographic case. A lexicographic cooperative game is called a couple , where is a real vector-function on subsets and the following conditions are fulfilled =O; Such cooperative game is denoted by . imputation and its set is defined in game. It is proved that is nonempty and its full characterisation is given. Domination over set is defined. Thus, the main foundations are given, according to this, it is possible to explore the main principles of optimality.