Consensus towards Partially Cooperative Strategies in Self-Regulated Evolutionary Games on Networks

Cooperation is widely recognized to be fundamental for the well-balanced development of human societies. Several different approaches have been proposed to explain the emergence of cooperation in populations of individuals playing the Prisoner’s Dilemma game, characterized by two concurrent natural mechanisms: the temptation to defect and the fear to be betrayed by others. Few results are available for analyzing situations where only the temptation to defect (Chicken game) or the fear to be betrayed (Stag-Hunt game) is present. In this paper, we analyze the emergence of full and partial cooperation for these classes of games. We find the conditions for which these Nash equilibria are asymptotically stable, and we show that the partial one is also globally stable. Furthermore, in the Chicken and Stag-Hunt games, partial cooperation has been found to be more rewarding than the full one of the Prisoner’s Dilemma game. This result highlights the importance of such games for understanding and sustaining different levels of cooperation in social networks.

Partial Cooperation Based on Dynamic Transmit Antennas for Two-Hop Massive MIMO Systems

As the ever-increasing attention to green communication, energy efficiency has become an imperative metric in the emerging massive multiple-input multiple-output (MIMO) systems. In order to maximize the energy efficiency, transmit antenna selection has been widely concerned by researchers. In this paper, we investigate the coded cooperation transmission for dynamic transmit antennas aided two-hop massive MIMO systems. Explicitly, we propose a rate-less codes aided cooperation scheme for reducing the implementation complexity in the broadcast phase, compared to the fixed-rate coded cooperation scheme. Furthermore, we develop a partial cooperation scheme in the cooperative phase in order to avoid the low achievable rate caused by the full cooperation, especially when the source-to-relay (S-R) channels are poor. Finally, the number of transmit antennas at the base station (BS) is optimized through theoretical analysis in a metric of maximizing the energy efficiency. Moreover, we also analyze the achievable error performance for different modulations. Our simulation results demonstrate the effectiveness of the proposed scheme.

Socially Motivated Partial Cooperation in Multi-agent Local Search

Partial Cooperation is a paradigm and a corresponding model, proposed to represent multi-agent systems in which agents are willing to cooperate to achieve a global goal, as long as some minimal threshold on their personal utility is satisfied. Distributed local search algorithms were proposed in order to solve asymmetric distributed constraint optimization problems (ADCOPs) in which agents are partially cooperative. We contribute by: 1) extending the partial cooperative model to allow it to represent dynamic cooperation intentions, affected by changes in agents’ wealth, in accordance with social studies literature. 2) proposing a novel local search algorithm in which agents receive indications of others’ preferences on their actions and thus, can perform actions that are socially beneficial. Our empirical study reveals the advantage of the proposed algorithm in multiple benchmarks. Specifically, on realistic meeting scheduling problems it overcomes limitations of standard local search algorithms.