Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

Game theory (GT) has been used with significant success to formulate, and either design or optimize, the operation of many representative communications and networking scenarios. The games in these scenarios involve, as usual, diverse players with conflicting goals. This paper primarily surveys the literature that has applied theoretical games to wireless networks, emphasizing use cases of upcoming multiaccess edge computing (MEC). MEC is relatively new and offers cloud services at the network periphery, aiming to reduce service latency backhaul load, and enhance relevant operational aspects such as quality of experience or security. Our presentation of GT is focused on the major challenges imposed by MEC services over the wireless resources. The survey is divided into classical and evolutionary games. Then, our discussion proceeds to more specific aspects which have a considerable impact on the game’s usefulness, namely, rational versus evolving strategies, cooperation among players, available game information, the way the game is played (single turn, repeated), the game’s model evaluation, and how the model results can be applied for both optimizing resource-constrained resources and balancing diverse tradeoffs in real edge networking scenarios. Finally, we reflect on lessons learned, highlighting future trends and research directions for applying theoretical model games in upcoming MEC services, considering both network design issues and usage scenarios.

/pdf/game-theory-for-multi-access-edge-computing-survey-use-cases-3qlj2r3njs.pdf

Game Theory for Multi-Access Edge Computing: Survey, Use Cases, and Future Trends

Internet of Things (IoT) enables modern improvements in smart sensors, RFID, Internet technologies, and communication protocols. Sensor nodes are treated as smart devices and widely used to gather and forward sensed information. However, besides intrinsic constraints on sensor nodes, they are vulnerable to a variety of security threats. This paper presents an energy-aware and secure multi-hop routing (ESMR) protocol by using a secret sharing scheme to increase the performance of energy efficiency with multi-hop data security against malicious actions. The proposed protocol comprises three main aspects. First, the network field is segmented into inner and outer zones based on the node location. Furthermore, in each zone, numerous clusters are generated on the basis of node neighborhood vicinity. Second, the data transmission from cluster heads in each zone towards the sink node is secured using the proposed efficient secret sharing scheme. In the end, the proposed solution evaluates the quantitative analysis of data links to minimize the routing disturbance. The presented work provides a lightweight solution with secure data routing in multi-hop approach for the IoT-based constrained wireless sensor networks (WSNs). The experimental results demonstrate the efficacy of proposed energy-aware and secure multi-hop routing protocol in terms of network lifetime by 38%, network throughput by 34%, energy consumption by 34%, average end-to-end delay by 28%, and routing overhead by 36% in comparison with the existing work.

/pdf/secret-sharing-based-energy-aware-and-multi-hop-routing-2pmmexuqoi.pdf

Secret Sharing-Based Energy-Aware and Multi-Hop Routing Protocol for IoT Based WSNs

In most of the applications of wireless sensor networks (WSNs), nodes operate in unattended environments and are, therefore, vulnerable to variety of attacks. Due to dynamic and unpredictable changing behavior of nodes, the reliable data delivery is a challenging task. For WSNs, the traditional cryptographic and authentication-based solutions cannot be adopted due to their associated cost and incapability to counter nodes misbehavior attacks. Recently, trust-based solutions have proved to be more effective to address nodes' misbehavior attacks. However, the existing solutions give rise to high energy consumption and control overheads in pursuit of trust estimation and network-wide dissemination, which not only adds to network congestion but also undermines network lifetime. In this paper, we present a trust and energy aware routing protocol (TERP) that makes use of a distributed trust model for the detection and isolation of misbehaving and faulty nodes. Moreover, TERP incorporates a composite routing function that encompasses trust, residual-energy, and hopcounts of neighbor nodes in making routing decisions. This multi-facet routing strategy helps to balance out energy consumption among trusted nodes, while routing data using shorter paths. The simulation results demonstrate reduced energy consumption, improved throughout and network lifetime of TERP when compared with the existing work.

TERP: a trust and energy aware routing protocol for wireless sensor network

The security issue of the ad hoc network has attracted the attention of people.Therefore,the security of the routing protocol for the ad hoc network is the key problem.A secure ad hoc on-demand routing(SAOR)protocol suitable for ad hoc network is proposed,which uses the session key between pairs of mobile nodes and message anthentication code based on hash function to verify the validity of the route discovery and route replies.By binding the MAC address with ID of every node,the various complex attacks such as wormhole attacks are defended by the proposed neighbor-node maintenance mechanism.NS-2 simulation results show that SAOR can effectively detect and thwart most of attacks upon MANETs(mobile ad hoc network).

Secure On-demand Routing Protocol for Ad Hoc Network

Mobile Ad hoc Network (MANET) is a self-organizing wireless network for mobile devices. It does not require any fixed infrastructure to be configured which makes it more suitable to be used in environments that require on-the-fly setup. This paper discusses the challenging issues in MANET routing security. It presents FrAODV, a trust-based scheme for securing AODV routing protocol in MANET using the friendship mechanism. The nodes can evaluate the routing paths according to some selected features (such as node reputation and identity information) before forwarding the data through these routes. We have used two types of implementation in our scheme, simulation (using NS2) and real test-bed (using JADHOC). This scheme is believed to provide a robust environment where MANET nodes can trust each other in a secure community.

Trust-Based Routing Mechanism in MANET: Design and Implementation

Cooperation stimulation mechanisms for wireless multihop networks

Software-defined networks (SDN) is an evolution in networking field where the data plane is separated from the control plane and all the controlling and management tasks are deployed in a centralized controller. Due to its features regarding ease management, it is emerged in other fields such as cloud and fog computing in order to manage asymmetric communication across nodes, thus improving the performance and reducing the power consumption. This study focused on research that were conducted in SDN-based clouds and SDN-based fogs. It overviewed the important contributions in SDN clouds in terms of improving network performances and energy optimization. Moreover, state-of-the-art studies in SDN fogs are presented. The features, methods, environment, dataset, simulation tool and main contributions are highlighted. Finally, the open issues related to both SDN clouds and SDN fogs are defined and discussed.

https://www.mdpi.com/2073-8994/13/5/734/pdf

Resource Management in SDN-Based Cloud and SDN-Based Fog Computing: Taxonomy Study

In the autonomous environment of mobile ad hoc network (MANET) where nodes are free to move around and depend on each other to initiate communication, cooperation among nodes is an essential component of a successful data transmission process. Since there is no central controller such as router to determine the communication paths in MANET, each node in the ad hoc network has to rely on each other in order to forward packets, thus highly cooperative nodes are required to ensure that the initiated data transmission process does not fail. However, it is hard to encourage cooperativeness among nodes for each node owns limited resources that need to be preserved. These particular nodes which are also known as selfish nodes refuse to help other nodes in forwarding packets due to the anxiety of having resource degradation such as exhausted battery power and limited processor capability. This problem has aroused several issues in MANET: routing, security, quality of service (QoS), resource management and auto-configuration. Hence, there is a need to provide a mechanism that can encourage cooperation among nodes without jeopardizing their resources. In this paper, we provide evidence through simulation experiments on how a friendship concept could be used to minimize the number of false alarms raised in MANET intrusion detection system (IDS). We also discuss on how the similar friendship concept could be used to address several challenges faced in MANET environment.

A Friend Mechanism for Mobile Ad Hoc Networks

In a mobile ad hoc network (MANET) where security is a crucial issue, trust plays an important factor that could improve the number of successful data transmission process. The higher the numbers of nodes that trust each other in the network means the higher successful communication process rates could be expected. To determine trust, there are several criteria need to be considered. These criteria which are also known as features or evidences can be used to represent each node's trust properties in the trust evaluation process prior to initiating certain packet forwarding task. Nodes that are able to present valid features requested by source node will be included in the MANET operations. The aim of this paper is to provide an overview of security vulnerabilities in MANET and the use of trust concept to enhance the security. This paper also discusses several potential features that have been used in existing works which are expected to be suitable to be used in the trust evaluation process to create a trusted MANET community.

Normalia Samian

Papers

Trust-Based Routing Mechanism in MANET: Design and Implementation

Cooperation stimulation mechanisms for wireless multihop networks

Resource Management in SDN-Based Cloud and SDN-Based Fog Computing: Taxonomy Study

A Friend Mechanism for Mobile Ad Hoc Networks

Towards Identifying Features of Trust in Mobile Ad Hoc Network