|
Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya, 2015, Issue 1, Pages 42–63
(Mi vspui228)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Applied mathematics
Two-level cooperation in technological alliance differential games
N. V. Kolabutin St. Petersburg State University, 7/9, Universitetskaya embankment, St. Petersburg, 199034, Russian Federation
Abstract:
The paper is devoted to two-level cooperation in differential games. Cooperative differential games are currently one of most important parts of game theory. They mathematically describe the conflict-controlled processes in management and economics. The solution of a differential game is a cooperative agreement, and the selected principle of optimality, according to which the received payoff is distributed. Studies showed that initially selected cooperative solution often loses its optimality over time. Therefore, the question arose about the stability of the co-operative solutions. The issue of dynamic stability or time consistency is considered. This concept was formalized by L. A. Petrosyan. Cooperative solution is dynamically stable if the principle of optimality selected early in the game stays consistent throughout the gameplay. For dynamic stability it is necessary at each moment of time to carry out the regularization of the chosen principle of optimality. For this regularization L. A. Petrosyan proposed to use the redistribution of received payoff in accordance with the “imputation distribution procedure”. In some cases coalitional solutions in differential games are studied, where the coalitions act as individual players. Coalitions play with each other in a noncooperative game, and payoff of each coalition is distributed among its members in accordance with some principle of optimality. In this paper we began to investigate the model in which participants form coalitions, acting as individual players, but the coalitions may also cooperate to increase joint payoff. In this case, the coalition play their cooperative game, maximizing overall benefits and distributing them among themselves according to some principle of optimality. Then, payoff of each coalition is distributed among its members as well according to maybe a different principle of optimality. Such cooperation is called two-level cooperation. Principles of profit distribution between coalitions and within coalition may be different. To solve such models which is required at both levels of the cooperation it is necessary to build the characteristic function and imputation distribution procedure. This paper describes a model of a two-level cooperation on the example of a technological alliance differential game. Participants in the game are the firms with the technology that brings profit. On the first (lower) level firms form coalitions to increase joint profit. On the second (upper) level coalitions act as individual players and also form the one grand coalition to increase the joint profit. The resulting top-level payoff is distributed between coalitions-participants. Thus, each coalition party may get more than it would receive by playing individually. Then each coalition distributes the resulting share of payoff among its member firms. This article also presented a stable cooperative solution in this model. For its implementation at every level of cooperation we build the characteristic function and prove its superadditivity. As a sharing the dynamic Shapley value is selected. The results are illustrated by a quantitative example. Bibliogr. 8. Tables 2.
Keywords:
differential game, cooperation, imputation distribution procedure.
Received: November 13, 2014
Citation:
N. V. Kolabutin, “Two-level cooperation in technological alliance differential games”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2015, no. 1, 42–63
Linking options:
https://www.mathnet.ru/eng/vspui228 https://www.mathnet.ru/eng/vspui/y2015/i1/p42
|
Statistics & downloads: |
Abstract page: | 102 | Full-text PDF : | 22 | References: | 9 | First page: | 4 |
|