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

Digital processing of speech signals

Recent analysis by manufacturers and network operators has shown that current wireless networks are not very energy efficient, particularly the base stations by which terminals access services from the network. In response to this observation the Mobile Virtual Centre of Excellence (VCE) Green Radio project was established in 2009 to establish how significant energy savings may be obtained in future wireless systems. This article discusses the technical background to the project and discusses models of current energy consumption in base station devices. It also describes some of the most promising research directions in reducing the energy consumption of future base stations.

/pdf/green-radio-radio-techniques-to-enable-energy-efficient-3j1elryk04.pdf

Green radio: radio techniques to enable energy-efficient wireless networks

Space-Time Block Coding for Wireless Communications

After about a decade of intense research, spurred by both economic and operational considerations, and by environmental concerns, energy efficiency has now become a key pillar in the design of communication networks. With the advent of the fifth generation of wireless networks, with millions more base stations and billions of connected devices, the need for energy-efficient system design and operation will be even more compelling. This survey provides an overview of energy-efficient wireless communications, reviews seminal and recent contribution to the state-of-the-art, including the papers published in this special issue, and discusses the most relevant research challenges to be addressed in the future.

A Survey of Energy-Efficient Techniques for 5G Networks and Challenges Ahead

Recently, energy efficiency in wireless networks has become an important objective. Aside from the growing proliferation of smartphones and other high-end devices in conventional human-to-human (H2H) communication, the introduction of machine-to-machine (M2M) communication or machine-type communication into cellular networks is another contributing factor. In this paper, we investigate quality-of-service (QoS)-driven energy-efficient design for the uplink of long term evolution (LTE) networks in M2M/H2H co-existence scenarios. We formulate the resource allocation problem as a maximization of effective capacity-based bits-per-joule capacity under statistical QoS provisioning. The specific constraints of single carrier frequency division multiple access (uplink air interface in LTE networks) pertaining to power and resource block allocation not only complicate the resource allocation problem, but also render the standard Lagrangian duality techniques inapplicable. We overcome the analytical and computational intractability by first transforming the original problem into a mixed integer programming (MIP) problem and then formulating its dual problem using the canonical duality theory. The proposed energy-efficient design is compared with the spectral efficient design along with round robin (RR) and best channel quality indicator (BCQI) algorithms. Numerical results, which are obtained using the invasive weed optimization (IWO) algorithm, show that the proposed energy-efficient uplink design not only outperforms other algorithms in terms of energy efficiency while satisfying the QoS requirements, but also performs closer to the optimal design.

Energy Efficient Uplink Resource Allocation in LTE Networks with M2M/H2H Co-existence under Statistical QoS Guarantees

In this paper we develop a framework for resource allocation in a secondary spectrum access scenario, where a group of cognitive radios (CR) access the resources of a primary system. We assume the primary system is a cellular OFDM-based network operating in uplink. We develop an optimum resource allocation strategy, using cooperative game theory, which guarantees the primary's required QoS and allocates an achievable rate at a given bit error rate for the secondary, when possible. The proposed cognitive radio game (CRG) is a network-assisted resource management method, where users (both primary and secondary) inform the primary system's BS of their channel state information and power limitation and the base station calculates the optimum sub-channel and power allocation for all users. Using Game theoretic axiom of fairness, i.e., Nash Bargaining Solutions (NBS), we develop an alternative efficient and fair resource allocation and compare its performance with the proposed CRG method. We use Sequential Quadratic Programming (SQP) to solve the proposed non-linearly constrained CRG optimization problem.

Cognitive Radio game for secondary spectrum access problem

In this paper, we study the effect of channel estimation error at the receiver on the mutual information of a multiple-input-multiple-output (MIMO) channel obeying correlated Rayleigh fading. We assume that perfect knowledge of the channel correlation is available at the receiver and find upper and lower bounds on the mutual information for Gaussian input signals. We prove that for a generic input covariance matrix, the gap between these two bounds at high transmit powers does not exceed a certain value, which depends on the number of nonzero eigenvalues of the receive correlation matrix. We also show that in a system with uncorrelated transmit antennas and correlated receive antennas and with uniform power distribution over the transmit antennas, these bounds are asymptotically tight for a large number of transmit antennas. We show that when the correlation information is available at the transmitter, the transmitting strategy that maximizes the mutual information lower bound is to transmit toward the directions of the eigenvectors of the transmit correlation matrix. We further derive upper and lower bounds on the mutual information of a MIMO multiple-access channel with imperfect channel estimation at the receiver. We also prove that when the input power at each user is uniformly distributed over its transmit antennas, the bounds on the mutual information are asymptotically tight for Gaussian input signals, and this tightness increases when the number of users increases. Numerical simulations are conducted to corroborate theoretical results.

Effect of Channel Uncertainty on the Mutual Information of MIMO Fading Channels

Efficient and fair resource allocation strategies are being extensively studied in current research in order to address the requirements of future wireless applications. A novel resource allocation scheme is developed for orthogonal frequency-division multiplexing (OFDM) networks designed to maximise performance while limiting the received interference at each user. This received interference is in essence used as a fairness metric; moreover, by defining different interference tolerances for different sets of users, the proposed allocation scheme can be exploited in various cognitive radio scenarios. As applied to the scheme, the authors investigate a scenario where two cellular OFDM-based networks operate as primary and secondary systems in the same band, and the secondary system benefits by accessing the unused resources of the primary system if additional capacity is required. The primary system benefits either by charging the secondary system for the use of its resources or by some form of reciprocal arrangement allowing it to use the secondary system's licenced bands in a similar manner, when needed. Numerical results show our interference-limited scheduling approach to achieve excellent levels of efficiency and fairness by allocating resources more intelligently than proportional fair scheduling. A further important contribution is the application of sequential quadratic programming to solve the non-convex optimisation problems which arise in such scenarios.

Interference-limited resource allocation for cognitive radio in orthogonal frequency-division multiplexing networks

Space-time block codes are known to orthogonalize the multiple-input multiple-output (MIMO) wireless channel, thus reducing the space-time vector detection to a simpler scalar detection problem. The capacity over orthogonalized ergodic correlated Rayleigh and Ricean flat-fading MIMO channels has so far only been given in integral form. This letter derives a closed form capacity expression over such channels, hence avoiding numerical integrations or Monte Carlo simulations.

Mohammad Reza Nakhai

Papers

Energy Efficient Uplink Resource Allocation in LTE Networks with M2M/H2H Co-existence under Statistical QoS Guarantees

Cognitive Radio game for secondary spectrum access problem

Effect of Channel Uncertainty on the Mutual Information of MIMO Fading Channels

Interference-limited resource allocation for cognitive radio in orthogonal frequency-division multiplexing networks

Closed-form capacity expressions of orthogonalized correlated MIMO channels