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

A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT

A Systems and Control Perspective of CPS Security

The residential sector is a major contributor to the global energy balance. So far, the residential users demand has been largely uncontrollable and inelastic with respect to the power grid conditions. Demand Side Management (DSM) is an important function in smart grid that allows consumers to make informed decision regarding energy consumption, and helps energy providers to reshape the load profile and to reduce peak load demand. DSM can be mathematically formulated either to maximize the system total peak demand or to maximize overall system load factor and utility׳s revenue and to minimize customer electricity bill. This paper reviews the various optimization techniques applied to DSM as contrasting characteristics like individual users versus cooperative users, deterministic versus stochastic and day-ahead versus real time DSM. This paper reviews a survey on residential DSM, which can help general readers to have an outlook of the topic which includes the architecture, formulation of optimization problems and its various approaches. The issues, existing solutions and approaches are presented. In addition, the future research directions are also discussed to enhance the work in this domain.

A survey on residential Demand Side Management architecture, approaches, optimization models and methods

In this paper, a comprehensive survey of authentication protocols for Internet of Things (IoT) is presented. Specifically more than forty authentication protocols developed for or applied in the context of the IoT are selected and examined in detail. These protocols are categorized based on the target environment: (1) Machine to Machine Communications (M2M), (2) Internet of Vehicles (IoV), (3) Internet of Energy (IoE), and (4) Internet of Sensors (IoS). Threat models, countermeasures, and formal security verification techniques used in authentication protocols for the IoT are presented. In addition a taxonomy and comparison of authentication protocols that are developed for the IoT in terms of network model, specific security goals, main processes, computation complexity, and communication overhead are provided. Based on the current survey, open issues are identified and future research directions are proposed.

/pdf/authentication-protocols-for-internet-of-things-a-19mmiff9py.pdf

Authentication Protocols for Internet of Things: A Comprehensive Survey

In the emerging industrial Internet of Things (IIoT) era, machine-to-machine (M2M) communication technology is considered as a key underlying technology for building IIoT environments, where devices (e.g., sensors, actuators, and gateways) are enabled to exchange information with each other in an autonomous way without human intervention. However, most of the existing M2M protocols that can be also used in the IIoT domain provide security mechanisms based on asymmetric cryptography resulting in high computational cost. As a consequence, the resource-constrained IoT devices are not able to support them appropriately and thus, many security issues arise for the IIoT environment. Therefore, lightweight security mechanisms are required for M2M communications in IIoT in order to reach its full potential. As a step toward this direction, in this paper, we propose a lightweight authentication mechanism, based only on hash and XOR operations, for M2M communications in IIoT environment. The proposed mechanism is characterized by low computational cost, communication, and storage overhead, while achieving mutual authentication, session key agreement, device’s identity confidentiality, and resistance against the following attacks: replay attack, man-in-the-middle attack, impersonation attack, and modification attack.

/pdf/a-lightweight-authentication-mechanism-for-m2m-q36dfibgpw.pdf

A Lightweight Authentication Mechanism for M2M Communications in Industrial IoT Environment

Multi-standard mobile terminals (MTs) are the trend of current and future mobile devices for taking advantage of heterogeneous integration of wireless access networks and providing ubiquitous connectivity and better quality of service. Holding multiple active interfaces, however, incurs significant power consumption burdens to MTs. This not only increases the carbon footprint of MTs but also makes the batteries of MTs deplete rapidly. Consequently, mobile users may have to relentlessly look for power outlets to charge their devices, which may threaten their true mobility freedom. To this end, in this article, we propose a promising approach based on coalition formation game and inter-terminal cooperation. Our innovative approach motivates MTs to cooperate, while addressing the issue of isolating selfish players. MTs assess radio channels and disseminate the acquired information as well as their available resources to sketch a global view of the radio environment. Based on this view, coalitions are formed whenever energy saving is foreseeable. Within a coalition, MTs pool their resources and perform their tasks cooperatively to maximize their energy efficiency. Simulation results validate that the proposed approach can effectively double the battery lifetimes of MTs, while successfully eliminating selfish players from cooperative groups.

Coalition formation game toward green mobile terminals in heterogeneous wireless networks

An autonomous privacy-preserving authentication scheme for intelligent transportation systems

4G is a promising solution for the future mobile Internet through integrating heterogeneous radio access technologies (RATs) based on the Internet Protocol (IP) where multi-standard wireless devices allow mobile users to experience ubiquitous connectivity by roaming across different networks and connecting through the RAT that best suits their traffic requirements. However, holding multiple active interfaces incurs significant power consumption to the wireless devices. This necessitates investigating disruptive techniques for decreasing the power consumption of the 4G wireless devices. In this paper, we demonstrate how cognitive radio and cooperative communication can be integrated in 4G networks to conduct wireless devices to either perform vertical handover or execute relaying by exploiting their available short range interfaces (e.g., WiMedia, Bluetooth, etc) to reduce their power consumption while still enabling the required QoS. Simulation and experimental results validate that 4G wireless devices can double their battery lifetime by adopting the proposed strategies.

/pdf/cooperative-strategies-for-power-saving-in-multi-standard-2i0s16xdwm.pdf

Cooperative Strategies for Power Saving in Multi-standard Wireless Devices

Previous research efforts on developing an Intrusion Detection and Prevention Systems (IDPS) for Android mobile devices rely mostly on centralized data collection and processing on a cloud server. However, this trend is characterized by two major limitations. First, it requires a continuous connection between monitored devices and the server, which might be infeasible, due to mobile network’s outage or partial coverage. Second, it increases the risk of sensitive information leakage and the violation of user’s privacy. To help alleviate these problems, in this paper, we develop a novel Host-based IDPS for Android (HIDROID), which runs completely on a mobile device, with a minimal computation burden. It collects data in run-time, by periodically sampling features reflecting the utilization of scarce resources on a mobile device (e.g. CPU, memory, battery, bandwidth, etc.). The detection engine exploits statistical and machine learning algorithms to build a data-driven model for the benign behavior . Any observation failing to match this model triggers an alert, and the preventive agent takes proper countermeasure(s) to minimize the risk. HIDROID requires no malicious data for training or tuning, which makes it handy for day-to-day usage. Experimental test results, on a real-life device, show that HIDROID is well able to learn and discriminate normal from malicious behavior, with very promising accuracy of up to 0.9, while maintaining false positive rate by 0.03.

/pdf/hidroid-prototyping-a-behavioral-host-based-intrusion-3inao7r4qj.pdf

Firooz B. Saghezchi

Papers

A Lightweight Authentication Mechanism for M2M Communications in Industrial IoT Environment

Coalition formation game toward green mobile terminals in heterogeneous wireless networks

An autonomous privacy-preserving authentication scheme for intelligent transportation systems

Cooperative Strategies for Power Saving in Multi-standard Wireless Devices

HIDROID: Prototyping a Behavioral Host-Based Intrusion Detection and Prevention System for Android