Cooperation, Norms, and Revolutions: A Unified Game-Theoretical Approach

Cooperation is of utmost importance to society as a whole, but is often challenged by individual self-interests. While game theory has studied this problem extensively, there is little work on interactions within and across groups with different preferences or beliefs. Yet, people from different social or cultural backgrounds often meet and interact. This can yield conflict, since behavior that is considered cooperative by one population might be perceived as non-cooperative from the viewpoint of another. To understand the dynamics and outcome of the competitive interactions within and between groups, we study game-dynamical replicator equations for multiple populations with incompatible interests and different power (be this due to different population sizes, material resources, social capital, or other factors). These equations allow us to address various important questions: For example, can cooperation in the prisoner's dilemma be promoted, when two interacting groups have different preferences? Under what conditions can costly punishment, or other mechanisms, foster the evolution of norms? When does cooperation fail, leading to antagonistic behavior, conflict, or even revolutions? And what incentives are needed to reach peaceful agreements between groups with conflicting interests? Our detailed quantitative analysis reveals a large variety of interesting results, which are relevant for society, law and economics, and have implications for the evolution of language and culture as well

A Temporal Framework for Hypergame Analysis of Cyber Physical Systems in Contested Environments

Game theory is used to model conflicts between one or more players over resources. It offers players a way to reason, allowing rationale for selecting strategies that avoid the worst outcome. Game theory lacks the ability to incorporate advantages one player may have over another player. A meta-game, known as a hypergame, occurs when one player does not know or fully understand all the strategies of a game. Hypergame theory builds upon the utility of game theory by allowing a player to outmaneuver an opponent, thus obtaining a more preferred outcome with higher utility. Recent work in hypergame theory has focused on normal form static games that lack the ability to encode several realistic strategies. One example of this is when a player’s available actions in the future is dependent on his selection in the past. This work presents a temporal framework for hypergame models. This framework is the first application of temporal logic to hypergames and provides a more flexible modeling for domain experts. With this new framework for hypergames, the concepts of trust, distrust, mistrust, and deception are formalized. While past literature references deception in hypergame research, this work is the first to formalize the definition for hypergames. As a demonstration of the new temporal framework for hypergames, it is applied to classical game theoretical examples, as well as a complex supervisory control and data acquisition (SCADA) network temporal hypergame. The SCADA network is an example includes actions that have a temporal dependency, where a choice in the first round affects what decisions can be made in the later round of the game. The demonstration results show that the framework is a realistic and flexible modeling method for a variety of applications

Allocating Limited Resources to Protect a Massive Number of Targets using a Game Theoretic Model

Resource allocation is the process of optimizing the rare resources. In the area of security, how to allocate limited resources to protect a massive number of targets is especially challenging. This paper addresses this resource allocation issue by constructing a game theoretic model. A defender and an attacker are players and the interaction is formulated as a trade-off between protecting targets and consuming resources. The action cost which is a necessary role of consuming resource, is considered in the proposed model. Additionally, a bounded rational behavior model (Quantal Response, QR), which simulates a human attacker of the adversarial nature, is introduced to improve the proposed model. To validate the proposed model, we compare the different utility functions and resource allocation strategies. The comparison results suggest that the proposed resource allocation strategy performs better than others in the perspective of utility and resource effectiveness.Comment: 14 pages, 12 figures, 41 reference

Enhancing cooperation in wireless networks using different concepts of game theory

PhDOptimizing radio resource within a network and across cooperating heterogeneous networks is the focus of this thesis. Cooperation in a multi-network environment is tackled by investigating network selection mechanisms. These play an important role in ensuring quality of service for users in a multi-network environment. Churning of mobile users from one service provider to another is already common when people change contracts and in a heterogeneous communication environment, where mobile users have freedom to choose the best wireless service-real time selection is expected to become common feature. This real time selection impacts both the technical and the economic aspects of wireless network operations. Next generation wireless networks will enable a dynamic environment whereby the nodes of the same or even different network operator can interact and cooperate to improve their performance. Cooperation has emerged as a novel communication paradigm that can yield tremendous performance gains from the physical layer all the way up to the application layer. Game theory and in particular coalitional game theory is a highly suited mathematical tool for modelling cooperation between wireless networks and is investigated in this thesis. In this thesis, the churning behaviour of wireless service users is modelled by using evolutionary game theory in the context of WLAN access points and WiMAX networks. This approach illustrates how to improve the user perceived QoS in heterogeneous networks using a two-layered optimization. The top layer views the problem of prediction of the network that would be chosen by a user where the criteria are offered bit rate, price, mobility support and reputation. At the second level, conditional on the strategies chosen by the users, the network provider hypothetically, reconfigures the network, subject to the network constraints of bandwidth and acceptable SNR and optimizes the network coverage to support users who would otherwise not be serviced adequately. This forms an iterative cycle until a solution that optimizes the user satisfaction subject to the adjustments that the network provider can make to mitigate the binding constraints, is found and applied to the real network. The evolutionary equilibrium, which is used to 3 compute the average number of users choosing each wireless service, is taken as the solution. This thesis also proposes a fair and practical cooperation framework in which the base stations belonging to the same network provider cooperate, to serve each other‘s customers. How this cooperation can potentially increase their aggregate payoffs through efficient utilization of resources is shown for the case of dynamic frequency allocation. This cooperation framework needs to intelligently determine the cooperating partner and provide a rational basis for sharing aggregate payoff between the cooperative partners for the stability of the coalition. The optimum cooperation strategy, which involves the allocations of the channels to mobile customers, can be obtained as solutions of linear programming optimizations

Asynchronous Decision-Making Dynamics Under Best-Response Update Rule in Finite Heterogeneous Populations

To study how sustainable cooperation might emerge among self-interested interacting individuals, we investigate the long-run behavior of the decision-making dynamics in a finite, well-mixed population of individuals, who play collectively over time a population game. Repeatedly each individual is activated asynchronously to update her decision to either cooperate or defect according to the myopic best-response rule. The game's payoff matrices, chosen to be those of either prisoner's dilemma or snowdrift games to underscore cooperation-centered social dilemmas, are fixed, but can be distinct for different individuals. So, the overall population is heterogeneous. We first classify such heterogeneous individuals into different types according to their cooperating tendencies stipulated by their payoff matrices. Then, we show that no matter what initial strategies the individuals decide to use, surprisingly one can always identify one type of individuals as a benchmark such that after a sufficiently long but finite time, individuals more cooperative compared to the benchmark always cooperate, while those less cooperative compared to the benchmark defect. When such fixation takes place, the total number of cooperators in the population either becomes fixed or fluctuates at most by one. Such insight provides theoretical explanation for some complex behavior recently reported in simulation studies that highlight the puzzling effect of individuals' heterogeneity on collective decision-making dynamics

Optimising energy efficiency and spectral efficiency in multi-tier heterogeneous networks:performance and tradeoffs

The exponential growth in the number of cellular users along with their increasing demand of higher transmission rate and lower power consumption is a dilemma for the design of future generation networks. The spectral efficiency (SE) can be improved by better utilisation of the network resources at the cost of reduction in the energy efficiency (EE) due to the enormous increase in the network power expenditure arising from the densification of the network. One of the possible solutions is to deploy Heterogeneous Networks (HetNets) consisting of several tiers of small cell BSs overlaid within the coverage area of the macrocells. The HetNets can provide better coverage and data rate to the cell edge users in comparison to the macrocells only deployment. One of the key requirements for the next generation networks is to maintain acceptable levels of both EE and SE. In order to tackle these challenges, this thesis focuses on the analysis of the EE, SE and their tradeoff for different scenarios of HetNets. First, a joint network and user adaptive selection mechanism in two-tier HetNets is proposed to improve the SE using game theory to dynamically re-configure the network while satisfying the user's quality-of-service (QoS) requirements. In this work, the proposed scheme tries to offload the traffic from the heavily loaded small cells to the macrocell. The user can only be admitted to a network which satisfies the call admission control procedures for both the uplink and downlink transmission scheme. Second, an energy efficient resource allocation scheme is designed for a two-tier HetNets. The proposed scheme uses a low-complexity user association and power allocation algorithm to improve the uplink system EE performance in comparison to the traditional cellular systems. In addition, an opportunistic joint user association and power allocation algorithm is proposed in an uplink transmission scheme of device to device (D2D) enabled HetNets. In this scheme, each user tries to maximise its own Area Spectral Efficiency (ASE) subject to the required Area Energy Efficiency (AEE) requirements. Further, a near-optimal joint user association and power allocation approach is proposed to investigate the tradeoff between the two conflicting objectives such as achievable throughput and minimising the power consumption in two-tier HetNets for the downlink transmission scheme. Finally, a multi-objective optimization problem is formulated that jointly maximizes the EE and SE in two-tier HetNets. In this context, a joint user association and power allocation algorithm is proposed to analyse the tradeoff between the achievable EE and SE in two-tier HetNets. The formulated problem is solved using convex optimisation methods to obtain the Pareto-optimal solution for the various network parameters