13,537 research outputs found

    Some numerical methods for solving stochastic impulse control in natural gas storage facilities

    Get PDF
    The valuation of gas storage facilities is characterized as a stochastic impulse control problem with finite horizon resulting in Hamilton-Jacobi-Bellman (HJB) equations for the value function. In this context the two catagories of solving schemes for optimal switching are discussed in a stochastic control framework. We reviewed some numerical methods which include approaches related to partial differential equations (PDEs), Markov chain approximation, nonparametric regression, quantization method and some practitioners’ methods. This paper considers optimal switching problem arising in valuation of gas storage contracts for leasing the storage facilities, and investigates the recent developments as well as their advantages and disadvantages of each scheme based on dynamic programming principle (DPP

    Free Energy and the Generalized Optimality Equations for Sequential Decision Making

    Full text link
    The free energy functional has recently been proposed as a variational principle for bounded rational decision-making, since it instantiates a natural trade-off between utility gains and information processing costs that can be axiomatically derived. Here we apply the free energy principle to general decision trees that include both adversarial and stochastic environments. We derive generalized sequential optimality equations that not only include the Bellman optimality equations as a limit case, but also lead to well-known decision-rules such as Expectimax, Minimax and Expectiminimax. We show how these decision-rules can be derived from a single free energy principle that assigns a resource parameter to each node in the decision tree. These resource parameters express a concrete computational cost that can be measured as the amount of samples that are needed from the distribution that belongs to each node. The free energy principle therefore provides the normative basis for generalized optimality equations that account for both adversarial and stochastic environments.Comment: 10 pages, 2 figure

    The mixmaster universe: A chaotic Farey tale

    Full text link
    When gravitational fields are at their strongest, the evolution of spacetime is thought to be highly erratic. Over the past decade debate has raged over whether this evolution can be classified as chaotic. The debate has centered on the homogeneous but anisotropic mixmaster universe. A definite resolution has been lacking as the techniques used to study the mixmaster dynamics yield observer dependent answers. Here we resolve the conflict by using observer independent, fractal methods. We prove the mixmaster universe is chaotic by exposing the fractal strange repellor that characterizes the dynamics. The repellor is laid bare in both the 6-dimensional minisuperspace of the full Einstein equations, and in a 2-dimensional discretisation of the dynamics. The chaos is encoded in a special set of numbers that form the irrational Farey tree. We quantify the chaos by calculating the strange repellor's Lyapunov dimension, topological entropy and multifractal dimensions. As all of these quantities are coordinate, or gauge independent, there is no longer any ambiguity--the mixmaster universe is indeed chaotic.Comment: 45 pages, RevTeX, 19 Figures included, submitted to PR

    Fast Isogeometric Boundary Element Method based on Independent Field Approximation

    Full text link
    An isogeometric boundary element method for problems in elasticity is presented, which is based on an independent approximation for the geometry, traction and displacement field. This enables a flexible choice of refinement strategies, permits an efficient evaluation of geometry related information, a mixed collocation scheme which deals with discontinuous tractions along non-smooth boundaries and a significant reduction of the right hand side of the system of equations for common boundary conditions. All these benefits are achieved without any loss of accuracy compared to conventional isogeometric formulations. The system matrices are approximated by means of hierarchical matrices to reduce the computational complexity for large scale analysis. For the required geometrical bisection of the domain, a strategy for the evaluation of bounding boxes containing the supports of NURBS basis functions is presented. The versatility and accuracy of the proposed methodology is demonstrated by convergence studies showing optimal rates and real world examples in two and three dimensions.Comment: 32 pages, 27 figure

    The Dynamic Behavior of Efficient Timber Prices

    Get PDF
    The problem of when to optimally harvest trees when timber prices evolve according to an exogenous stochastic process has been studied extensively in recent decades. However, little attention has been given to the appropriate form of the stochastic process for timber prices, despite the fact that the choice of a process has important effects on optimal harvesting decisions. We develop a simple theoretical model of a timber market and show that there exists a rational expectations equilibrium in which prices evolve according to a stationary ARMA(1,1) process. Simulations are used to analyze a model with a more general representation of timber stock dynamics and to demonstrate that the unconditional distribution for rational timber prices is asymmetric. Implications for the optimal harvesting literature are: 1) market efficiency provides little justification for random walk prices, 2) unit root tests, used to analyze the informational efficiency of timber markets, do not distinguish between efficient and inefficient markets, and 3) failure to recognize asymmetric disturbances in time-series analyses of historical timber prices can lead to sub-optimal harvesting rules.

    The Evolution of Coordination under Inertia

    Get PDF
    This paper models the phenomenon of inertia driven by individual strategy switching costs in a stochastic evolutionary context. Kandori, Mailath, and Rob's (1993) model of a finite population of agents repeatedly playing a 2x2 symmetric coordination game is extended to allow for such inertia. Taking noise to the limit, a number of new short- to medium-run equilibria emerge, centred around the mixed-strategy equilibrium. Thus, unusually, an evolutionary model is seen to provide some justification for the controversial concept of mixed-strategy equilibrium. However, Kandori, Mailath, and Rob's long-run selection of the risk-dominant equilibrium continues to hold, both under fixed-rate mutations and under state-dependent mutations driven by stochastic switching costs. The key to this is the satisfaction of Blume's (1999) "skew-symmetry" of the noise process, which is shown to be crucial even under simultaneous strategy revisions. In fact, the presence of the new short-run equilibria can under certain conditions serve to reduce the expected waiting time before the risk-dominant equilibrium is reached - an instance of Ellison's (2000) idea that evolution is more rapid when it can proceed via a series of small "steps" between extremes. This suggests inertia to be a surprisingly efficient phenomenon, and also serves to moderate the force of the Ellison (1993) critique of excessively long transition times in models with vanishing noise.
    corecore