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

Cooperative spectrum sensing in cognitive radio networks: A survey

We propose novel cooperative spectrum sensing (CSS) algorithms for cognitive radio (CR) networks based on machine learning techniques which are used for pattern classification. In this regard, unsupervised (e.g., K-means clustering and Gaussian mixture model (GMM)) and supervised (e.g., support vector machine (SVM) and weighted K-nearest-neighbor (KNN)) learning-based classification techniques are implemented for CSS. For a radio channel, the vector of the energy levels estimated at CR devices is treated as a feature vector and fed into a classifier to decide whether the channel is available or not. The classifier categorizes each feature vector into either of the two classes, namely, the "channel available class" and the "channel unavailable class". Prior to the online classification, the classifier needs to go through a training phase. For classification, the K-means clustering algorithm partitions the training feature vectors into K clusters, where each cluster corresponds to a combined state of primary users (PUs) and then the classifier determines the class the test energy vector belongs to. The GMM obtains a mixture of Gaussian density functions that well describes the training feature vectors. In the case of the SVM, the support vectors (i.e., a subset of training vectors which fully specify the decision function) are obtained by maximizing the margin between the separating hyperplane and the training feature vectors. Furthermore, the weighted KNN classification technique is proposed for CSS for which the weight of each feature vector is calculated by evaluating the area under the receiver operating characteristic (ROC) curve of that feature vector. The performance of each classification technique is quantified in terms of the average training time, the sample classification delay, and the ROC curve. Our comparative results clearly reveal that the proposed algorithms outperform the existing state-of-the-art CSS techniques.

Machine Learning Techniques for Cooperative Spectrum Sensing in Cognitive Radio Networks

Machine-to-machine (M2M) communications enables networked devices to exchange information among each other as well as with business application servers and therefore creates what is known as the Internet-of-Things (IoT). The research community has a consensus for the need of a standardized protocol stack for M2M communications. On the other hand, cognitive radio technology is very promising for M2M communications due to a number of factors. It is expected that cognitive M2M communications will be indispensable in order to realize the vision of IoT. However cognitive M2M communications requires a cognitive radio-enabled protocol stack in addition to the fundamental requirements of energy efficiency, reliability, and Internet connectivity. The main objective of this paper is to provide the state of the art in cognitive M2M communications from a protocol stack perspective. This paper covers the emerging standardization efforts and the latest developments on protocols for cognitive M2M networks. In addition, this paper also presents the authors’ recent work in this area, which includes a centralized cognitive medium access control (MAC) protocol, a distributed cognitive MAC protocol, and a specially designed routing protocol for cognitive M2M networks. These protocols explicitly account for the peculiarities of cognitive radio environments. Performance evaluation demonstrates that the proposed protocols not only ensure protection to the primary users (PUs) but also fulfil the utility requirements of the secondary M2M networks.

Cognitive Machine-to-Machine Communications for Internet-of-Things: A Protocol Stack Perspective

Spectrum decision is the ability of a cognitive radio (CR) to select the best available spectrum band to satisfy secondary users' (SUs') quality of service (QoS) requirements, without causing harmful interference to licensed or primary users (PUs). Each CR performs spectrum sensing to identify the available spectrum bands and the spectrum decision process selects from these available bands for opportunistic use. Spectrum decision constitutes an important topic which has not been adequately explored in CR research. Spectrum decision involves spectrum characterization, spectrum selection and CR reconfiguration functions. After the available spectrum has been identified, the first step is to characterize it based not only on the current radio environment conditions, but also on the PU activities. The second step involves spectrum selection, whereby the most appropriate spectrum band is selected to satisfy SUs' QoS requirements. Finally, the CR should be able to reconfigure its transmission parameters to allow communication on the selected band. Key to spectrum characterization is PU activity modelling, which is commonly based on historical data to provide the means for predicting future traffic patterns in a given spectrum band. This paper provides an up-to-date survey of spectrum decision in CR networks (CRNs) and addresses issues of spectrum characterization (including PU activity modelling), spectrum selection and CR reconfiguration. For each of these issues, we highlight key open research challenges. We also review practical implementations of spectrum decision in several CR platforms.

/pdf/spectrum-decision-in-cognitive-radio-networks-a-survey-4zyh1oas7j.pdf

Spectrum Decision in Cognitive Radio Networks: A Survey

A survey of common control channel design in cognitive radio networks

A constantly available control channel facilitates control message exchange and spectrum coordination in cognitive radio (CR) ad hoc networks. When a dedicated control channel is unavailable, a control channel must be dynamically allocated in licensed channels and vacated for the presence of primary users (PUs). As a result, the establishment of such a control channel is a challenge. In this paper, an efficient recovery control channel (ERCC) design is proposed to address this challenge. This heuristic and distributed design approach is essentially based on the observed spectrum homogeneity in a neighborhood. By adaptively updating a list of channels commonly available to neighbors, each secondary user is able to efficiently establish new control channels among neighbors in response to PU activity changes. Therefore, a virtually “always on” control channel robust to PU activity can be realized by the proposed method. The contributions are summarized as follows: 1) The proposed method efficiently recovers control channels from PU activity changes and maintains network connectivity. 2) It extends the control channel coverage to facilitate broadcast and reduce control overhead and delay. 3) It minimizes the interference with PUs. Simulation results show that the proposed solution outperforms the classic group- and sequence-based solutions in the responsiveness to rapidly changing PU activity and the maintenance of connectivity. Furthermore, the increase in control channel coverage and the allocation of the highest quality channels to control channels can be well balanced with reliability and scalability in various network scenarios.

Efficient Recovery Control Channel Design in Cognitive Radio Ad Hoc Networks

In this paper, the problem of resource allocation optimization is studied for a single-cell multiuser cognitive radio network in the presence of primary user networks. The spectral access of the cognitive radio network is based on Orthogonal Frequency Division Multiple Access (OFDMA). A joint bandwidth and power allocation is performed so that users' rate requirements are satisfied, and the integrity of primary user communication is preserved. In this work, two unique challenges are addressed. The first is the incorporation of primary user activity in the design of resource allocation technique, and the second is the limited hardware capabilities of cognitive terminals compared to those available at the cognitive base station. To address these problems, a novel resource allocation framework is proposed based on the bandwidth-power product minimization, which is an effective metric in evaluating the spectral resource consumption in a cognitive radio environment. The framework takes into consideration the challenges aforementioned. The results show significant enhancement in spectral efficiency by using our framework compared to classical power adaptive optimization using iterative waterfilling scheme.

Multiuser Resource Allocation Optimization Using Bandwidth-Power Product in Cognitive Radio Networks

In cognitive radio networks, spectrum sensing is a fundamental function for detecting the presence of primary users in licensed frequency bands. Due to multipath fading and shadowing, the performance of detection may be considerably compromised. To improve the detection probability, cooperative sensing is an effective approach for secondary users to cooperate and combat channel impairments. This approach, however, incurs overhead such as sensing delay for reporting local decisions and the increase of control traffic in the network. In this paper, a reinforcement learning-based cooperative sensing method is proposed to address the cooperation overhead problem. By using the proposed cooperative sensing model, the secondary user learns to (i) find the optimal set of cooperating neighbors with minimum control traffic, (ii) minimize the overall cooperative sensing delay, (iii) select independent users for cooperation under correlated shadowing, and (iv) improve the energy efficiency for cooperative sensing. The simulation results show that the proposed reinforcement learning-based cooperative sensing method reduces the overhead of cooperative sensing while effectively improving the detection performance to combat correlated shadowing.

Brandon F. Lo

Papers

Cooperative spectrum sensing in cognitive radio networks: A survey

A survey of common control channel design in cognitive radio networks

Efficient Recovery Control Channel Design in Cognitive Radio Ad Hoc Networks

Multiuser Resource Allocation Optimization Using Bandwidth-Power Product in Cognitive Radio Networks

Reinforcement learning-based cooperative sensing in cognitive radio ad hoc networks