Open AccessFoundations of Lexicographic Cooperative Game Theory
Author(s) -
Guram N. Beltadze
Publication year - 2013
Publication title -
international journal of modern education and computer science
Language(s) - English
Resource type - Journals
eISSN - 2075-017X
pISSN - 2075-0161
DOI - 10.5815/ijmecs.2013.03.03
Subject(s) - lexicographical order , lexicography , imputation (statistics) , mathematical economics , combinatorics , function (biology) , game theory , computer science , set (abstract data type) , mathematics , linguistics , philosophy , statistics , evolutionary biology , missing data , biology , programming language
In the article dimensional lexicographic noncooperative gamesare 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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom