(No)competition in the Spanish retailing gasoline market: a variance filter approach

Various methodologies in economic literature have been used to analyse the international hydrocarbon retail sector. Nevertheless at a Spanish level these studies are much more recent and most conclude that generally there is no effective competition present in this market, regardless of the approach used. In this paper, in order to analyse the price levels in the Spanish petrol market, our starting hypothesis is that in uncompetitive markets the prices are higher and the standard deviation is lower. We use weekly retail petrol price data from the ten biggest Spanish cities, and apply Markov chains to fill the missing values for petrol 95 and diesel, and we also employ a variance filter. We conclude that this market demonstrates reduced price dispersion, regardless of brand or city.

Forecasting and turning point predictions in a Bayesian panel VAR model

We provide methods for forecasting variables and predicting turning points in panel Bayesian VARs. We specify a flexible model which accounts for both interdependencies in the cross section and time variations in the parameters. Posterior distributions for the parameters are obtained for a particular type of diffuse, for Minnesota-type and for hierarchical priors. Formulas for multistep, multiunit point and average forecasts are provided. An application to the problem of forecasting the growth rate of output and of predicting turning points in the G-7 illustrates the approach. A comparison with alternative forecasting methods is also provided.

El desarrollo humano: perfiles y perspectivas futuras

El PNUD calcula todos los años el Índice de Desarrollo Humano (IDH). El objetivo de este trabajo es analizar los antecedentes y las perspectivas futuras del desarrollo humano a partir de los datos de este índice durante el periodo 1970-2000. Esto es, comprobar, a partir de los datos pasados, si las diferencias entre el IDH de los países del mundo están aumentando y valorar la tendencia del IDH esperada para los próximos años. En definitiva, se trata de buscar respuesta a la siguiente pregunta ¿cómo se modificarán los niveles de desarrollo humano en el futuro? Para ello, se utiliza la metodología estadística del análisis dinámico de distribución mediante las cadenas de Markov.

The Analysis of interval censoring and double censoring via Markov chain Monte Carlo methods

L'Anàlisi de la supervivència s'utilitza en diferents camps per analitzar el temps transcorregut entre dos esdeveniments. El que distingeix l'anàlisi de la supervivència d'altres àrees de l'estadística és que les dades normalment estan censurades. La censura en un interval apareix quan l'esdeveniment final d'interès no és directament observable i només se sap que el temps de fallada està en un interval concret. Un esquema de censura més complex encara apareix quan tant el temps inicial com el temps final estan censurats en un interval. Aquesta situació s'anomena doble censura. En aquest article donem una descripció formal d'un mètode bayesà paramètric per a l'anàlisi de dades censurades en un interval i dades doblement censurades així com unes indicacions clares de la seva utilització o pràctica. La metodologia proposada s'ilustra amb dades d'una cohort de pacients hemofílics que es varen infectar amb el virus VIH a principis dels anys 1980's.

Pork Value Chains: A Comparison of Catalonia, Spain and Manitoba, Canada

The purpose of this paper is to provide a comparative analysis of pork value chains in Catalonia, Spain and Manitoba, Canada. Intensive hog production models were implemented in Catalonia in the 1960s as a result of agriculture crises and fostered by feedstuffs factories. The expansion of the hog sector in Manitoba is more recent (in the 1990s) and brought about in large part by the opening of the Maple Leaf Meats processing plant in Brandon, Manitoba. This plant is capable of processing 90,000 hogs per week. Both hog production models ‐ the ‘older’ one in Catalonia (Spain) and the ‘newer’ in Manitoba‐ have been, until recently, examples of success. Inventories and production have been increasing substantially and both regions have proven to have great export potential. Recently, however, tensions have been developing with the hog production models of both regions, particularly as they relate to environmental concerns. The purpose of the paper is to compare the value chains with respect to their origins (e.g. supply a growing demand for pork, ensure farm profitability) and present states (e.g. environmental concerns, profitability). Keywords: pork value chain, hog farms, agri‐food studies. JEL: Q10, Q13, O57

Discrete time Non-homogeneous Semi-Markov Processes applied to Models for Disability Insurance

In this paper, we present a stochastic model for disability insurance contracts. The model is based on a discrete time non-homogeneous semi-Markov process (DTNHSMP) to which the backward recurrence time process is introduced. This permits a more exhaustive study of disability evolution and a more efficient approach to the duration problem. The use of semi-Markov reward processes facilitates the possibility of deriving equations of the prospective and retrospective mathematical reserves. The model is applied to a sample of contracts drawn at random from a mutual insurance company.

Markov chain montecarlo method applied to rounding zeros of compositional data: first approach

As stated in Aitchison (1986), a proper study of relative variation in a compositional data set should be based on logratios, and dealing with logratios excludes dealing with zeros. Nevertheless, it is clear that zero observations might be present in real data sets, either because the corresponding part is completelyabsent –essential zeros– or because it is below detection limit –rounded zeros. Because the second kind of zeros is usually understood as “a trace too small to measure”, it seems reasonable to replace them by a suitable small value, and this has been the traditional approach. As stated, e.g. by Tauber (1999) and byMartín-Fernández, Barceló-Vidal, and Pawlowsky-Glahn (2000), the principal problem in compositional data analysis is related to rounded zeros. One should be careful to use a replacement strategy that does not seriously distort the general structure of the data. In particular, the covariance structure of the involvedparts –and thus the metric properties– should be preserved, as otherwise further analysis on subpopulations could be misleading. Following this point of view, a non-parametric imputation method isintroduced in Martín-Fernández, Barceló-Vidal, and Pawlowsky-Glahn (2000). This method is analyzed in depth by Martín-Fernández, Barceló-Vidal, and Pawlowsky-Glahn (2003) where it is shown that thetheoretical drawbacks of the additive zero replacement method proposed in Aitchison (1986) can be overcome using a new multiplicative approach on the non-zero parts of a composition. The new approachhas reasonable properties from a compositional point of view. In particular, it is “natural” in the sense thatit recovers the “true” composition if replacement values are identical to the missing values, and it is coherent with the basic operations on the simplex. This coherence implies that the covariance structure of subcompositions with no zeros is preserved. As a generalization of the multiplicative replacement, in thesame paper a substitution method for missing values on compositional data sets is introduced

On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Input chains and industrialization

A key aspect of industrialization is theadoption of increasing-returns-to-scale, industrial,technologies. Two other, well-documented aspects arethat industrial technologies are adopted throughoutintermediate-input chains and that they use intermediateinputs intensively relative to the technologies theyreplace. These features of industrial technologiescombined imply that countries with access to similartechnologies may have very different levels ofindustrialization and income, even if the degree ofincreasing returns to scale at the firm level is relativelysmall. Furthermore, a small improvement in theproductivity of industrial technologies can trigger full-scaleindustrialization and a large increase in income.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Restless bandits, partial conservation laws and indexability

We show that if performance measures in a stochastic scheduling problem satisfy a set of so-called partial conservation laws (PCL), which extend previously studied generalized conservation laws (GCL), then the problem is solved optimally by a priority-index policy for an appropriate range of linear performance objectives, where the optimal indices are computed by a one-pass adaptive-greedy algorithm, based on Klimov's. We further apply this framework to investigate the indexability property of restless bandits introduced by Whittle, obtaining the following results: (1) we identify a class of restless bandits (PCL-indexable) which are indexable; membership in this class is tested through a single run of the adaptive-greedy algorithm, which also computes the Whittle indices when the test is positive; this provides a tractable sufficient condition for indexability; (2) we further indentify the class of GCL-indexable bandits, which includes classical bandits, having the property that they are indexable under any linear reward objective. The analysis is based on the so-called achievable region method, as the results follow fromnew linear programming formulations for the problems investigated.

Dynamical properties of discrete breathers in curved chains with first and second neighbor interaction

We present the study of discrete breather dynamics in curved polymerlike chains consisting of masses connected via nonlinear springs. The polymer chains are one dimensional but not rectilinear and their motion takes place on a plane. After constructing breathers following numerically accurate procedures, we launch them in the chains and investigate properties of their propagation dynamics. We find that breather motion is strongly affected by the presence of curved regions of polymers, while the breathers themselves show a very strong resilience and remarkable stability in the presence of geometrical changes. For chains with strong angular rigidity we find that breathers either pass through bent regions or get reflected while retaining their frequency. Their motion is practically lossless and seems to be determined through local energy conservation. For less rigid chains modeled via second neighbor interactions, we find similarly that chain geometry typically does not destroy the localized breather states but, contrary to the angularly rigid chains, it induces some small but constant energy loss. Furthermore, we find that a curved segment acts as an active gate reflecting or refracting the incident breather and transforming its velocity to a value that depends on the discrete breathers frequency. We analyze the physical reasoning behind these seemingly general breather properties.

Confinement of discrete breathers in inhomogeneously profiled nonlinear chains

We investigate numerically the scattering of a moving discrete breather on a pair of junctions in a Fermi-Pasta-Ulam chain. These junctions delimit an extended region with different masses of the particles. We consider (i) a rectangular trap, (ii) a wedge shaped trap, and (iii) a smoothly varying convex or concave mass profile. All three cases lead to DB confinement, with the ease of trapping depending on the profile of the trap. We also study the collision and trapping of two DBs within the profile as a function of trap width, shape, and approach time at the two junctions. The latter controls whether one or both DBs are trapped.