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

IoT security: Review, blockchain solutions, and open challenges

In this chapter we deal with the following nonlinear fractional programming problem: 

$$P:\mathop{{\max }}\limits_{{x \in s}} q(x) = (f(x) + \alpha )/((x) + \beta )$$

where f, g: R n → R, α, β ∈ R, S ⊆ R n . To simplify things, and without restricting the generality of the problem, it is usually assumed that, g(x) + β + 0 for all x ∈ S,S is non-empty and that the objective function has a finite optimal value.

Nonlinear Fractional Programming

: One use of spectral analysis of time series is to determine if two different time series are realizations from the same process This thesis develops the theory behind Krishnaiah and Schuurmann's theoretical work reported in their report Approximations to the Distributions of the Traces of Complex Multivariate Beta and F Matrices We take the trace of a test statistic calculated from the spectral density matrices of the time series and test it The thesis applies the theory to two small sample simulations (Author)

Spectral Analysis of Time Series.

Network-on-Chips (NoCs) are becoming integral parts of modern microprocessors as the number of cores and modules integrated on a single chip continues to increase. Research and development of future NoC technology relies on accurate modeling and simulations to evaluate the performance impact and analyze the cost of novel NoC architectures. In this work, we present BookSim, a cycle-accurate simulator for NoCs. The simulator is designed for simulation flexibility and accurate modeling of network components. It features a modular design and offers a large set of configurable network parameters in terms of topology, routing algorithm, flow control, and router microarchitecture, including buffer management and allocation schemes. BookSim furthermore emphasizes detailed implementations of network components that accurately model the behavior of actual hardware. We have validated the accuracy of the simulator against RTL implementations of NoC routers.

https://crd.lbl.gov/assets/booksimispass.pdf

A detailed and flexible cycle-accurate Network-on-Chip simulator

Recently, the use of artificial noise has attracted considerable attention in enhancing the physical-layer security of wireless systems. However, the interaction between artificially generated noise and the inherent network interference can significantly affect the level of secrecy. In this paper, we consider the additional secrecy enhancement with artificial noise and secrecy protected zone in the presence of eavesdroppers and interferers with unknown locations. Specifically, we derive the secrecy transmission rate and investigate the relationship between artificial noise and various system parameters like secrecy protected zone radius and intensity of interferers and eavesdroppers on the secrecy transmission rate. In interference-limited networks, we derive the optimal power allocation between the information-bearing signal and artificial noise to maximize the achievable secrecy transmission rate subject to connection and secrecy outage probabilities. Numerical results show that artificial noise is still beneficial in the presence of inherent network interference to improve secrecy transmission rate and provide rules of thumb to quantify when optimal power allocation is useful.

Enhanced Secrecy in Stochastic Wireless Networks: Artificial Noise With Secrecy Protected Zone

A robust speed control technique for a brushless direct-drive motor (BLDDM) using a variable structure control (VSC) approach is presented. The significant problems of conventional VSC are investigated in view of the practical implementation and an integral variable structure control with a load torque observer is proposed as an effective way of overcoming these problems. By employing the proposed control scheme, the robustness against the unknown disturbance can be improved in the transient state and the steady-state error can be minimised by an integral action. Furthermore, the reduction of the chattering is also realised by using a load torque observer. The proposed algorithms are implemented using the software of DSP TMS320C30 and the effectiveness is verified through the comparative simulations and experiments for the BLDDM driven by a three phase voltage-fed PWM inverter.

A Robust Speed Control of Brushless Direct Drive Motor Using Integral Variable Structure Control

The reactive α-oxoaldehydes such as glyoxal (GO) and methylglyoxal (MG) are generated in vivo from sugars through oxidative stress. GO and MG are believed to be removed from cells by glutathione-dependent glyoxalases and other aldehyde reductases. We isolated a number of GO-resistant (GOr) mutants from Escherichia coli strain MG1655 on LB plates containing 10 mM GO. By tagging the mutations with the transposon TnphoA-132 and determining their cotransductional linkages, we were able to identify a locus to which most of the GOr mutations were mapped. DNA sequencing of the locus revealed that it contains the yqhC gene, which is predicted to encode an AraC-type transcriptional regulator of unknown function. The GOr mutations we identified result in missense changes in yqhC and were concentrated in the predicted regulatory domain of the protein, thereby constitutively activating the product of the adjacent gene yqhD. The transcriptional activation of yqhD by wild-type YqhC and its mutant forms was established by an assay with a β-galactosidase reporter fusion, as well as with real-time quantitative reverse transcription-PCR. We demonstrated that YqhC binds to the promoter region of yqhD and that this binding is abolished by a mutation in the potential target site, which is similar to the consensus sequence of its homolog SoxS. YqhD facilitates the removal of GO through its NADPH-dependent enzymatic reduction activity by converting it to ethadiol via glycolaldehyde, as detected by nuclear magnetic resonance, as well as by spectroscopic measurements. Therefore, we propose that YqhC is a transcriptional activator of YqhD, which acts as an aldehyde reductase with specificity for certain aldehydes, including GO.

Transcriptional Activation of the Aldehyde Reductase YqhD by YqhC and Its Implication in Glyoxal Metabolism of Escherichia coli K-12

In this paper, we propose opportunistic jammer selection in a wireless security system for increasing the secure degrees of freedom (DoF) between a transmitter and a legitimate receiver (say, Alice and Bob). There is a jammer group consisting of S jammers among which Bob selects K jammers. The selected jammers transmit independent and identically distributed Gaussian signals to hinder the eavesdropper (Eve). Since the channels of Bob and Eve are independent, we can select the jammers whose jamming channels are aligned at Bob, but not at Eve. As a result, Eve cannot obtain any DoF unless it has more than KNj receive antennas, where Nj is the number of each jammer's transmit antenna, and hence KNj can be regarded as defensible dimensions against Eve. For the jamming signal alignment at Bob, we propose two opportunistic jammer selection schemes and find the scaling law of the required number of jammers for target secure DoF by a geometrical interpretation of the received signals.

Multiuser Diversity for Secrecy Communications Using Opportunistic Jammer Selection: Secure DoF and Jammer Scaling Law

In this paper, we propose a practical interference alignment technique based on an opportunistic user selection in a three-user $2\times 2$ MIMO interference channel where no information is allowed to be shared among transmitters. In the proposed scheme, the user whose interference signals from other transmitters are most aligned with each other is selected at each transmitter. We also investigate optimal and suboptimal beamforming at the selected receiver using extra degrees of freedom by multiple receive antennas. The proposed opportunistic interference aligned user selection (OIAUS) schemes combined with various postprocessing vectors are shown to achieve notable capacity compared to conventional opportunistic user selection schemes while they significantly reduce not only the amount of feedback information but also computational complexity.

Junghoon Lee

Papers

Enhanced Secrecy in Stochastic Wireless Networks: Artificial Noise With Secrecy Protected Zone

A Robust Speed Control of Brushless Direct Drive Motor Using Integral Variable Structure Control

Transcriptional Activation of the Aldehyde Reductase YqhD by YqhC and Its Implication in Glyoxal Metabolism of Escherichia coli K-12

Multiuser Diversity for Secrecy Communications Using Opportunistic Jammer Selection: Secure DoF and Jammer Scaling Law

Opportunistic Interference Aligned User Selection in Multiuser MIMO Interference Channels