Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce

Nowadays many companies have available large amounts of raw, unstructured data. Among Big Data enabling technologies, a central place is held by the MapReduce framework and, in particular, by its open source implementation, Apache Hadoop. For cost effectiveness considerations, a common approach entails sharing server clusters among multiple users. The underlying infrastructure should provide every user with a fair share of computational resources, ensuring that Service Level Agreements (SLAs) are met and avoiding wastes. In this paper we consider two mathematical programming problems that model the optimal allocation of computational resources in a Hadoop 2.x cluster with the aim to develop new capacity allocation techniques that guarantee better performance in shared data centers. Our goal is to get a substantial reduction of power consumption while respecting the deadlines stated in the SLAs and avoiding penalties associated with job rejections. The core of this approach is a distributed algorithm for runtime capacity allocation, based on Game Theory models and techniques, that mimics the MapReduce dynamics by means of interacting players, namely the central Resource Manager and Class Managers

A survey on intelligent computation offloading and pricing strategy in UAV-Enabled MEC network: Challenges and research directions

The lack of resource constraints for edge servers makes it difficult to simultaneously perform a large number of Mobile Devices’ (MDs) requests. The Mobile Network Operator (MNO) must then select how to delegate MD queries to its Mobile Edge Computing (MEC) server in order to maximize the overall benefit of admitted requests with varying latency needs. Unmanned Aerial Vehicles (UAVs) and Artificial Intelligent (AI) can increase MNO performance because of their flexibility in deployment, high mobility of UAV, and efficiency of AI algorithms. There is a trade-off between the cost incurred by the MD and the profit received by the MNO. Intelligent computing offloading to UAV-enabled MEC, on the other hand, is a promising way to bridge the gap between MDs' limited processing resources, as well as the intelligent algorithms that are utilized for computation offloading in the UAV-MEC network and the high computing demands of upcoming applications. This study looks at some of the research on the benefits of computation offloading process in the UAV-MEC network, as well as the intelligent models that are utilized for computation offloading in the UAV-MEC network. In addition, this article examines several intelligent pricing techniques in different structures in the UAV-MEC network. Finally, this work highlights some important open research issues and future research directions of Artificial Intelligent (AI) in computation offloading and applying intelligent pricing strategies in the UAV-MEC network

Complexity and monitoring of economic operations using a game-theoretic model for cloud computing

In this study, a model is presented for allocating cloud computing resources based on economic considerations using tools from game theory. The model, called the Non-Cooperative Game Resource Allocation Algorithm (NCGRAA), is designed to achieve the optimum stage in cloud computing. In addition, the Bargaining Game Resource Allocation Algorithm (BGRAA) is introduced to the existing system to develop the billing process within the constraints of availability and fairness. This system-based algorithm implements methods for converging on and improving the Nash Equilibrium and Nash Bargaining solutions. While the Nash equilibrium helps to develop decision-making concepts with game theory, one of its main goals is to achieve the desired outcome and avoid deviation from the working stage. Nash Bargaining is a unique solution that occurs between two parties and takes into account the process of bargaining to provide a fair solution that is scale invariant and independent. In recent years, cloud computing has become a popular way to manage computing services and enable producers and consumers to interact. This process allows users to obtain goods at an affordable cost from sellers according to their expectations. This research investigates the economic operation monitoring of cloud computing using the gaming theory model. A Static Negotiation Analysis Method with a Bargaining Process (SNAM-BP) for a dynamic conceptual framework is presented to display the weighted relationship between primary issues and keywords used to evaluate the potential partnership of each country.Web of Science112art. no. 5

Modelling of user requirements and behaviors in computational grids

In traditional distributed computing systems a few user types are found having ratherPeer ReviewedPostprint (published version