Search results for "Nash equilibrium"
showing 8 items of 58 documents
On Unstructured File Sharing Networks
2007
We study the interaction among users of unstructured file sharing applications, who compete for available network resources (link bandwidth or capacity) by opening multiple connections on multiple paths so as to accelerate data transfer. We model this interaction with an unstructured file sharing game. Users are players and their strategies are the numbers of sessions on available paths. We consider a general bandwidth sharing framework proposed by Kelly [1] and Mo and Walrand [2], with TCP as a special case. Furthermore, we incorporate the Tit-for-Tat strategy (adopted by BitTorrent [3] networks) into the unstructured file sharing game to model the competition in which a connection can be …
A Bayesian Learning Automata-Based Distributed Channel Selection Scheme for Cognitive Radio Networks
2014
We consider a scenario where multiple Secondary Users SUs operate within a Cognitive Radio Network CRN which involves a set of channels, where each channel is associated with a Primary User PU. We investigate two channel access strategies for SU transmissions. In the first strategy, the SUs will send a packet directly without operating Carrier Sensing Medium Access/Collision Avoidance CSMA/CA whenever a PU is absent in the selected channel. In the second strategy, the SUs implement CSMA/CA to further reduce the probability of collisions among co-channel SUs. For each strategy, the channel selection problem is formulated and demonstrated to be a so-called "Potential" game, and a Bayesian Lea…
NASH EVOLUTIONARY ALGORITHMS: TESTING PROBLEM SIZE IN RECONSTRUCTION PROBLEMS IN FRAME STRUCTURES
2016
The use of evolutionary algorithms has been enhanced in recent years for solving real engineering problems, where the requirements of intense computational calculations are needed, especially when computational engineering simulations are involved (use of finite element method, boundary element method, etc). The coupling of game-theory concepts in evolutionary algorithms has been a recent line of research which could enhance the efficiency of the optimum design procedure and the quality of the design solutions achieved. They have been applied in several fields of engineering and sciences, mainly, in aeronautical and structural engineering (e.g: in computational fluid dynamics and solid mech…
Theoretical Game Approach for Mobile Users Resource Management in a Vehicular Fog Computing Environment
2018
Vehicular Cloud Computing (VCC) is envisioned as a promising approach to increase computation capabilities of vehicle devices for emerging resource-hungry mobile applications. In this paper, we introduce the new concept of Vehicular Fog Computing (VFC). The Fog Computing (FC) paradigm evolved and is employed to enhance the quality of cloud computing services by extending it to the edge of the network using one or more collaborative end-user clients or near-user edge devices. The VFC is similar to the VCC concept but uses vehicles resources located at the edge of the network in order to serve only local on-demand mobile applications. The aim of this paper is to resolve the problem of admissi…
Delegated agency in multiproduct oligopolies with indivisible goods
2010
This paper focuses on oligopolistic markets in which indivisible goods are sold by multiproduct firms to a continuum of homogeneous buyers, with measure normalized to one, who have preferences over bundles of products. Our analysis contributes to the literature on delegated agency games with direct externalities and complete information, extending the insights by Berheim and Whinston (1986, a , b) to markets with indivisibilities. By analyzing a kind of extended contract schedules - mixed bundling prices - that discriminate on exclusivity, the paper shows that efficient equilibria always exist in such settings. There may also exist inefficient equilibria in which the agent chooses a subopti…
On Capturing Oil Rents with a National Excise Tax Revisited
2004
In this paper the scope of Bergstrom’s (1982) results is studied. Moreover, his analysis is extended assuming that extraction cost is directly related to accumulated extractions. For the case of a competitive market it is found that the optimal policy is a constant tariff if extraction is costless. However, with depletion effects, the optimal tariff must ultimately be decreasing. For the case of a monopolistic market the results depend crucially on the kind of strategies the importing country governments can play and on whether the monopolist chooses the price or extraction rate. For a price-setting monopolist it is shown that the importing countries cannot use a tariff to capture monopoly …
Socially-aware Dynamic Computation Offloading Scheme for Fog Computing System with Energy Harvesting Devices
2018
Fog computing is considered as a promising technology to meet the ever-increasing computation requests from a wide variety of mobile applications. By offloading the computation-intensive requests to the fog node or the central cloud, the performance of the applications, such as energy consumption and delay, are able to be significantly enhanced. Meanwhile, utilizing the recent advances of social network and energy harvesting (EH) techniques, the system performance could be further improved. In this paper, we take the social relationships of the EH mobile devices (MDs) into the design of computational offloading scheme in fog computing. With the objective to minimize the social group executi…
Arm Space Decomposition as a Strategy for Tackling Large Scale Multi-armed Bandit Problems
2013
Recent multi-armed bandit based optimization schemes provide near-optimal balancing of arm exploration against arm exploitation, allowing the optimal arm to be identified with probability arbitrarily close to unity. However, the convergence speed drops dramatically as the number of bandit arms grows large, simply because singling out the optimal arm requires experimentation with all of the available arms. Furthermore, effective exploration and exploitation typically demands computational resources that grow linearly with the number of arms. Although the former problem can be remedied to some degree when prior knowledge about arm correlation is available, the latter problem persists. In this…