324,143 research outputs found
Cournot–Nash equilibria in limit exchange economies with complete markets and consistent prices
No full textn this paper, we analyse a model of non-cooperative exchange “à la Cournot–Nash”, proposed by Lloyd S. Shapley, in limit exchange economies. In contrast with the case with a finite number of traders, analysed by Sahi and Yao [Sahi, S., Yao, S., 1989, The non-cooperative equilibria of a trading economy with complete markets and consistent prices, Journal of Mathematical Economics 18, 325–346], we show that the non-uniqueness of market clearing prices induces an indeterminacy in traders' payoffs for individual deviations. In order to overcome this difficulty, we define a Cournot–Nash equilibrium concept by considering as possible equilibria only the strategy selections for which the aggregate bid matrix is irreducible. Then, we show an equivalence “à la Aumann” between the set of Cournot–Nash equilibrium allocations and the set of Walras equilibrium allocations under the assumption that the set of commodities in the economy is a net. Finally, we show the existence of a Cournot–Nash equilibrium as an easy corollary of the equivalence theorem
Xanthomonas vs Caulobacter
No full textXac WT pBRaφ pBRR MCS5 GFP (code 9) vs Caulobacter competition<strong>Tilt Series Date:</strong> 2017-03-09</p>
<strong>Data Taken By:</strong> Debnath Ghosal</p>
<strong>Species / Specimen:</strong> Xanthomonas citri</p>
<strong>Strain:</strong> pv citri 306</p>
<strong>Tilt Series Settings:</strong> Single Axis, tilt range: (-60.0°, 60.0°), step: 2°, constant angular increment, dosage: 160.0 eV/Ų, defocus: -8.0 μm, magnification: 27500x. </p>
<strong>Microscope:</strong> Caltech Polara</p>
<strong>Acquisition Software:</strong> UCSFTomo</p>
<strong>Upload Method:</strong> pipeline</p>
<strong>Processing Software Used:</strong> Raptor</p>
<strong>Collaborators and Roles:</strong> Chuck Farah lab made the strains, data collected by Debnath Ghosal.</p>
<strong>Purification / Growth Conditions / Treatment:</strong> 4 µL mixture of Xac and Caulobacter cells were pipetted on top of Au-Finder grids. These grids were glow discharged in advance and kept on top of Agar pads. Carbon side up. These were then kept at the BSL-II hood and left for about 10 min before freezing.</p>
<strong>Sample Preparation:</strong> Freezing conditions: Blot force 6, wait time=0, drain time =1 sec, blot time= 10 sec</p>
dga2017-03-09-26_slicer17990.jpg: calobater S layer- Xac interaction interface . Xac 20nm t4SS?? dga2017-03-09-26_slicer17991.jpg: t4SS? dga2017-03-09-26_slicer17992.jpg: fiber like structrure? 25nmFiles available via S3 at https://renc.osn.xsede.org/ini210004tommorrell/tomography_archive/dga2017-03-09-26</p>Xac_Cc_20170309a0030.mrc, Tilt Series (Pixel Size 0.39 nm), 1.7 GB
<a role="button" class="ui compact mini button" href="https://renc.osn.xsede.org/ini210004tommorrell/tomography_archive/dga2017-03-09-26/rawdata/Xac_Cc_20170309a0030.mrc"
> <i class="download icon"></i> Download </a></p>
Xac_Cc_20170309a0030_part61_20.rec, Reconstruction (Pixel Size 1.56 nm), 445.4 MB
<a role="button" class="ui compact mini button" href="https://renc.osn.xsede.org/ini210004tommorrell/tomography_archive/dga2017-03-09-26/3dimage_83048/Xac_Cc_20170309a0030_part61_20.rec"
> <i class="download icon"></i> Download </a></p>
Three models of noncooperative oligopoly in markets with a continuum of traders
No full textIn this paper, we reconstruct the main developments of the theory of noncooperative oligopoly in general equilibrium, by focusing on the analysis of three prototypical models for pure exchange economies: the model of Cournot-Walras equilibrium of Codognato and Gabszewicz (1991); the model of Cournot-Nash equilibrium originally proposed by Lloyd S. Shapley and known as window model; the model of Cournot-Walras equilibrium of Busetto et al. (2008). We establish, in a systematic way, the relationship between the three notions of equilibrium proposed in these models and the notion of Walras equilibrium. Then, we investigate the relationships among those three notions of equilibrium
Cournot-Walras equilibrium as a subgame perfect equilibrium
No full textIn this paper, we investigate the problem of the strategic foundation of the Cournot-Walras equilibrium approach. To this end, we respecify a la Cournot-Walras the mixed version of a model of simultaneous, noncooperative exchange, originally proposed by Lloyd S. Shapley. We show, through an example, that the set of the Cournot-Walras equilibrium allocations of this respecification does not coincide with the set of the Cournot-Nash equilibrium allocations of the mixed version of the original Shapley's model. As the nonequivalence, in a one-stage setting, can be explained by the intrinsic two-stage nature of the Cournot-Walras equilibrium concept, we are led to consider a further reformulation of the Shapley's model as a two-stage game, where the atoms move in the first stage and the atomless sector moves in the second stage. Our main result shows that the set of the Cournot-Walras equilibrium allocations coincides with a specific set of subgame perfect equilibrium allocations of this two-stage game, which we call the set of the Pseudo-Markov perfect equilibrium allocations
On existence of undominated pure strategy Nash equilibria in anonymous nonatomic games: a generalization
No full textIn this paper, we generalize the exitence result for pure strategy Nash equilibria in anonymous nonatomic games. By working directly on integrals of pure strategies, we also generalize, for the same class of games, the existence result for undominated pure strategy Nash equilibria even though, in general, the set of pure strategy Nash equilibria may fail to be weakly compact
Noncooperative oligopoly in markets with a continuum of traders
No full textWe show the existence of a pure strategy Cournot-Nash equilibrium for a model of noncooperative exchange where large traders, represented as atoms, and small traders, represented by an atomless part, are allowed to buy and sell all commodities. (C) 2010 Elsevier Inc. All rights reserved
Secure over-the-air software updates in connected vehicles: A survey
No full textCurrent trends forecast that Over-the-Air (OTA) software updates will be highly significant for future connected vehicles. The OTA update will enable upgrading the vehicle functionalities or bug fixations in the embedded software installed on its Electronic Control Units (ECUs) remotely. The introduction of OTA updates in the automotive industry has brought many advantages for both the Original Equipment Manufacturer (OEM) and the driver/owner. However, in terms of security, OTA updates are highly critical as they need complete access to the in-vehicle communication network. This survey highlights and discusses OTA software updates in the automotive sector, mainly from the security perspective. The major objective of this survey is to deliver a comprehensive outline of various research directions and approaches in OTA update technologies in vehicles. At first, we discuss the connected vehicle technology and then integrate the relationship of OTA update features with the connected vehicle. We further discuss both promising and secure OTA update approaches, that have gained a lot of attention recently. Furthermore, we present a comprehensive comparative study of the existing OTA update approaches on the basis of strengths, weaknesses and evaluation setup. The survey also focuses on the existing vehicle features that support OTA updates, and customer satisfaction and usability. Finally, we identify possible future research directions of OTA updates for automobiles, particularly in the area of security
Secure over-the-air software update for connected vehicles
No full textCurrent trends forecast that Over-the-Air (OTA) software updates will be highly significant for future connected vehicles. The OTA software updates will enable upgrading vehicle functionalities or bug fixations in embedded software installed on electronic control units remotely. However, in terms of security, OTA updates are highly critical as they need complete access to the in-vehicle communication network. Furthermore, scheduling OTA software updates at a massive scale over a cellular network is highly challenging. This paper proposes STRIDE, a novel technique for secure and scalable software updates using cloud through cellular network. STRIDE ensures end-to-end security using ciphertext-policy attribute-based encryption. To enable fast and reliable distribution of update package, we then propose a software update scheduling algorithm to serve dynamic traffic flow. Particularly, we integrate dynamic traffic flow with the Lyapunov-drift analysis framework, and establish throughput optimality of our proposed scheduling algorithm. We evaluate the performance of STRIDE through extensive experiments. Experimental results show that STRIDE reduces more than 52% computation and storage overheads, 60% propagation delay and increases throughput by 35% than the state-of-the-art solutions, in addition to enjoying the stronger security properties
DISC: A novel distributed on-demand clustering protocol for internet of multimedia things
No full textInternet of Multimedia Things (IoMT) are receiving significant attention due to a wide variety of applications, e.g., wildlife habitat monitoring, but they are often highly resource constrained. Compared to Internet of Things, preserving battery power of nodes, and maximizing the lifespan of IoMT are more critical and challenging as sensed data are mostly image/video instead of simple scalar. Recent studies have shown that clustering is an efficient solution to reduce energy consumption. In clusters, the role of each node changes to reduce energy consumption, thereby, prolonging lifespan. In this paper, we address the lifespan maximization problem in IoMT by designing a clustering protocol where clusters are formed dynamically. Specifically, we analyze and solve an optimization problem aiming to maximize the lifespan by reducing the energy consumption among cluster heads. Based on the analysis, we propose a novel DIStributed on-demand Clustering (DISC) protocol. Our cluster head election procedure is not periodic, but adaptive, based on the dynamism of the occurrence of events. This on-demand execution of DISC aims to significantly reduce computation and message overheads. We validate the performance of DISC through extensive experiments. Experimental results show that DISC is 25% more energy balanced and achieves 32% more lifespan as compared to two state-of-the-art solutions
- …
