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

RSSI is known to be a fickle indicator of whether a wireless link will work, for many reasons. This greatly complicates operation because it requires testing and adaptation to find the best rate, transmit power or other parameter that is tuned to boost performance. We show that, for the first time, wireless packet delivery can be accurately predicted for commodity 802.11 NICs from only the channel measurements that they provide. Our model uses 802.11n Channel State Information measurements as input to an OFDM receiver model we develop by using the concept of effective SNR. It is simple, easy to deploy, broadly useful, and accurate. It makes packet delivery predictions for 802.11a/g SISO rates and 802.11n MIMO rates, plus choices of transmit power and antennas. We report testbed experiments that show narrow transition regions (

/pdf/predictable-802-11-packet-delivery-from-wireless-channel-2r2rb9i2xd.pdf

Predictable 802.11 packet delivery from wireless channel measurements

Today's heterogeneous networks comprised of mostly macrocells and indoor small cells will not be able to meet the upcoming traffic demands. Indeed, it is forecasted that at least a $100\times$ network capacity increase will be required to meet the traffic demands in 2020. As a result, vendors and operators are now looking at using every tool at hand to improve network capacity. In this epic campaign, three paradigms are noteworthy, i.e., network densification, the use of higher frequency bands and spectral efficiency enhancement techniques. This paper aims at bringing further common understanding and analysing the potential gains and limitations of these three paradigms, together with the impact of idle mode capabilities at the small cells as well as the user equipment density and distribution in outdoor scenarios. Special attention is paid to network densification and its implications when transiting to ultra-dense small cell deployments. Simulation results show that comparing to the baseline case with an average inter site distance of 200 m and a 100 MHz bandwidth, network densification with an average inter site distance of 35 m can increase the average UE throughput by $7.56\times$ , while the use of the 10 GHz band with a 500 MHz bandwidth can further increase the network capacity up to $5\times$ , resulting in an average of 1.27 Gbps per UE. The use of beamforming with up to 4 antennas per small cell BS lacks behind with average throughput gains around 30% and cell-edge throughput gains of up to $2\times$ . Considering an extreme densification, an average inter site distance of 5 m can increase the average and cell-edge UE throughput by $18\times$ and $48\times$ , respectively. Our study also shows how network densification reduces multi-user diversity, and thus proportional fair alike schedulers start losing their advantages with respect to round robin ones. The energy efficiency of these ultra-dense small cell deployments is also analysed, indicating the benefits of energy harvesting approaches to make these deployments more energy-efficient. Finally, the top ten challenges to be addressed to bring ultra-dense small cell deployments to reality are also discussed.

Towards 1 Gbps/UE in Cellular Systems: Understanding Ultra-Dense Small Cell Deployments

Understand the fundamentals of wireless and MIMO communication with this accessible and comprehensive text. Viewing the subject through an information theory lens, but also drawing on other perspectives, it provides a sound treatment of the key concepts underpinning contemporary wireless communication and MIMO, all the way to massive MIMO. Authoritative and insightful, it includes over 330 worked examples and 450 homework problems, with solutions and MATLAB code and data available online. Altogether, this is an excellent resource for instructors and graduate students, as well as an outstanding reference for researchers and practicing engineers.

Foundations of MIMO Communication

Systems and methods for computing and/or utilizing mutual information based link metrics for a link in a wireless mesh network are disclosed. In one embodiment, one or more mutual information values are computed for a link between a transmitter of a first network node and a receiver of a second network node in a wireless mesh network. Each of the one or more mutual information values is computed for a different hypothesized transmission mode for the link. One or more link metrics for the link are computed as a function of the mutual information values, where each link metric is computed based on a different one of the one or more mutual information values. In this manner, a link metric is computed for each of the one or more hypothesized transmission modes for the link. At least one of the link metrics are then provided to a routing update module.

Metric computation for interference-aware routing

We investigate link-quality metrics (LQMs) based on raw bit-error-rate, effective signal-to-interference-plus-noise ratio, and mutual information (MI) for the purpose of fast link adaptation (LA) in communication systems employing orthogonal frequency-division multiplexing and multiple-input-multiple-output (MIMO) antenna technology. From these LQMs, the packet error rate (PER) can be estimated and exploited to select the modulation and coding scheme (MCS) among a class of candidate MCSs that achieves the maximum throughput for the current channel state under a specified target PER objective. We propose a novel MI-based LQM and compare the PER-estimation accuracy obtained with this LQM with that resulting from using other LQMs by means of comprehensive Monte Carlo simulations. Search methods for the MCS in the class that is most suitable for a given channel state are presented. An algorithm for obtaining a practical upper bound on the throughput of any LA scheme is proposed. The investigated LQMs are applied to the IEEE 802.11n standard with a 2 × 2 MIMO configuration and practical channel estimation. The proposed MI-based LQM yields the highest PER estimation accuracy, and its throughput shows only 1.7 dB signal-to-noise-ratio (SNR) loss with respect to the upper bound but up to 9.5 dB SNR gain, compared to the MCS maximizing the throughput for the current noise variance.

/pdf/fast-link-adaptation-for-mimo-ofdm-dd2gu4sqsk.pdf

Fast Link Adaptation for MIMO OFDM

Future wireless services are expected to provide data-rates in the order of 1 Gbps in local area and 100 Mbps in wide area. A very wide bandwidth is required to support such high rates, in the order of 100 MHz: this wideband will not be available for each operator, thus a shared access to the spectrum among operators is needed. An holistic approach to spectrum sharing is adopted in this paper: not a single layer or component is optimized, but the system as a whole. Advanced physical layer (PHY) and radio resource management (RRM) solutions, utilizing some cognitive radio concepts, are discussed.

Spectrum sharing for next generation wireless communication networks

We investigate link quality metrics (LQMs) based on mutual information (MI) for fast link adaptation (FLA) in IEEE 802.11n wireless local area network (WLAN) with convolutional coding and higher order modulations. The LQMs are scalar quantities that map the receiver's post-decoding behaviour in a frequency-selective channel into an equivalent behaviour in an AWGN channel. From this metric the expected packet error rate (PER) can be predicted. Two LQMs are presented that are derived from the SINRs of all sub-carriers and streams: the effective SNR and the effective mutual information. The effective mutual information is the mean mutual information including a correction factor which improves the PER estimation accuracy in various highly frequency-selective channels. The FLA algorithm dynamically selects a modulation and coding scheme (MCS) that maximizes the throughput (TP), while keeping the average PER over time below a target value. Furthermore, we present methods of searching for the most suitable MCS. Practical performance bounds are obtained by means of simulations. We show that both investigated LQMs yield accurate PER estimates and that the resulting TP of the FLA algorithm used in a 2 x 2 MIMO bit-interleaved coded modulation (BICM) OFDM system that performs channel estimation is only 1.7 dB from the performance bound of the TP.

Mutual Information Metrics for Fast Link Adaptation in IEEE 802.11n

The videophones based on Internet protocol (IP) are gaining increasing acceptance because of the enhanced compression capabilities using H.264/MPEG-4 AVC. H.264 offers high compression, but it also demands high degree of complexity. Hence, optimization to the maximum extent is required for designing the H.264 video encoder with real time performance on DSPs. In this paper a highly optimized H.264 baseline profile video encoder on a programmable DSP processor is presented.

Real time H.264 video encoder implementation on a programmable DSP processor for videophone applications

Heterogeneous network (HetNet) deployment is a key feature to increase the network capacity in LTE- Advanced and systems beyond One major obstacle is the interference from neighbor base-stations which can significantly degrade the system performance In this paper, we present downlink interference mitigation and cancellation algorithms for HetNets in the so-called almost blank subframe (ABS) scenario In the ABS scenario, one must differentiate between two cases, namely (1) the non- colliding case: the common reference symbols (CRS) of the serving and the dominant interfering cell are not overlapped, and (2) the colliding case: the CRS of the serving cell and the dominant interfering cell are overlapped For case (1) we propose a robust equalizer and a low-complexity variant of it For case (2) we present the application of the space alternating generalized expectation-maximization (SAGE) with a maximum a-posteriori (MAP) criterion Based on extensive realistic link-level simulations, the outcome for case (1) is that the proposed robust equalization technique is almost as good as the receiver with traditional CRS interference cancellation (IC) but with lower complexity and latency For case (2), we find that the SAGE-MAP with three SAGE cycles/iterations is sufficient to achieve the same performance as the receiver with ideal CRS-IC

Shashi Kant

Papers

Fast Link Adaptation for MIMO OFDM

Spectrum sharing for next generation wireless communication networks

Mutual Information Metrics for Fast Link Adaptation in IEEE 802.11n

Real time H.264 video encoder implementation on a programmable DSP processor for videophone applications

Robust UE Receiver with Interference Cancellation in LTE Advanced Heterogeneous Network