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 document provides updates to IEEE Std 802.16's MIB for the MAC, PHY and asso- ciated management procedures in order to accommodate recent extensions to the standard.

IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions

Botnet is a thorny and a grave problem of today's Internet, resulting in economic damage for organizations and individuals. Botnet is a group of compromised hosts running malicious software program for malicious purposes, known as bots. It is also worth mentioning that the current trend of botnets is to hide their identities (i.e., the command and control server) using the DNS services to hinder their identification process. Fortunately, different approaches have been proposed and developed to tackle the problem of botnets; however, the problem still rises and emerges causing serious threat to the cyberspace-based businesses and individuals. Therefore, this paper comes up to explore the various botnet detection techniques through providing a survey to observe the current state of the art in the field of botnet detection techniques based on DNS traffic analysis. To the best of our knowledge, this is the first survey to discuss DNS-based botnet detection techniques in which the problems, existing solutions and the future research direction in the field of botnet detection based on DNS traffic analysis for effective botnet detection mechanisms in the future are explored and clarified.

A survey of botnet detection based on DNS

The growing popularity of multihoming mobile terminals has encouraged the use of concurrent multipath transfer (CMT) to provide network diversity and accelerated content distribution in ubiquitous and heterogeneous wireless network environments. However, CMT severely degrades its performance, which is mostly due to both data reordering required as a result of great path dissimilarity and frequent packet loss due to wireless channel unreliability. Most delivery approaches follow the packet sequence numbers and thereby result in strict in-order and packet-specific reception. Passively adapting to the network variations, those approaches are not general enough to address CMT problems. This paper proposes to apply network coding (NC) principles to CMT, to break the strong binding between data packets and their sequence numbers, and then improve its performance. The proposed CMT-NC solution avoids data reordering to mitigate buffer blocking and compensates for the lost packets to reduce the number of retransmissions. Its specific encoding approach reduces the encoding complexity and fully ensures decoding feasibility. Furthermore, the group-based transmission management enhances the robustness and reliability of the data transfer. Simulation results show how CMT-NC is a highly efficient data transport solution outperforming existing state-of-the-art solutions.

CMT-NC: Improving the Concurrent Multipath Transfer Performance Using Network Coding in Wireless Networks

The heterogeneous network (HetNet) is an important concept for next-generation wireless Internet architecture and Internet of Things, where several wireless technologies can coexist, and the users should have the flexibility to select the connectivity based on the environmental condition and application demands. IEEE 802.11 (or WiFi) and IEEE 802.16 (or WiMAX) are the two primary building block technologies for HetNets because of their sustainability, cost effectiveness, well-deployed architectures, and ability to support high-data-rate wireless communications. The existing literature has extensively studied the interoperability between these two technologies, and seamless handover schemes are designed to support WiFi-WiMAX integration in a HetNet environment. However, effective utilization of these two technologies from the end users' point of view is another important research area. The authors have the following question: When should a user migrate between these two technologies in a HetNet environment? This paper proposes a handover decision mechanism in a WiFi-WiMAX integrated HetNet environment, which supports the “quality of service” and “quality of experience” requirements of the end users. The effectiveness of the proposed scheme is analyzed using simulation results.

Deciding Handover Points Based on Context-Aware Load Balancing in a WiFi-WiMAX Heterogeneous Network Environment

WiMAX and WiFi have emerged as promising broadband access solutions for the latest generation of wireless MANs and LANs, respectively. Their complementary features enable the use of WiMAX as a backhaul service to connect multiple dispersed WiFi hotspots to the Internet. This study proposes an integrated architecture utilizing a novel WiMAX/WiFi Access Point (W2-AP) device to effectively combine the WiMAX and WiFi technologies. In the proposed architecture, the protocol operation of the WiFi hotspots is the same as that of the WiMAX system. As a result, the WiFi network can support connection-oriented transmissions and QoS in a similar fashion to the WiMAX system, and thus a considerable improvement in the delay performance is obtained. The numerical results obtained using a Qualnet simulator confirm both the effectiveness and the efficiency of the proposed architecture.

http://ants.iis.sinica.edu.tw/3bkmj9ltewxtsrrvnoknfdxrm3zfwrr/63/An%20Integrated%20WiMAXWiFi%20Architecture%20with%20QoS%20Consistency%20over%20BroadbandWireless%20Networks.pdf

An Integrated WiMAX/WiFi Architecture with QoS Consistency over Broadband Wireless Networks

Broadband wireless access (BWA) networks, such as LTE and WiMAX, are inherently lossy due to wireless medium unreliability. Although the Hybrid Automatic Repeat reQuest (HARQ) error-control method recovers from packet loss, it has low transmission efficiency and is unsuitable for delay-sensitive applications. Alternatively, network coding techniques improve the throughput of wireless networks, but incur significant overhead and ignore network constraints such as Medium Access Control (MAC) layer transmission opportunities and physical (PHY) layer channel conditions. The present study provides analysis of Random Network Coding (RNC) and Systematic Network Coding (SNC) decoding probabilities. Based on the analytical results, SNC is selected for developing an adaptive network coding scheme designated as Frame-by-frame Adaptive Systematic Network Coding (FASNC). According to network constraints per frame, FASNC dynamically utilizes either Modified Systematic Network Coding (M-SNC) or Mixed Generation Coding (MGC). An analytical model is developed for evaluating the mean decoding delay and mean goodput of the proposed FASNC scheme. The results derived using this model agree with those obtained from computer simulations. Simulations show that FASNC results in both lower decoding delay and reduced buffer requirements compared to MRNC and N-in-1 ReTX, while also yielding higher goodput than HARQ, MRNC, and N-in-1 ReTX.

Adaptive Network Coding for Broadband Wireless Access Networks

Genetic-based real-time fast-flux service networks detection

Integration of Ethernet passive optical network (EPON) and WiMAX technologies is regarded as a promising solution for next-generation broadband access networks. In implementing such networks, efficient bandwidth allocation schemes are essential to satisfy quality of service (QoS) and fairness requirements of various traffic classes. Existing proposals for solving the bandwidth allocation problem in EPON/WiMAX networks neglect interactions between the self-interested EPON and WiMAX service providers (WSPs). Accordingly, this study proposes a two-stage game-theoretic framework for the intra-ONU bandwidth allocation process where the interactions between the EPON and WSPs are taken into account. In the first stage of the proposed framework, a fair and efficient sharing of the available upstream bandwidth between the EPON and WiMAX networks is determined using two market models (i.e., noncooperative and cooperative). In the second stage, the bandwidth allocation obtained from the first stage is distributed among the different traffic classes within the Ethernet and WiMAX networks in accordance with their QoS requirements by means of a Nash bargaining game. Simulation results show that the proposed game-theoretic framework efficiently allocates bandwidth under different market models while simultaneously ensuring proportional fairness among the various traffic classes for the corresponding networks.

Intra-ONU bandwidth allocation games in integrated EPON/WiMAX networks

Energy conservation is the key factor driving the trend toward green next-generation wireless networks. Existing studies have shown that cooperative communications can significantly reduce energy consumption. Most of these studies simplistically assume that all of the nodes in the network will cooperatively transmit. However, in practice, nodes may not always be altruistic and reject collaboration. Accordingly, this study proposes a reputation auction framework to provide indirect reciprocity for stimulating node cooperation in green wireless networks which also adapts to various network dynamics. Two sealed-bid auction schemes are presented to efficiently and fairly allocate node reputation for single and multiple relay scenarios resulting in energy savings arising from application of the considered indirect reciprocity model. The simulation results show that the proposed reputation auction framework can achieve higher energy efficiency compared to non-cooperative schemes and only slightly increases signaling overhead.

Ying-You Lin

Papers

An Integrated WiMAX/WiFi Architecture with QoS Consistency over Broadband Wireless Networks

Adaptive Network Coding for Broadband Wireless Access Networks

Genetic-based real-time fast-flux service networks detection

Intra-ONU bandwidth allocation games in integrated EPON/WiMAX networks

Reputation auction framework for cooperative communications in green wireless networks