Coalitional game based resource allocation in D2D-enabled V2V communication

The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.

Solving the Urban Domestic Waste Classification Dilemma from a Coalitional Game Perspective

The effective classification of urban domestic waste is the key to achieve a “waste-free city” and provides an essential guarantee for resource utilization. This article takes a coalitional game perspective to study the dilemmas in urban domestic waste separation from the cooperative interaction of residents, government, and enterprises. The study finds that urban domestic waste classification in China is currently facing many problems, focusing on: 1) insufficient consensus among residents, 2) shortage of input funds, 3) corporate profitability difficulties, 4) weak policy constraints, and 5) difficulties in integrating goals. In this regard, each participating body still needs to focus on collective interests, coalitional games, break the dilemma society, and promote the long-term management of urban domestic waste.

美国大学招生的考量因素及动向——美国加州伯克利认证升学咨询师张郑倩访谈

美国在大学招生考试制度方面有着综合性、自主性和灵活多样等特点。本文对美国加州伯克利认证升学咨询师张郑倩的访谈围绕美国大学招生展开,问题主要集中于独立咨询师的工作内容,美国大学招生中对高中成绩、标准化考试成绩、推荐信、面试、写作、种族等因素的考量,以及对美国大学申请新系统Coalition Application的解读等方面。这些内容对我国高考招生制度改革有着很大的借鉴意义。

MAV/UAV task coalition phased-formation method

The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clustering phase, the geographical position of tasks is taken into consideration and a cluster method is proposed. For the UAV allocation phase, the UAV requirement for both constrained and unconstrained resources is introduced, and a multi-objective optimal algorithm is proposed to solve the allocation problem. For the MAV allocation phase, the optimal model is firstly constructed and it is decomposed according to the ideal of greed to reduce the time complexity of the algorithm. Based on the above phases, the MAV/UAV task coalition formation method is proposed and the effectiveness and practicability are demonstrated by simulation examples.

科研资助联盟主导的学术开放出版研究——以S计划为例

以科研资助联盟为研究对象,梳理科研资助机构政策及科研资助联盟的形成过程,以开放获取科研资助联盟(cOAlition S)提出的S计划为例,分析其运行基础和实现开放出版的模式,探究S计划的意义与影响以及存在的局限性,为各相关主体应对开放出版新局势提出建议,为学术开放出版的推进提供新思路.

Coalition Formation for Multiple UAVs Cooperative Search and Attack with Communication Constraints in Unknown Environment

A coalition formation algorithm is presented with limited communication ranges and delays in unknown environment,for the performance of multiple heterogeneous unmanned aerial vehicles(UAVs)in cooperative search and attack missions.The mathematic model of coalition formation is built on basis of the minimum attacking time and the minimum coalition size with satisfying resources and simultaneous strikes requirements.A communication protocol based on maximum number of hops is developed to determine the potential coalition members in dynamic network.A multistage sub-optimal coalition formation algorithm(MSOCFA)with polynomial time is established.The performances of MSOCFA and particle swarm optimization(PSO)algorithms are compared in terms of complexity,mission performance and computational time.A complex scenario is deployed to illustrate how the coalitions are formed and validate the feasibility of the MSOCFA.The effect of communication constraints(hop delay and max-hops)on mission performance is studied.The results show that it is beneficial to determine potential coalition members in a wide and deep range over the network in the presence of less delay.However,when the delays are significant,it is more advantageous to determine coalitions from among the immediate neighbors.

Algorithm to Form Coalition in Multi-Agent Cooperation

In multi-agent systems, autonomous agents may form coalition to increase the efficiency of problem solving. But the current coalition algorithm is very complex, and cannot satisfy the condition of optimality and stableness simultaneously. To solve the problem, an algorithm that uses the mechanism of distribution according to work for coalition formation is presented, which can achieve global optimal and stable solution in subadditive task oriented domains. The validity of the algorithm is demonstrated by both experiments and theory.

Evaluation Model for Capability of Enterprise Agent Coalition Based on Information Fusion and Attribute Reduction

For the issue of evaluation of capability of enterprise agent coalition,an evaluation model based on information fusion and entropy weighting method is presented. The attribute reduction method is utilized to reduce indicators of the capability according to the theory of rough set. The new indicator system can be determined. Attribute reduction can also reduce the workload and remove the redundant information,when there are too many indicators or the indicators have strong correlation. The research complexity can be reduced and the efficiency can be improved. Entropy weighting method is used to determine the weights of the remaining indicators,and the importance of indicators is analyzed. The information fusion model based on nearest neighbor method is developed and utilized to evaluate the capability of multiple agent coalitions,compared to cloud evaluation model and D-S evidence method. Simulation results are reasonable and with obvious distinction. Thus they verify the effectiveness and feasibility of the model. The information fusion model can provide more scientific,rational decision support for choosing the best agent coalition,and provide innovative steps for the evaluation process of capability of agent coalitions.

EIAS:An Efficient Identity-Based Aggregate Signature Scheme for WSNs Against Coalition Attack

Wireless sensor networks(WSNs)are the major contributors to big data acquisition.The authenticity and integrity of the data are two most important basic requirements for various services based on big data.Data aggregation is a promising method to decrease operation cost for resource-constrained WSNs.However,the process of data acquisitions in WSNs are in open environments,data aggregation is vulnerable to more special security attacks with hiding feature and subjective fraudulence,such as coalition attack.Aimed to provide data authenticity and integrity protection for WSNs,an efficient and secure identity-based aggregate signature scheme(EIAS)is proposed in this paper.Rigorous security proof shows that our proposed scheme can be secure against all kinds of attacks.The performance comparisons shows EIAS has clear advantages in term of computation cost and communication cost when compared with similar data aggregation scheme for WSNs.

Coalition Formation in Weighted Simple-majority Games under Proportional Payoff Allocation Rules

In this paper, we introduce a simple coalition formation game in the environment of bidding, which is a special case of the weighted majority game （WMG）, and is named the weighted simple-majority game （WSMG）. In WSMG, payoff is allocated to the winners proportional to the players powers, which can be measured in various ways. We define a new kind of stability： the counteraction-stability （C-stability）, where any potential deviating players will confront counteractions of the other players. We show that C-stable coalition structures in WSMG always contains a minimal winning coalition of minimum total power. For the variant where powers are measured directly by their weights, we show that it is NP-hard to find a C-stable coalition structure and design a pseudo-polynomial time algorithm. Sensitivity analysis for this variant, which shows many interesting properties, is also done. We also prove that it is NP-hard to compute the Holler-Packel indices in WSMGs, and hence in WMGs as well.

ANALYSIS OF GROUP MULTIUSER DETECTION BASED ON COALITION GAME THEORY

Coalition game theory is introduced to investigate the performance,fairness and stability of decorrelating group multiuser detection receiver,not only from the perspective of individual nodes,but also various coalitions and the whole system as well. Firstly,to derive how the system scale with coalition size,a stochastic model with transferable payoffs (stochastic TU-model) is provided. Secondly,to find the most preferred coalition structures from the view point of individual nodes,a model with Non-Transferable payoffs (NTU-model) is presented. Theoretical analysis and simulation results suggest that stochasticaly the grand coalition is payoff maximizing for the system as a whole,while individual nodes with good-conditioned channels may prefer local "win-win coalitions".

Social-Aware Joint Mode Selection and Link Allocation for Device-to-Device Communication Underlaying Cellular Networks

Joint mode selection and link allocation are crucial to achieve the advantage of Device-to-Device(D2 D) communications in improving spectral efficiency. In practice, cellular users tend to not be totally altruistic or absolutely selfish. How to stimulate them to devote their links and how to allocate their links to D2 D pair candidates efficiently are two main challenges. In this paper, we encourage cellular users through the variable payment with regard to the social tie strength between cellular users and D2 D pair candidates. In particular, the social tie strength is inferred through a graph inference model and its impact on the payment is quantified as a negative exponential function. Then, we propose a resource scheduling optimization model based on the non-transferable utility coalition formation game, and a distributed coalition formation algorithm based on the Pareto preference and merge-and-split rule. From them, the final coalition structure is obtained, which reflects the strategy of mode selection and link allocation. Numerical results are presented to verify the effectiveness of our proposed scheme.

On the Coalitional Rationality and the Inverse Problem for Shapley Value and the Semivalues

In cooperative game theory, a central problem is to allocate fairly the win of the grand coalition to the players who agreed to cooperate and form the grand coalition. Such allocations are obtained by means of values, having some fairness properties, expressed in most cases by groups of axioms. In an earlier work, we solved what we called the Inverse Problem for Semivalues, in which the main result was offering an explicit formula providing the set of all games with an a priori given Semivalue, associated with a given weight vector. However, in this set there is an infinite set of games for which the Semivalues are not coalitional rational, perhaps not efficient, so that these are not fair practical solutions of the above fundamental problem. Among the Semivalues, coalitional rational solutions for the Shapley Value and the Banzhaf Value have been given in two more recent works. In the present paper, based upon a general potential basis, relative to Semivalues, for a given game and a given Semivalue, we solve the connected problem: in the Inverse Set, find out a game with the same Semivalue, which is also coalitional rational. Several examples will illustrate the corresponding numerical technique.

Advocacy Coalition by External Actors and Strategies Used to Influence the Emergence of the National Nutrition Policy in Lao PDR

This article aims to explore the coalition of external actors and the strategies it deployed to influence the emergence of the National Nutrition Policy (NNP) in Lao People’s Democratic Republic (Lao PDR). The Advocacy Coalition Framework and the conceptual model of Effective Advocacy Strategies for Influencing Government Nutrition Policy were used to frame the data collection and their analysis. Sources of information were semi-structured interviews conducted with government and external actors, as well as all available documents on nutrition policy in Laos. The commitment of the government to achieve the Millennium Development Goals (MDGs) and to leave the Least Developed Country status created a favorable condition to support the emergence of the NNP in Laos. This context was a driving force for the building of an effective and convincing coalition of United Nations agencies able to accompany the government in redefining health priorities. Various strategies were used by the coalition to this end, including generating, disseminating, and using scientific evidence, assisting the government with a budget and technical expertise, providing decision-makers with opportunities to learn from other countries, and building relationships with the key actor. External actors can be a major force to support the emergence of a public policy in Laos, but this requires a window of opportunity like what the MDGs have been able to bring.

Coalition Emergency Response System, City Security and City Sustainable Development

The relations among the establishment of Coalition Emergency Response System （CERS）, city security and city sustainable development are analyzed in the article. According to the relation analysis, it is concluded that cities should build up their CERS to deal with the thread of damage in China. The recommendations about the establishment of the system are also provided.

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.

Coalition Game Based Full-Duplex Concurrent Scheduling in Millimeter Wave Wireless Backhaul Network

With the development of self-interference(SI) cancelation technology, full-duplex(FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot(TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game(FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm canachieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.

Coalitional Game Based Joint Beamforming and Power Control for Physical Layer Security Enhancement in Cognitive IoT Networks

In this paper,the physical layer se-cure transmission in multi-antenna multi-user cogni-tive internet-of-thing(IoT)network is investigated,where the coalitional game based joint beamform-ing and power control scheme is proposed to im-prove the achievable security of cognitive IoT de-vices.Specifically,the secondary network consisting of a muti-antenna secondary transmitter,multiple sec-ondary users(SUs),is allowed to access the licensed spectrum resource of primary user(PU)with underlay approach in the presence of an unauthorized eaves-dropper.Based on the Merge-Split-Rule,coalitional game is formulated among distributed secondary users with cooperative receive beamforming.Then,an alter-native optimization method is used to obtain the op-timized beamforming and power allocation schemes by applying the up-downlink duality.The simulation results demonstrate the effectiveness of our proposed scheme in improving the SU’s secrecy rate and system utility while guaranteeing PU’s interference thresh-old.

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.

On the Coalitional Rationality and the Egalitarian Nonseparable Contribution

In earlier works we introduced the Inverse Problem, relative to the Shapley Value, then relative to Semivalues. In the explicit representation of the Inverse Set, the solution set of the Inverse Problem, we built a family of games, called the almost null family, in which we determined more recently a game where the Shapley Value and the Egalitarian Allocations are colalitional rational. The Egalitarian Nonseparable Contribution is another value for cooperative transferable utilities games (TU games), showing how to allocate fairly the win of the grand coalition, in case that this has been formed. In the present paper, we solve the similar problem for this new value: given a nonnegative vector representing the Egalitarian Nonseparable Contribution of a TU game, find out a game in which the Egalitarian Nonseparable Contribution is kept the same, but it is colalitional rational. The new game will belong to the family of almost null games in the Inverse Set, relative to the Shapley Value, and it is proved that the threshold of coalitional rationality will be higher than the one for the Shapley Value. The needed previous results are shown in the introduction, the second section is devoted to the main results, while in the last section are discussed remarks and connected problems. Some numerical examples are illustrating the procedure of finding the new game.