Rate of convergence of a particle method to the solution of the Mc Kean-Vlasov's equation

This paper studies the rate of convergence of an appropriatediscretization scheme of the solution of the Mc Kean-Vlasovequation introduced by Bossy and Talay. More specifically,we consider approximations of the distribution and of thedensity of the solution of the stochastic differentialequation associated to the Mc Kean - Vlasov equation. Thescheme adopted here is a mixed one: Euler/weakly interactingparticle system. If $n$ is the number of weakly interactingparticles and $h$ is the uniform step in the timediscretization, we prove that the rate of convergence of thedistribution functions of the approximating sequence in the $L^1(\Omega\times \Bbb R)$ norm and in the sup norm is of theorder of $\frac 1{\sqrt n} + h $, while for the densities is ofthe order $ h +\frac 1 {\sqrt {nh}}$. This result is obtainedby carefully employing techniques of Malliavin Calculus.

Common cleaning products can be dangerous when mixed, 2008

Common household cleaning products can cause injury when mixed. Some combinations produce harmful fumes and other dangerous by-products.

Cost efficiency in primary care contracting: A stochastic frontier cost function approach

The principal aim of this paper is to estimate a stochastic frontier costfunction and an inefficiency effects model in the analysis of the primaryhealth care services purchased by the public authority and supplied by 180providers in 1996 in Catalonia. The evidence from our sample does not supportthe premise that contracting out has helped improve purchasing costefficiency in primary care. Inefficient purchasing cost was observed in thecomponent of this purchasing cost explicitly included in the contract betweenpurchaser and provider. There are no observable incentives for thecontracted-out primary health care teams to minimise prescription costs, whichare not explicitly included in the present contracting system.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Inventory-routing model, for a multi-period problem with stochastic and deterministic demand

The need for integration in the supply chain management leads us to considerthe coordination of two logistic planning functions: transportation andinventory. The coordination of these activities can be an extremely importantsource of competitive advantage in the supply chain management. The battle forcost reduction can pass through the equilibrium of transportation versusinventory managing costs. In this work, we study the specific case of aninventory-routing problem for a week planning period with different types ofdemand. A heuristic methodology, based on the Iterated Local Search, isproposed to solve the Multi-Period Inventory Routing Problem with stochasticand deterministic demand.

A Hull and White formula for a general stochastic volatility jump-diffusion model with applications to the study of the short-time behavior of the implied volatility

In this paper, generalizing results in Alòs, León and Vives (2007b), we see that the dependence of jumps in the volatility under a jump-diffusion stochastic volatility model, has no effect on the short-time behaviour of the at-the-money implied volatility skew, although the corresponding Hull and White formula depends on the jumps. Towards this end, we use Malliavin calculus techniques for Lévy processes based on Løkka (2004), Petrou (2006), and Solé, Utzet and Vives (2007).

On p-beauty contest integer games

In this paper we provide a full characterization of the pure-strategyNash Equilibria for the p-Beauty Contest Game when we restrict player schoices to integer numbers. Opposed to the case of real number choices,equilibrium uniqueness may be lost depending on the value of p and thenumber of players: in particular, as p approaches 1 any symmetric profileconstitutes a Nash Equilibrium. We also show that any experimental p-BeautyContest Game can be associated to a game with the integer restriction andthus multiplicity of equilibria becomes an issue. Finally, we show thatin these games the iterated deletion of weakly dominated strategies maynot lead to a single outcome while the iterated best-reply process alwaysdoes (though the outcome obtained depends on the initial conditions).

Mixed equilibrium in a Downsian model with a favored candidate

This paper examines competition in the standard one-dimensional Downsian model of two-candidate elections, but where one candidate (A) enjoys an advantage over the other candidate (D). Voters' preferences are Euclidean, but any voter will vote for candidate A over candidate D unless D is closer to her ideal point by some fixed distance \delta. The location of the median voter's ideal point is uncertain, and its distribution is commonly known by both candidates. The candidates simultaneously choose locations to maximize the probability of victory. Pure strategy equilibria often fails to exist in this model, except under special conditions about \delta and the distribution of the median ideal point. We solve for the essentially unique symmetric mixed equilibrium, show that candidate A adopts more moderate policies than candidate D, and obtain some comparative statics results about the probability of victory and the expected distance between the two candidates' policies.

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

On the short-time behavior of the implied volatility for jump-diffusion models with stochastic volatility

In this paper we use Malliavin calculus techniques to obtain an expression for the short-time behavior of the at-the-money implied volatility skew for a generalization of the Bates model, where the volatility does not need to be neither a difussion, nor a Markov process as the examples in section 7 show. This expression depends on the derivative of the volatility in the sense of Malliavin calculus.

Stochastic evolution of rules for playing normal form games

The evolution of boundedly rational rules for playing normal form games is studied within stationary environments ofstochastically changing games. Rules are viewed as algorithms prescribing strategies for the different normal formgames that arise. It is shown that many of the folk results of evolutionary game theory typically obtained witha fixed game and fixed strategies carry over to the present case. The results are also related to recent experimentson rules and games.

Infestation and natural parasitism of aphids in single and mixed pastures of black oats and ryegrass

Some species of aphids are major pests on cereal crops and grass pastures. Usually these pests are not adequately controlled in pasture lands that become sources of aphid infestations to cereal crops. The dynamics of aphids and the incidence of natural enemies are less known in pasture systems than in cereal fields. The objective of this work was to assess the aphid infestation and natural aphid parasitism in different pasture composition. Three hypotheses were tested: 1- the aphid species composition in pastures may vary according to the cereal species in the field; 2- the mixture of two plant species can modify the amount and diversity of aphids; 3- the plant species composition of pasture fields influences the parasitism of aphids. Empirical data were obtained from three Poaceae fields: black oats (Avena strigosa L.), ryegrass (Lolium multiflorum L.), and a mixed field of black oats and ryegrass. The most abundant aphid species was Rhopalosiphum padi followed by Sitobion avenae. Plant species composition increases the amount and the parasitism rates of aphids. The mixture of heavily infested black oats with a poorly infested ryegrass resulted in reduction of aphid infestation in comparison with heavily-infested single plant species field. This is possible because the conditions are favorable for the development of parasitoid populations. Aphidius colemani was the main parasitoid found in these areas.

Transformation of a microprolactinoma into a mixed growth hormone and prolactin-secreting pituitary adenoma.

Combined prolactin (PRL) and growth hormone (GH) secretion by a single pituitary tumor can occur in approximately 5% of cases. However, in all previously reported patients, combined secretion of both hormones was present at the time of diagnosis. Here we describe a patient initially diagnosed with a pure prolactin-secreting microadenoma, who experienced the progressive apparition of symptomatic autonomous GH secretion while on intermittent long term dopamine agonist therapy. She was operated on, and immunohistochemical analysis of tumor tissue confirmed the diagnosis of pituitary adenoma with uniform co-staining of all cells for both GH and PRL. This patient represents the first documented occurrence of asynchronous development of combined GH and PRL secretion in a pituitary adenoma. Although pathogenic mechanisms implicated remain largely speculative, it emphasizes the need for long term hormonal follow up of patients harboring prolactinomas.

One-sided tolerance interval in a two-way balanced nested model with mixed effects

In many research areas (such as public health, environmental contamination, and others) one deals with the necessity of using data to infer whether some proportion (%) of a population of interest is (or one wants it to be) below and/or over some threshold, through the computation of tolerance interval. The idea is, once a threshold is given, one computes the tolerance interval or limit (which might be one or two - sided bounded) and then to check if it satisfies the given threshold. Since in this work we deal with the computation of one - sided tolerance interval, for the two-sided case we recomend, for instance, Krishnamoorthy and Mathew [5]. Krishnamoorthy and Mathew [4] performed the computation of upper tolerance limit in balanced and unbalanced one-way random effects models, whereas Fonseca et al [3] performed it based in a similar ideas but in a tow-way nested mixed or random effects model. In case of random effects model, Fonseca et al [3] performed the computation of such interval only for the balanced data, whereas in the mixed effects case they dit it only for the unbalanced data. For the computation of twosided tolerance interval in models with mixed and/or random effects we recomend, for instance, Sharma and Mathew [7]. The purpose of this paper is the computation of upper and lower tolerance interval in a two-way nested mixed effects models in balanced data. For the case of unbalanced data, as mentioned above, Fonseca et al [3] have already computed upper tolerance interval. Hence, using the notions persented in Fonseca et al [3] and Krishnamoorthy and Mathew [4], we present some results on the construction of one-sided tolerance interval for the balanced case. Thus, in order to do so at first instance we perform the construction for the upper case, and then the construction for the lower case.

[Archives de la Parole]. , Parable of the prodigal son : in mixed Baghelkhandi (C.P.) [i.e. Central Provinces], from Murwara / [Sir George Grierson], éd. ; Linguistic survey of India ; [Rai Bahadur Hiralal], voix

[Traditions. Asie. Inde. Madhya Pradesh. Baghelkhand]