Solving,Estimating, and Selecting Nonlinear Dynamic Models Without the Curse of Dimensionality

We present a comprehensive framework for Bayesian estimation of structural nonlinear dynamic economic models on sparse grids to overcome the curse of dimensionality for approximations. We apply sparse grids to a global polynomial approximation of the model solution, to the quadrature of integrals arising as rational expectations, and to three new nonlinear state space filters which speed up the sequential importance resampling particle filter. The posterior of the structural parameters is estimated by a new Metropolis–Hastings algorithm with mixing parallel sequences. The parallel extension improves the global maximization property of the algorithm, simplifies the parameterization for an appropriate acceptance ratio, and allows a simple implementation of the estimation on parallel computers. Finally, we provide all algorithms in the open source software JBendge for the solution and estimation of a general class of models.     

Using Adaptive Sparse Grids to Solve High‐Dimensional Dynamic Models

We present a flexible and scalable method for computing global solutions of high‐dimensional stochastic dynamic models. Within a time iteration or value function iteration setup, we interpolate functions using an adaptive sparse grid algorithm. With increasing dimensions, sparse grids grow much more slowly than standard tensor product grids. Moreover, adaptivity adds a second layer of sparsity, as grid points are added only where they are most needed, for instance, in regions with steep gradients or at nondifferentiabilities. To further speed up the solution process, our implementation is fully hybrid parallel, combining distributed and shared memory parallelization paradigms, and thus permits an efficient use of high‐performance computing architectures. To demonstrate the broad applicability of our method, we solve two very different types of dynamic models: first, high‐dimensional international real business cycle models with capital adjustment costs and irreversible investment; second, multiproduct menu‐cost models with temporary sales and economies of scope in price setting.     

Optimal Dynamic Upgrading in Revenue Management

We consider a revenue management problem involving a two compartment aircraft flying a single leg, with no cancellations or over‐booking. We apply the practice of transforming a choice revenue management model into an independent demand model. Within this assumed independent model, there are two sets of demands, business and economy, each with multiple fare class products. A business passenger can only be accepted into business. An economy passenger can be accepted into economy or upgraded into business. We define a two‐dimensional dynamic program (DP) and show that the value function is sub‐modular and concave in seat availability in the two compartments. Thus the bid prices are non‐decreasing with respect to these state variables. We use this result to propose an exact algorithm to solve the DP. Our numerical investigation suggests that in contrast to standard backward induction, our method could be included in production revenue management systems. Further, when the economy compartment is capacity constrained, we observe a substantial monetary benefit from optimal dynamic upgrading compared to the static upgrading procedures currently used in practice.     

Swapping the Nested Fixed Point Algorithm: A Class of Estimators for Discrete Markov Decision Models

This paper proposes a new nested algorithm (NPL) for the estimation of a class of discrete Markov decision models and studies its statistical and computational properties. Our method is based on a representation of the solution of the dynamic programming problem in the space of conditional choice probabilities. When the NPL algorithm is initialized with consistent nonparametric estimates of conditional choice probabilities, successive iterations return a sequence of estimators of the structural parameters which we call K–stage policy iteration estimators. We show that the sequence includes as extreme cases a Hotz–Miller estimator (for K=1) and Rust's nested fixed point estimator (in the limit when K→∞). Furthermore, the asymptotic distribution of all the estimators in the sequence is the same and equal to that of the maximum likelihood estimator. We illustrate the performance of our method with several examples based on Rust's bus replacement model. Monte Carlo experiments reveal a trade–off between finite sample precision and computational cost in the sequence of policy iteration estimators.     

Obtaining Informationally Consistent Decisions When Computing Costs with Limited Information

We demonstrate the need to view in a dynamic context any decision based on limited information. We focus on the use of product costs in selecting the product portfolio. We show how ex post data regarding the actual costs from implementing the decision leads to updating of product cost estimates and potentially trigger a revision of the initial decision. We model this updating process as a discrete dynamical system (DDS). We define a decision as informationally consistent if it is a fixed‐point solution to the DDS. We employ numerical analysis to characterize the existence and properties of such solutions. We find that fixed points are rare, but that simple heuristics find them often and quickly. We demonstrate the usefulness and robustness of our methodology by examining the interaction of limited information with multiple decision rules (heuristics) and problem features (size of product portfolio, profitability of product markets). We discuss implications for research on cost systems.     

一类稀疏投资组合双层参数估计模型及其应用

带基约束的投资组合问题是近年来投资组合领域的热点问题,但是参数不确定性直接影响了模型的效果。带基约束的投资组合问题所涉及的参数不仅包括以往研究认为非常重要的预期收益率,还包括控制投资组合规模的稀疏度,尤其是最优稀疏度估计方面的专门研究还十分匮乏。为了使带基约束的投资组合模型更好地为投资决策服务,本文从投资者效用出发,用双层规划的思想构建了带基约束的投资组合双层参数估计模型。然后根据模型的特点,设计了无导数优化算法框架,并基于ADMM对算法子问题进行求解。本文实验针对真实的市场数据给出了预期收益率和最优稀疏度的估计,接着通过与等权重策略和含上下界约束的均值-方差模型进行比较,说明了模型及算法的有效性和实用性。最后,将本文提出的双层参数估计模型推广到了更一般的形式。     

Constrained Optimization Approaches to Estimation of Structural Models

Estimating structural models is often viewed as computationally difficult, an impression partly due to a focus on the nested fixed‐point (NFXP) approach. We propose a new constrained optimization approach for structural estimation. We show that our approach and the NFXP algorithm solve the same estimation problem, and yield the same estimates. Computationally, our approach can have speed advantages because we do not repeatedly solve the structural equation at each guess of structural parameters. Monte Carlo experiments on the canonical Zurcher bus‐repair model demonstrate that the constrained optimization approach can be significantly faster.     

随机多阶段分销网络设计模型

为了更合理的设计分销网络,本文提出了一种随机多阶段的联合选址-库存模型。在该模型中,不仅考虑了经济规模和分摊效益的影响。同时通过情景规划,考虑了在多阶段的分销网络设计中,对未来市场环境的不确定性。该模型的目标是使整个战略周期内的总期望成本(包括库存、运输、选址成本与损失的收益)最小。本文将该模型建立成为了一个非线性的整数规划模型,同时提出了一种基于拉格朗日松弛的求解算法。最后,本文使用该算法求解了三组不同规模的算例,得到的计算结果证明了拉格朗日算法是求解该模型的有效算法。     

Efficient Semiparametric Estimation of the Fama–French Model and Extensions

This paper develops a new estimation procedure for characteristic‐based factor models of stock returns. We treat the factor model as a weighted additive nonparametric regression model, with the factor returns serving as time‐varying weights and a set of univariate nonparametric functions relating security characteristic to the associated factor betas. We use a time‐series and cross‐sectional pooled weighted additive nonparametric regression methodology to simultaneously estimate the factor returns and characteristic‐beta functions. By avoiding the curse of dimensionality, our methodology allows for a larger number of factors than existing semiparametric methods. We apply the technique to the three‐factor Fama–French model, Carhart's four‐factor extension of it that adds a momentum factor, and a five‐factor extension that adds an own‐volatility factor. We find that momentum and own‐volatility factors are at least as important, if not more important, than size and value in explaining equity return comovements. We test the multifactor beta pricing theory against a general alternative using a new nonparametric test.     

Inference in Dynamic Discrete Choice Models With Serially orrelated Unobserved State Variables

This paper develops a method for inference in dynamic discrete choice models with serially correlated unobserved state variables. Estimation of these models involves computing high‐dimensional integrals that are present in the solution to the dynamic program and in the likelihood function. First, the paper proposes a Bayesian Markov chain Monte Carlo estimation procedure that can handle the problem of multidimensional integration in the likelihood function. Second, the paper presents an efficient algorithm for solving the dynamic program suitable for use in conjunction with the proposed estimation procedure.     

Locations and vehicle routing designs of physical distribution systems

The design of a physical distribution system (PDS) involves the determination of the number and locations of distribution centres, estimation of required vehicle numbers and design of vehicle routings. Due to the enormous numbers of possible combinatorial designs of the system, it is difficult to obtain an optimal design in acceptable computation effort on many occasions. In this paper, a new solution framework for the design of PDS by implementing the genetic algorithm (GA) is presented. With the characteristic of simultaneous optimization of a large population of configuration, the proposed methodology has been proved to be an extremely efficient optimizer. In the experimental simulation conducted in this paper, it also indicates this approach can provide a near-optimal solution to the design of PDS. To analyse the growth and decay of many schemas contained in the population, the effects of the operation of reproduction, crossover and mutation on the schema are studied. The simulation evaluation about the system performance and genetic parameters is presented along with the discussions at the end of this paper.     

需求替代的两产品动态批量最优预测时阈研究

研究了存在需求单向替代的两产品动态批量决策的最优预测时阈问题.构建了包含替代成本、生产转换成本和库存成本在内的成本最小化模型,分析得出在只存在3类再生点(Ⅰ类、Ⅱ类和Ⅲ类)情形下的再生点单调性特征.同时,设计出了多项式时间的前向动态规划算法.运用数值试验分析了最优预测时阈与生产转换成本、替代成本、需求特征(需求增长性和...     

Bound and exact methods for assessing link vulnerability in complex networks

Assessing network systems for failures is critical to mitigate the risk and develop proactive responses. In this paper, we investigate devastating consequences of link failures in networks. We propose an exact algorithm and a spectral lower-bound on the minimum number of removed links to incur a significant level of disruption. Our exact solution can identify optimal solutions in both uniform and weighted networks through solving a well-constructed mixed integer program. Also, our spectral lower-bound derives from the Laplacian eigenvalues an estimation on the vulnerability of large networks that are intractable for exact methods. Through experiments on both synthetic and real-world networks, we demonstrate the efficiency of the proposed methods.     

Multi-time scale Markov decision process approach to strategic network growth of reverse supply chains

This paper addresses a complex set of decisions that surround the growth over time of reverse supply chain networks that collect used products for reuse, refurbishment, and/or recycling by processors. The collection network growth problem is decomposed into strategic, tactical and operational problems. This paper focuses on the strategic problem which is to determine how to allocate capital budget resource effectively to grow the network to meet long term collection targets and collection cost constraints. We model the strategic problem as a Markov decision process which can also be posed as multi-time scale Markov decision problem. The recruitment problem in a tactical level appears as a sub-problem for the strategic model. Using dynamic programming, linear programming and Q-Learning approaches, an heuristic is implemented to solve realistically sized problems. A numerical study demonstrates that the heuristic can obtain a good solution for the large-scale problem in reasonable time which is not possible when trying to obtain the optimal solution with the exact DP approach.     

现实约束下多阶段模糊投资组合的时间一致性策略研究

考虑交易成本约束、借款约束、阈值约束、收益需求约束和基数约束,本文提出多阶段均值—标准下半方差模糊投资组合模型并讨论了该模型的时间一致性最优投资策略。具体如下：首先,基于可能性理论,将模型转化为非线性动态优化问题;由于标准半方差是不可离散的,模型的最优解不具有时间一致性。其次,为获得时间一致的最优投资策略,本文采用博弈论,将该模型转化为时间一致性动态优化问题,并运用离散近似迭代方法求解。最后,通过具体算例比较不同风险偏好系数、不同基数约束和不同借款约束的最优投资策略,以验证模型和算法的有效性。     

Estimating and Testing Structural Changes in Multivariate Regressions

This paper considers issues related to estimation, inference, and computation with multiple structural changes that occur at unknown dates in a system of equations. Changes can occur in the regression coefficients and/or the covariance matrix of the errors. We also allow arbitrary restrictions on these parameters, which permits the analysis of partial structural change models, common breaks that occur in all equations, breaks that occur in a subset of equations, and so forth. The method of estimation is quasi‐maximum likelihood based on Normal errors. The limiting distributions are obtained under more general assumptions than previous studies. For testing, we propose likelihood ratio type statistics to test the null hypothesis of no structural change and to select the number of changes. Structural change tests with restrictions on the parameters can be constructed to achieve higher power when prior information is present. For computation, an algorithm for an efficient procedure is proposed to construct the estimates and test statistics. We also introduce a novel locally ordered breaks model, which allows the breaks in different equations to be related yet not occurring at the same dates.     

The two-level lot-sizing problem with outbound shipment

We consider the two-level lot-sizing problem for the integrated replenishment and dispatch plan of a third-party logistics company and distribution center. Each outbound shipment for a dispatch involves cargos that incur a stepwise transportation cost. To increase the effect of shipment consolidation, the distribution center allows backlogging. This problem has the characteristics of capacitated and uncapacitated lot-sizing. A forward dynamic program is applied to exploit the beneficial characteristic of the uncapacitated problem. The forward dynamic program is implemented using Zangwill partitions to decrease the number of computational parameters with legitimacy checks to guarantee optimality. Employing these techniques, we provide an O(T⁴) algorithm, which serves as an improvement on the O(T⁶) algorithm of previous research. Moreover, computational results from actual implementations show that our algorithm is significantly faster than that of prior research.     

有可再生能源和电力存储设施并网的智能电网优化用电策略

大量可再生能源和存储设施集中或分布接入电网,缓解了电网的供给压力,但同时也对电力系统安全造成新的威胁。合理使用新能源和可存储设施使之更好为电网服务,是现代电网亟待解决的一个问题。本文对有可存储设备和可再生能源并网的电力系统进行研究,根据可再生能源在实际生活中的情形,将其划分为两类：私人新能源发电和公共新能源发电,其中私人新能源发电可供自身直接使用,多余部分并入电网,而公共新能源发电直接并入电网,然后针对上述复杂情形,结合用户实际需求,以所有用户效用最大化、成本最小化为目标函数,建立优化模型,给出了一种既有可存储设备又有可再生能源复杂并网情况下用户优化用电策略——包括家用电器、新能源、以及存储设备充放电策略。对模型的性质进行研究,考虑到模型是凸规划,强对偶成立,用拉格朗日对偶算法给出了模型的解。求解过程中,由于目标函数是非光滑的,采用光滑化的技术将目标函数光滑化,将非光滑问题转化为光滑问题,进一步利用拟牛顿下降法求解。该策略能确保新能源得到优先、充分利用,体现用户效用最大化、成本最小化,同时可以避免由于新能源并网可能会造成电网不稳定情况的出现;光滑化的方法不但适用于本文,经过适当改进后也可适用于其他目标函数为非光滑的情况。仿真结果验证了模型的合理性和算法的可行性。     

Estimating Dynamic Models of Imperfect Competition

We describe a two‐step algorithm for estimating dynamic games under the assumption that behavior is consistent with Markov perfect equilibrium. In the first step, the policy functions and the law of motion for the state variables are estimated. In the second step, the remaining structural parameters are estimated using the optimality conditions for equilibrium. The second step estimator is a simple simulated minimum distance estimator. The algorithm applies to a broad class of models, including industry competition models with both discrete and continuous controls such as the Ericson and Pakes (1995) model. We test the algorithm on a class of dynamic discrete choice models with normally distributed errors and a class of dynamic oligopoly models similar to that of Pakes and McGuire (1994).