In the article m dimensional lexicographic noncooperative games   ) ,..., ( 1 m   are defined for the players’ } ,..., 2 , 1 { n N  for which there exists a characteristic function T m v v v v ) ,..., , ( 2 1  . Some main features are proved of v function in a lexicographic case. A lexicographic cooperative game is called a couple   v N , , where v is a real vectorfunction on N subsets ...

Due to its role in the identification of inefficient branches and deciding the consistency of their activities, evaluating the performance of a bankchr('39')s branches is one of the most important decisions in the field of development and regulation of branch network. In this paper, the satisfactory functions based on game theory strategies have been utilized in order to evaluate the individual...

This article by modeling a non-cooperative dynamic game tries to improve profitability and competition. This paper has considered how the manufacturer interacts with multiple competitor distributors. Each distributor also determines the optimal distribution price and inventory replenishment policies to maximize their profits. The issue form a non-cooperative dynamic game. Distributors formulate...

The task of understanding coevolutionary algorithms is a very difficult one. These algorithms search landscapes which are in some sense adaptive. As a result, the dynamical behaviors of coevolutionary systems can frequently be even more complex than traditional evolutionary algorithms (EAs). Moreover, traditional EA theory tells us little about coevolutionary algorithms. One major question that...

The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from c...

most of the time, groups/communities are involved in negotiations and disputations due to their various interests. they are always trying to pursuit their aspiration to embrace changes and influence on events. although sometimes these groups are not completely opposed to each other and their intention is just to get the desired results, almost always their conditions are in contrast with each o...

Forming effective coalitions is a major research challenge in AI and multi-agent systems. Thus, cooperative games, including Coalition Structure Generation (CSG), have been attracting considerable attention from the AI research community. Traditionally, the input of a cooperative game is a black-box function called a characteristic function. Therefore, many problems in cooperative games, includ...

In this paper, we give a further discussion on the core solution for cooperative games with fuzzy payoffs. Some notions and results from classical games are extended to fuzzy cooperative games. Using an example, we point out that the theorem about the nonempty of I-core proposed in 2008 was not sufficient. Furthermore, the equivalence relation between balanced game and nonempty core, which play...

Cognitive radio is a promising approach to make efficient use of spectrum by rapidly adapting the changes in wireless environment. In such networks, nodes are expected to be aware of their environment and must be able to learn from the outcomes of past decisions. Game theory which comprise of analytical tools designed to study interactive decision-making processes can be applied effectively to ...

Several real problems in telecommunication, transportation, and distribution industries can be well analyzed by network flow models. In revenue management, pricing plays a primary role which increases the profit generated from a limited supply of assets. Pricing decision directly affects the amount of service or product demand. Hence, in traditional maximum flow problem, we assume that the dema...