scholarly journals On the Usefulness of Cooperation in N Person Games

2016 ◽  
Vol 2016 ◽  
pp. 1-5
Author(s):  
Mikhail Sergeevich Nikolskii ◽  
Aboubacar Moussa

The N person games in which each player maximizes his payoff function are considered. We have studied an interesting question for the cooperative game theory about the usefulness of uniting the N players in a union. The aim of such cooperation is for each player to get a positive increase to his guaranteed payoff. We have obtained some effective sufficient conditions under which the joining of the players in union is useful for each player. The linear case, specially, is being considered. In the second part of the paper, we have studied the question about the usefulness of cooperation of the N players in the presence of the (N+1)th player, an ill-intentioned destructive player, whose whole aim is not to win but to harm each player individually, and also the union of these players, for example, global terrorism. It should be noted that the considered situation in the second part is related to A. V. Kryazhimskiy’s talk delivered in the summer of 2014. We obtain constructive conditions under which the union of the players is beneficial in this situation as well.

2020 ◽  
Vol 10 (16) ◽  
pp. 5589
Author(s):  
Yang Liu ◽  
Changfu Zong ◽  
Xiaojian Han ◽  
Dong Zhang ◽  
Hongyu Zheng ◽  
...  

Recently, spacing policies of the vehicular platoon have been widely developed to enhance safety, traffic efficiency, and fuel consumption. However, the integrated spacing policies aim to maximum overall benefit, and the distributed spacing policies intense to get optimal monomer benefit. Ignoring the fairness of the benefit allocation of each vehicle will reduce the motivation to constitute the platoon. To fill this critical gap, this study proposes a spacing allocation method by treating spacing decisions as cooperative games. A flock’s model which is used to be the payoff function is introduced based on bionic motion principles. We present a characteristic function of the platoon for the cooperative game model considering the specific structure of the platoon. The τ value, Shapley value, and average lexicographic value are introduced and applied to allocate the spacing fairly. Proposed methods are compared with constant distance policy in some typical situations. The simulation results demonstrate that the spacing policy based on cooperative game theory improved the stable time for consistency control and the convergence of longitudinal following error.


Author(s):  
Cunbin Li ◽  
Ding Liu ◽  
Yi Wang ◽  
Chunyan Liang

AbstractAdvanced grid technology represented by smart grid and energy internet is the core feature of the next-generation power grid. The next-generation power grid will be a large-scale cyber-physical system (CPS), which will have a higher level of risk management due to its flexibility in sensing and control. This paper explains the methods and results of a study on grid CPS’s behavior after risk. Firstly, a behavior model based on hybrid automata is built to simulate grid CPS’s risk decisions. Then, a GCPS risk transfer model based on cooperative game theory is built. The model allows decisions to ignore complex network structures. On this basis, a modified applicant-proposing algorithm to achieve risk optimum is proposed. The risk management model proposed in this paper can provide references for power generation and transmission decision after risk as well as risk aversion, an empirical study in north China verifies its validity.


2021 ◽  
Vol 145 ◽  
pp. 111056
Author(s):  
Andrey Churkin ◽  
Janusz Bialek ◽  
David Pozo ◽  
Enzo Sauma ◽  
Nikolay Korgin

2021 ◽  
Vol 50 (1) ◽  
pp. 78-85
Author(s):  
Ester Livshits ◽  
Leopoldo Bertossi ◽  
Benny Kimelfeld ◽  
Moshe Sebag

Database tuples can be seen as players in the game of jointly realizing the answer to a query. Some tuples may contribute more than others to the outcome, which can be a binary value in the case of a Boolean query, a number for a numerical aggregate query, and so on. To quantify the contributions of tuples, we use the Shapley value that was introduced in cooperative game theory and has found applications in a plethora of domains. Specifically, the Shapley value of an individual tuple quantifies its contribution to the query. We investigate the applicability of the Shapley value in this setting, as well as the computational aspects of its calculation in terms of complexity, algorithms, and approximation.


2009 ◽  
Vol 18 (1) ◽  
pp. 25-33 ◽  
Author(s):  
Danny Ben-Shahar ◽  
Yongheng Deng ◽  
Eyal Sulganik

Sign in / Sign up

Export Citation Format

Share Document