A generalized multi-period mean-variance portfolio optimization with Markov switching parameters

In this paper, we deal with a generalized multi-period mean-variance portfolio selection problem with market parameters Subject to Markov random regime switchings. Problems of this kind have been recently considered in the literature for control over bankruptcy, for cases in which there are no jumps in market parameters (see [Zhu, S. S., Li, D., & Wang, S. Y. (2004). Risk control over bankruptcy in dynamic portfolio selection: A generalized mean variance formulation. IEEE Transactions on Automatic Control, 49, 447-457]). We present necessary and Sufficient conditions for obtaining an optimal control policy for this Markovian generalized multi-period meal-variance problem, based on a set of interconnected Riccati difference equations, and oil a set of other recursive equations. Some closed formulas are also derived for two special cases, extending some previous results in the literature. We apply the results to a numerical example with real data for Fisk control over bankruptcy Ill a dynamic portfolio selection problem with Markov jumps selection problem. (C) 2008 Elsevier Ltd. All rights reserved.

A numerical study of large sparse matrix exponentials arising in Markov chains

Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models. (C) 1999 Elsevier Science B.V. All rights reserved.AMS Classification: 65F99; 65L05; 65U05.

Quasistationarity of continuous-time Markov chains with positive drift

We shall study continuous-time Markov chains on the nonnegative integers which are both irreducible and transient, and which exhibit discernible stationarity before drift to infinity sets in. We will show how this 'quasi' stationary behaviour can be modelled using a limiting conditional distribution: specifically, the limiting state probabilities conditional on not having left 0 for the last time. By way of a dual chain, obtained by killing the original process on last exit from 0, we invoke the theory of quasistationarity for absorbing Markov chains. We prove that the conditioned state probabilities of the original chain are equal to the state probabilities of its dual conditioned on non-absorption, thus allowing us to establish the simultaneous existence and then equivalence, of their limiting conditional distributions. Although a limiting conditional distribution for the dual chain is always a quasistationary distribution in the usual sense, a similar statement is not possible for the original chain.

Further results on the relationship between mu-invariant measures and quasi-stationary distributions for absorbing continuous-time Markov chains

This note considers continuous-time Markov chains whose state space consists of an irreducible class, C, and an absorbing state which is accessible from C. The purpose is to provide results on mu-invariant and mu-subinvariant measures where absorption occurs with probability less than one. In particular, the well-known premise that the mu-invariant measure, m, for the transition rates be finite is replaced by the more natural premise that m be finite with respect to the absorption probabilities. The relationship between mu-invariant measures and quasi-stationary distributions is discussed. (C) 2000 Elsevier Science Ltd. All rights reserved.

New methods for determining quasi-stationary distributions for Markov chains

We shall be concerned with the problem of determining quasi-stationary distributions for Markovian models directly from their transition rates Q. We shall present simple conditions for a mu-invariant measure m for Q to be mu-invariant for the transition function, so that if m is finite, it can be normalized to produce a quasi-stationary distribution. (C) 2000 Elsevier Science Ltd. All rights reserved.

Neighborhood and Efficiency in Manufacturing in Brazilian Regions: A Spatial Markov Chain Analysis

This paper analyzes the geography of regional competitiveness in manufacturing in Brazil. The authors estimate stochastic frontiers to calculate regional efficiency of representative firms in 137 regions in the period 2000-2006, in four sectors defined by technological intensity. The efficiency results are analyzed using Markov Spatial Transition Matrices to provide insights into the transition of regions between efficiency levels, considering their local spatial context. The results indicate that geography plays an important role in manufacturing competitiveness. In particular, regions with more competitive neighbors are more likely to improve their relative efficiency (pull effect) over time, and regions with less competitive neighbors are more likely to lose relative efficiency (drag effect). The authors find that the pull effect is stronger than the drag effect.

Characterization of the rat exploratory behavior in the elevated plus-maze with Markov chains

The elevated plus-maze is an animal model of anxiety used to study the effect of different drugs on the behavior of the animal It consists of a plus-shaped maze with two open and two closed arms elevated 50 cm from the floor The standard measures used to characterize exploratory behavior in the elevated plus-maze are the time spent and the number of entries in the open arms In this work we use Markov chains to characterize the exploratory behavior of the rat in the elevated plus-maze under three different conditions normal and under the effects of anxiogenic and anxiolytic drugs The spatial structure of the elevated plus-maze is divided into squares which are associated with states of a Markov chain By counting the frequencies of transitions between states during 5-min sessions in the elevated plus-maze we constructed stochastic matrices for the three conditions studied The stochastic matrices show specific patterns which correspond to the observed behaviors of the rat under the three different conditions For the control group the stochastic matrix shows a clear preference for places in the closed arms This preference is enhanced for the anxiogenic group For the anxiolytic group the stochastic matrix shows a pattern similar to a random walk Our results suggest that Markov chains can be used together with the standard measures to characterize the rat behavior in the elevated plus-maze (C) 2010 Elsevier B V All rights reserved

Similar Markov chains

enin et al. (2000) recently introduced the idea of similarity in the context of birth-death processes. This paper examines the extent to which their results can be extended to arbitrary Markov chains. It is proved that, under a variety of conditions, similar chains are strongly similar in a sense which is described, and it is shown that minimal chains are strongly similar if and only if the corresponding transition-rate matrices are strongly similar. A general framework is given for constructing families of strongly similar chains; it permits the construction of all such chains in the irreducible case.

Path integrals for continuous-time Markov chains

This note presents a method of evaluating the distribution of a path integral for Markov chains on a countable state space.

Set-valued Markov chains and negative semitrajectories of discretized dynamical systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic behaviour of the semitrajectories follows probabilistic laws which correspond to a set-valued Markov chain, whose transition probabilities can be explicitly calculated. The results are illustrated for two-dimensional dynamical systems obtained by discretization of fractional linear transformations of the unit disc in the complex plane.

Integrals for continuous-time Markov chains

This paper presents a method of evaluating the expected value of a path integral for a general Markov chain on a countable state space. We illustrate the method with reference to several models, including birth-death processes and the birth, death and catastrophe process. (C) 2002 Elsevier Science Inc. All rights reserved.

Carreiras p??blicas em uma ordem democr??tica: entre os modelos burocr??tico e gerencial

Refletindo sobre modelo de carreira mais adequado para a Administra????o P??blica nesta era de economia globalizada e de maiores exig??ncias de efici??ncia e flexibilidade na gest??o dos aparatos governamentais, questiona-se aqui a id??ia de que o modelo burocr??tico deva ser substitu??do pelo modelo gerencial. Considerando essa id??ia apenas parcialmente verdadeira, nossa argumenta????o vai na seguinte dire????o: como a burocracia ?? a forma espec??fica de organiza????o do aparato administrativo do Estado de Direito, este modelo n??o pode ser rejeitado, sob pena de comprometimento desse Estado. Mas ele precisa ser flexibilizado, superando e reduzindo o formalismo excessivo e a rigidez que sua realiza????o hist??rica possa ter gerado nos diferentes pa??ses. Igualmente, deve ser aperfei??oado em seus mecanismos de controle, at?? como condi????o para sua manuten????o eficaz nos governos democr??ticos contempor??neos.

Burocracia, efici??ncia e modelos de gest??o p??blica: um ensaio

Este artigo apresenta diferentes vis??es sobre burocracia e efici??ncia, fazendo o contraponto com alguns modelos de gest??o p??blica, tais como o tradicional ou ortodoxo, o liberal e o chamado empreendedorismo estatal. Discute o relacionamento entre burocracia e efici??ncia, com um exemplo extra??do do gerencialismo brit??nico, orientador de reformas administrativas em diversos pa??ses. Elenca algumas quest??es recorrentes, que norteiam diversos modelos de gest??o p??blica em sua busca por efici??ncia e que t??m indiscut??vel import??ncia no ??mbito da administra????o p??blica.

Modelos de gest??o por compet??ncias na Europa

A no????o de gest??o por compet??ncias ?? muito propagada nos estudos sobre a gest??o dos recursos humanos. Certos pesquisadores evocam at?? uma transfer??ncia do modelo de organiza????o fundado na no????o de fun????o, para outro, baseado na no????o de compet??ncia (LAWLER, 1994). De um ponto de vista hist??rico, a id??ia de considerar-se a compet??ncia foi desenvolvida inicialmente ??? como a maior parte das inova????es nos recursos humanos ??? no setor privado, onde a gest??o por compet??ncias tinha por objetivo principal assegurar melhor competitividade no meio concorrencial. Do ponto de vista sem??ntico, as palavras competi????o e compet??ncia s??o similares. No setor p??blico, a concorr??ncia ?? menos expl??cita, mas n??o menos presente: ela acontece pelo recrutamento, pela reten????o de talentos, pelo acesso aos recursos, pelo fechamento de contratos no mercado ou, ainda, pela busca de resultados. ?? nesse contexto que se explica, em parte, a atra????o das institui????es p??blicas pela gest??o por compet??ncias.