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

This chapter is devoted to a more detailed examination of game theory. Game theory is an important tool for analyzing strategic behavior, is concerned with how individuals make decisions when they recognize that their actions affect, and are affected by, the actions of other individuals or groups. Strategic behavior recognizes that the decision-making process is frequently mutually interdependent. Game theory is the study of the strategic behavior involving the interaction of two or more individuals, teams, or firms, usually referred to as players. Two game theoretic scenarios were examined in this chapter: Simultaneous-move and multi-stage games. In simultaneous-move games the players effectively move at the same time. A normal-form game summarizes the players, possible strategies and payoffs from alternative strategies in a simultaneous-move game. Simultaneous-move games may be either noncooperative or cooperative. In contrast to noncooperative games, players of cooperative games engage in collusive behavior. A Nash equilibrium, which is a solution to a problem in game theory, occurs when the players’ payoffs cannot be improved by changing strategies. Simultaneous-move games may be either one-shot or repeated games. One-shot games are played only once. Repeated games are games that are played more than once. Infinitely-repeated games are played over and over again without end. Finitely-repeated games are played a limited number of times. Finitely-repeated games have certain or uncertain ends.

An Introduction to Game Theory

In the fifth generation (5G) of wireless communication systems, hitherto unprecedented requirements are expected to be satisfied. As one of the promising techniques of addressing these challenges, non-orthogonal multiple access (NOMA) has been actively investigated in recent years. In contrast to the family of conventional orthogonal multiple access (OMA) schemes, the key distinguishing feature of NOMA is to support a higher number of users than the number of orthogonal resource slots with the aid of non-orthogonal resource allocation. This may be realized by the sophisticated inter-user interference cancellation at the cost of an increased receiver complexity. In this paper, we provide a comprehensive survey of the original birth, the most recent development, and the future research directions of NOMA. Specifically, the basic principle of NOMA will be introduced at first, with the comparison between NOMA and OMA especially from the perspective of information theory. Then, the prominent NOMA schemes are discussed by dividing them into two categories, namely, power-domain and code-domain NOMA. Their design principles and key features will be discussed in detail, and a systematic comparison of these NOMA schemes will be summarized in terms of their spectral efficiency, system performance, receiver complexity, etc. Finally, we will highlight a range of challenging open problems that should be solved for NOMA, along with corresponding opportunities and future research trends to address these challenges.

/pdf/a-survey-of-non-orthogonal-multiple-access-for-5g-47blcczlam.pdf

A Survey of Non-Orthogonal Multiple Access for 5G

Radio access technologies for cellular mobile communications are typically characterized by multiple access schemes, e.g., frequency division multiple access (FDMA), time division multiple access (TDMA), code division multiple access (CDMA), and OFDMA. In the 4th generation (4G) mobile communication systems such as Long-Term Evolution (LTE) (Au et al., Uplink contention based SCMA for 5G radio access. Globecom Workshops (GC Wkshps), 2014. doi:10.1109/GLOCOMW.2014.7063547) and LTE-Advanced (Baracca et al., IEEE Trans. Commun., 2011. doi:10.1109/TCOMM.2011.121410.090252; Barry et al., Digital Communication, Kluwer, Dordrecht, 2004), standardized by the 3rd Generation Partnership Project (3GPP), orthogonal multiple access based on OFDMA or single carrier (SC)-FDMA is adopted. Orthogonal multiple access was a reasonable choice for achieving good system-level throughput performance with simple single-user detection. However, considering the trend in 5G, achieving significant gains in capacity and system throughput performance is a high priority requirement in view of the recent exponential increase in the volume of mobile traffic. In addition the proposed system should be able to support enhanced delay-sensitive high-volume services such as video streaming and cloud computing. Another high-level target of 5G is reduced cost, higher energy efficiency and robustness against emergencies.

Non-Orthogonal Multiple Access (NOMA) for cellular future radio access

Non-orthogonal multiple access (NOMA) has been considered as a study-item in 3GPP for 5G new radio (NR). However, it was decided not to continue with it as a work-item, and to leave it for possible use in beyond 5G. In this paper, we first review the discussions that ended in such decision. Particularly, we present simulation comparisons between the Welch-bound equality spread multiple access (WSMA)-based NOMA and multi-user multiple-input-multiple-output (MU-MIMO), where the possible gain of WSMA-based NOMA, compared to MU-MIMO, is negligible. Then, we summarize the 3GPP discussions on NOMA, and propose a number of methods to reduce the implementation complexity and delay of both uplink (UL) and downlink (DL) NOMA-based transmission, as different ways to improve its efficiency. Here, particular attention is paid to reducing the receiver complexity, the cost of hybrid automatic repeat request as well as the user pairing complexity. As demonstrated, different smart techniques can be applied to improve the energy efficiency and the end-to-end transmission delay of NOMA-based systems.

/pdf/a-survey-of-noma-current-status-and-open-research-challenges-4b9y4lozm6.pdf

A Survey of NOMA: Current Status and Open Research Challenges

In this paper, we study the user pairing in a downlink non-orthogonal multiple access (NOMA) network, where the base station allocates the power to the pairwise users within the cluster. In the considered NOMA network, a user with poor channel condition is paired with a user with good channel condition, when both their rate requirements are satisfied. Specifically, the quality of service for weak users can be guaranteed, since the transmit power allocated to strong users is constrained following the concept of cognitive radio. A distributed matching algorithm is proposed in the downlink NOMA network, aiming to optimize the user pairing and power allocation between weak users and strong users, subject to the users’ targeted rate requirements. Our results show that the proposed algorithm outperforms the conventional orthogonal multiple access scheme and approaches the performance of the centralized algorithm, despite its low complexity. In order to improve the system’s throughput, we design a practical adaptive turbo trellis coded modulation scheme for the considered network, which adaptively adjusts the code rate and the modulation mode based on the instantaneous channel conditions. The joint design work leads to significant mutual benefits for all the users as well as the improved system throughput.

/pdf/user-pairing-for-downlink-non-orthogonal-multiple-access-1u1oyn7gep.pdf

User Pairing for Downlink Non-Orthogonal Multiple Access Networks Using Matching Algorithm

In order to mitigate the shortage of wireless spectrum, the appealing concepts of cooperative communication techniques and cognitive radio (CR) networks have been combined for the sake of improving the spectral efficiency and hence the overall system throughput. We mainly survey the overlay spectrum access scheme in this novel cooperative CR (CCR) network context. Therefore, the interference between the licensed users/primary users (PUs) and the unlicensed users/cognitive users (CUs) can be offset by relying on some of the CUs to act as relay nodes. More specifically, we have investigated the cooperative relaying technique in the context of the overlay spectrum access scheme aiming for allowing the PUs to transmit at a lower power and/or at a higher throughput, while at the same time enabling the CUs to communicate using the bandwidth released. Additionally, gaming techniques can be employed for negotiating between the PUs and the CUs for determining the specific fraction of relaying and active transmission time. Therefore, we will consider two main schemes in the overlay spectrum access scheme based on the CCR network, which are the frequency division-based channel as well as the time-division based channel. Moreover, we have surveyed the relevant advances concerning the game-based model of the overlay-based CR network. Specifically, both the family of non-cooperative and cooperative games as well as matching games have been reviewed. Furthermore, we will review the joint design of coding, modulation, user-cooperation, and CCR techniques, which leads to significant mutual benefits for both the PUs and CUs.

/pdf/cooperative-overlay-spectrum-access-in-cognitive-radio-3rcmjfe8lg.pdf

Cooperative Overlay Spectrum Access in Cognitive Radio Networks

In recent years, non-orthogonal multiple access (NOMA) has been considered as a promising technique in 5G systems. The users in a NOMA system are cooperative and communicates at the same time slot. This paper proposes a scheme of user grouping to improve the sum rate, by treating the system model as a cooperative game in partition formation. The scheme of user grouping divides users into different coalitions and time slots are allocated to these coalitions. In this scheme, users are allowed to stay alone and communicate with orthogonal multiple access (MA) techniques. Preference relation and sequence game are employed as two algorithms to resolve the coalitional game in partition formation. The simulation results show that the sum rate can be significantly improved by these two algorithms.

A game theory approach for user grouping in hybrid non-orthogonal multiple access systems

A pragmatic distributed algorithm (PDA) is proposed for supporting the efficient spectral access of multiple Primary Users (PUs) and Cognitive Users (CUs) in cooperative Cognitive Radio (CR) networks. The novelty of our PDA is that the PUs negotiate with the CUs concerning the specific amount of relaying and transmission time, the CU is granted, which the CU will either accept or decline. The CUs may serve as relay nodes for relaying the signal received from the PUs to their destinations, while both the PUs' and the CUs' minimum rate requirements are satisfied. This will reduce the required transmission power and/or increase the transmission rate of the PU. Our results show that the proposed scheme performs better than the benchmarker, despite its significantly lower overhead and complexity. Moreover, we show that the cooperative spectral access based on our PDA reaches an equilibrium, when it is repeated for a sufficiently long duration. These benefits are achieved, because the PUs are motivated to cooperate by the incentive of achieving a higher PU rate, whilst non-cooperation can be discouraged with the aid of a limited-duration punishment. Furthermore, we invoke an attractive practical adaptive Turbo Trellis Coded Modulation (ATTCM) scheme, which appropriately adjusts the code rate and the modulation mode according to the near-instantaneous channel conditions. It was found that the joint design of coding, modulation and user-cooperation may lead to significant mutual benefits for all the PUs and the CUs.

/pdf/pragmatic-distributed-algorithm-for-spectral-access-in-32js9dpq3f.pdf

Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

An adaptive dynamic network coding (ADNC) scheme conceived for cooperative cognitive radio (CCR) is proposed for devising a novel ADNC-CCR system. The system is designed for supporting communications between multiple primary users (PUs) and a common base station (BS), where the independent source information is transmitted from the PUs to the BS with the aid of multiple cognitive users (CUs) acting as relay nodes (RNs). To facilitate the recovery of the source information at the BS, the CUs invoke the ADNC technique, which is assisted by our cooperative protocol operating by exchanging the CCR-based control information between near-instantaneously adaptive turbo trellis coded modulation (ATTCM) and network coding (NC) codec, as well as between the CUs and the BS. More particularly, near-instantaneous ATTCM is employed for appropriately adjusting both the modulation mode and the code rate of the channel coding itself and of the NC, according to the near-instantaneous channel conditions. As a result, our novel ADNC-CCR system constructed on the basis of our holistic approach is capable of providing an increased throughput, despite reducing the transmission period of the PU. This reduced transmission period can also be directly translated into an increased duration for secondary communications of the CUs. In our proposed ADNC-CCR scheme, both the PUs and CUs employ our ATTCM scheme. As an additional novelty, the network encoder may also be activated in its adaptive mode for supporting the CUs, depending on the Boolean value of the feedback flags generated based on the success/failure of the ATTCM decoder and of the network decoder, which is evaluated and fed back by the BS. Quantitatively, it was found that the joint holistic design of our ATTCM-ADNC-CCR scheme is either capable of freeing up an approximately 40% of the PU's bandwidth in comparison to its noncooperative counterpart or increasing the attainable throughput by 2 bits/symbol.

/pdf/adaptive-ttcm-aided-near-instantaneously-adaptive-dynamic-2o2ou4o4ys.pdf

Wei Liang

Papers

User Pairing for Downlink Non-Orthogonal Multiple Access Networks Using Matching Algorithm

Cooperative Overlay Spectrum Access in Cognitive Radio Networks

A game theory approach for user grouping in hybrid non-orthogonal multiple access systems

Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

Adaptive-TTCM-Aided Near-Instantaneously Adaptive Dynamic Network Coding for Cooperative Cognitive Radio Networks