A cooperative detection game:UAV swarm vs.one fast intruder

This paper studies a special defense game using unmanned aerial vehicle(UAV)swarm against a fast intruder.The fast intruder applies an offensive strategy based on the artificial potential field method and Apollonius circle to scout a certain destination.As defenders,the UAVs are arranged into three layers:the forward layer,the midfield layer and the back layer.The co-defense mechanism,including the role derivation method of UAV swarm and a guidance law based on the co-defense front point,is introduced for UAV swarm to co-detect the intruder.Besides,five formations are designed for comparative analysis when ten UAVs are applied.Through Monte Carlo experiments and ablation experiment,the effectiveness of the proposed co-defense method has been verified.

Cooperative game theory-based steering law design of a CMG system

Spacecraft require a large-angle manoeuvre when performing agile manoeuvring tasks, therefore a control moment gyroscope(CMG) is employed to provide a strong moment.However, the control of the CMG system easily falls into singularity, which renders the actuator unable to output the required moment. To solve the singularity problem of CMGs, the control law design of a CMG system based on a cooperative game is proposed. First, the cooperative game model is constructed according to the quadratic programming problem, and the cooperative strategy is constructed. When the strategy falls into singularity, the weighting coefficient is introduced to carry out the strategy game to achieve the optimal strategy. In theory, it is proven that the cooperative game manipulation law of the CMG system converges, the sum of the CMG frame angular velocities is minimized, the energy consumption is small, and there is no output torque error. Then, the CMG group system is simulated.When the CMG system is near the singular point, it can quickly escape the singularity. When the CMG system falls into the singularity, it can also escape the singularity. Considering the optimization of angular momentum and energy consumption, the feasibility of the CMG system steering law based on a cooperative game is proven.

An integrated MINLP model for multi-party coordination in downstream oil supply chain

Cooperation among enterprises can bring overall and individual performance improvement,and a smooth coordination method is indispensable.However,due to the lack of customized coordination methods,cooperation in the downstream oil supply chain cannot be carried out smoothly.This paper intends to propose a multi-party coordination method to promote cooperation between oil shippers and pipeline operator by optimizing oil transportation,oil substitution and pipeline pricing schemes.An integrated game-theoretic modeling and analysis approach is developed to characterize the operation behaviors of all stakeholders in the downstream oil supply chain.The proposed mixed integer nonlinear programming model constrains supply and demand capacity,transportation routes,oil substitution rules and pipeline freight levels.Logarithm transformation and price discretization are introduced for model linear approximation.Simulation experiments are carried out in the oil distribution system in South China.The results show that compared to the business-as-usual scheme,the new scheme saves transportation cost by 3.48%,increases pipeline turnover by 5.7%,and reduces energy consumption and emissions by 7.66%and 6.77%.It is proved that the proposed method improves the revenue of the whole system,achieves fair revenue distribution,and also improves the energy and environmental benefits of the oil supply chain.

A Value for Games Defined on Graphs

Given a graph g=( V,A ) , we define a space of subgraphs M with the binary operation of union and the unique decomposition property into blocks. This space allows us to discuss a notion of minimal subgraphs (minimal coalitions) that are of interest for the game. Additionally, a partition of the game is defined in terms of the gain of each block, and subsequently, a solution to the game is defined based on distributing to each player (node and edge) present in each block a payment proportional to their contribution to the coalition.

Cooperative and Competitive Multi-Agent Systems:From Optimization to Games

Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system,agents with a certain degree of autonomy generate complex interactions due to the correlation and coordination,which is manifested as cooperative/competitive behavior.This survey focuses on multi-agent cooperative optimization and cooperative/non-cooperative games.Starting from cooperative optimization,the studies on distributed optimization and federated optimization are summarized.The survey mainly focuses on distributed online optimization and its application in privacy protection,and overviews federated optimization from the perspective of privacy protection me-chanisms.Then,cooperative games and non-cooperative games are introduced to expand the cooperative optimization problems from two aspects of minimizing global costs and minimizing individual costs,respectively.Multi-agent cooperative and non-cooperative behaviors are modeled by games from both static and dynamic aspects,according to whether each player can make decisions based on the information of other players.Finally,future directions for cooperative optimization,cooperative/non-cooperative games,and their applications are discussed.

Cooperative driving model for non-signalized intersections with cooperative games

Cooperative driving around intersections has aroused increasing interest in the last five years.Meanwhile,driving safety in non-signalized intersections has become an issue that has attracted attention globally.In view of the potential collision risk when more than three vehicles approach a non-signalized intersection from different directions,we propose a driving model using cooperative game theory.First,the characteristic functions of this model are primarily established on each vehicle’s profit function and include safety,rapidity and comfort indicators.Second,the Shapley theorem is adopted,and its group rationality,individual rationality,and uniqueness are proved to be suitable for the characteristic functions of the model.Following this,different drivers’characteristics are considered.In order to simplify the calculation process,a zero-mean normalization method is introduced.In addition,a genetic algorithm method is adopted to search an optimal strategy set in the constrained multi-objective optimization problem.Finally,the model is confirmed as valid after simulation with a series of initial conditions.

Diffusion mechanism simulation of cloud manufacturing complex network based on cooperative game theory

Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform(CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization,user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.

Profit Allocation Scheme Among Players in Supply-Chain Based on Shapley Value of Fuzzy Bi-cooperative Games

The Shapley value of fuzzy bi-eooperative game is developed based on the conventional Shapley value of bi-cooperative game. From the viewpoint that the players can participate in the coalitions to a certain extent and there are at least two independent cooperative projects for every player to choose, Shapley value which is introduced by Grabisch is extended to the case of fuzzy bi-cooperative game by Choquet integral. Moreover, the explicit fuzzy Shapley value is given. The explicit fuzzy Shapley function can be used to allocate the profits among players in supply-chain under the competitive and uncertain environment.

Cooperative Differential Game for Model Energy-Bandwidth Efficiency Tradeoff in the Internet of Things

Internet of Things （IoT） refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we present a tradeoff between bandwidth and energy con- sumption in the loT in this paper. A service providing model is built to find the relation- ship between bandwidth and energy consump- tion using a cooperative differential game mo- del. The game solution is gotten in the condi- tion of grand coalition, feedback Nash equili- brium and intermediate coalitions and an allo- cation policy is obtain by Shapley theory. The results are shown as follows. Firstly, the per- formance of IoT decreases with the increasing of bandwidth cost or with the decreasing of en- ergy cost; secondly, all the nodes in the IoT com- posing a grand coalition can save bandwidth and energy consumption; thirdly, when the fac- tors of bandwidth cost and energy cost are eq- ual, the obtained number of provided services is an optimised value which is the trade-off between energy and bandwidth consumption.

A NOVEL COOPERATIVE SPECTRUM SENSING METHOD BASED ON COOPERATIVE GAME THEORY

A novel cooperative sensing method is proposed in this paper. The proposed scheme adopts sensing creditability degree to characterize the impact of the distance and the channel parameters on the sensing result,and considers that each user has different average SNR and different decision threshold,by using General Nash Bargaining Solution (GNBS) strategy in Cooperative Game Theory (CGT),the detection performance for two-user case are derived. For multi-user case,the sensing performance is obtained with Hungarian method. Compared with the traditional schemes such as Nash Bargaining Solution (NBS) and AND,the proposed scheme covers all the factors mentioned above,and enhances the sensing rationality and reliability. Simulation results show that the proposed scheme can further improve the sensing performance and creditability.

Shapley Value for Cooperative Games with Fuzzy Coalition

Fuzzy Shapley values are developed based on conventional Shapley value. This kind of fuzzy cooperative games admit the representation of rates of players＇ participation to each coalition. And they can be applicable to both supperadditive and subadditvie cooperative games while other kinds of fuzzy cooperative games can only be superadditive. An explicit form of the Shapley function on fuzzy games with λ-fuzzy measure was also proposed.

Game theoretic analysis for pricing-based incentive mechanism in non-dedicated cooperative relay networks

In non-dedicated cooperative relay networks, each node is autonomous and selfish in nature, and thus spontaneous cooperation among nodes is challenged. To stimulate the selfish node to participate in cooperation, a pricing-based cooperation engine using game theory was designed. Firstly, the feasible regions of the charge price and reimbursement price were deduced. Then, the non-cooperative and cooperative games were adopted to analyze the amount of bandwidth that initiating cooperation node(ICN) forwards data through participating cooperation node(PCN) and the amount of bandwidth that PCN helps ICN to relay data. Meanwhile, the Nash equilibrium solutions of cooperation bandwidth allocations(CBAs) were obtained through geometrical interpretation. Secondly, a pricing-based cooperation engine was proposed and a cooperative communication system model with cooperation engines was depicted. Finally, an algorithm based on game theory was proposed to realize the cooperation engine. The simulation results demonstrate that, compared with the system without pricing-based incentive, the proposed system can significantly improve the ICN's metric measured by bit-per-Joule and increase the PCN's revenue.

Cooperative Game Approach for Scheduling in Two-Virtual-Antenna Cellular Networks with Relay Stations Fairness Consideration

In thsssse cellular network, Relay Stations (RSs) help to improve the system performance; however, little work has been done considering the fairness of RSs. In this paper, we study the cooperative game approaches for scheduling in the wireless relay networks with two-virtual-antenna array mode. After defining the metric of relay channel capacity, we form a cooperative game for scheduling and present the interpretation of three different utilization objectives physically and mathematically. Then, a Nash Bargaining Solution (NBS) is utilized for resource allocation considering the traffic load fairness for relays. After proving the existence and uniqueness of NBS in Cooperative Game (CG-NBS), we are able to resolve the resource allocation problem in the cellular relay network by the relay selection and subcarrier assignment policy and the power allocation algorithm for both RSs and UEs. Simulation results reveal that the proposed CG-NBS scheme achieves better tradeoff between relay fairness and system throughput than the conventional Maximal Rate Optimization and Maximal Minimal Fairness methods.

Bargaining Game Theoretic Power Control in Selfish Cooperative Relay Networks

Wireless cooperative communications require appropriate power allocation （PA） between the source and relay nodes. In selfish cooperative communication networks, two partner user nodes could help relaying information for each other, but each user node has the incentive to consume his power solely to decrease its own symbol error rate （SER） at the receiver. In this paper, we propose a fair and efficient PA scheme for the decode-and-forward cooperation protocol in selfish cooperative relay networks. We formulate this PA problem as a two-user cooperative bargaining game, and use Nash bargaining solution （NBS） to achieve a win-win strategy for both partner users. Simulation results indicate that the NBS is fair in that the degree of cooperation of a user only depends on how much contribution its partner can make to decrease its SER at the receiver, and efficient in the sense that the SER performance of both users could be improved through the game.

The Coalition Cooperative Game Method and Its Application in Multi-objective Optimization Design

This paper proposes a multi-objective optimization design method based on the coalition cooperative game theory where the three design goals have been seen as three game players. By calculating the affecting factors and fuzzy clustering, the design variables are divided into different strategic spaces which belong to each player, then it constructs a payoff function based on the coalition mechanism. Each game player takes its own revenue function as a target and obtains the best strategy versus other players. The best strategies of all players consist of the strategy permutation of a round game and it obtains the final game solutions through multi-round games according to the convergence criterion. A multi-objective optimization example of the luff mechanism of compensative sheave block shows the effectiveness of the coalition cooperative game method.

Equilibrium solution of two enterprises cooperative game

Based on the actual experience of cooperation in the supply chain, the Nash solution of two enterprises cooperative games is given. Not only is the solution unique, but it is also stable, and neither side has the capability to deviate the allocation of interests from the equilibrium point. If some firm tries to withdraw from cooperation or threaten to use other particular strategy, the negotiations are likely to achieve the distribution by the threat game; The calculating method of the choice of the optimal bargaining base point and the corresponding optimal pay-off vector are given.

Evolutionarily Cooperative Stable of Science & Technology Alliance Under Self-organized Organization

The cooperative evolutionary stability under self-organized organization is discussed in this paper. The differences between the objects studied by cooperative game theory and the ones studied by cooperative game in science ＆ technology alliance are analyzed. The mutant probability of agent＇s utility under endoge- nous technical factor condition is analyzed. By clarifying the connotation of Pareto-dominate institution in cooperative game, the efficient and feasible managerial definition of Pareto-dominate Institution in science ＆ technology alliance is presented. The evolutionarily cooperative game for the agent in Pareto-dominate institution is explained. And then the necessary condition of cooperative evolutionary stabilization based on multi-agent utility＇s dynamic equilibrium is put forward. Finally, the model of alliance＇s utility＇s dynamic equilibrium under self-organization is established.

Non-Cooperative Differential Game Based Load Balancing Algorithm in Radio-Over-Fibre System

Load balancing plays a critical role in a cellular network. As one kind of cellular network, Radio-over-Fibre （RoF） system can provide ubiquitous high data-rate transmissions, which has attracted many attentions, but it also suffer load unbalancing problem. In order to improve the system performance, in this paper, we propose a novel loading balance scheme in RoF system based on differential game theory. The scheme formulates the load allocated to each RAP （Radio Access Point） as a Nasb Equilibrium, using non-cooperative differential game to obtain the optical load allocation of each RAP. The simulations performed show that the non-cooperative differential game algorithm is applicable and the optimal load solution can be achieved.

Decoherence Effects on Multiplayer Cooperative Quantum Games

We study the behavior of cooperative multiplayer quantum games [Q. Chen, Y. Wang, J.T. Liu, and K.L. Wang, Phys. Lett. A 327 （2004） 98; A.P. Flitney and L.C.L. Hollenberg, Quantum Inf. Comput. 7 （2007） 111] in the presence of decoherence using different quantum channels such as amplitude damping, depolarizing and phase damping. It is seen that the outcomes of the games for the two damping channels with maximum values of decoherence reduce to same value. However, in comparison to phase damping channel, the payoffs of cooperators are strongly damped under the influence amplitude damping channel for the lower values of decoherence parameter. In the case of depolarizing channel, the game is a no-payoff game irrespective of the degree of entanglement in the initial state for the larger values of decoherence parameter. The deeoherenee gets the cooperators worse off.

On Aspiration Solutions in Predicting Coalition Formationin Cooperative Games

This paper consists of two parts. The first part introduces the strict aspiration as a new aspiration solution concept, which is provedto be existent for any cooperative game. The second part deals with theunsolved problem put forward by Bennett by showing that there is atleast one payoff which is balanced, partnered and equal gains aspiration.The proof is algebraic and constructive, thus providing an algorithm forfinding such aspirations.