Optimal investment–reinsurance with delay for mean–variance insurers: A maximum principle approach

This paper is concerned with an optimal investment and reinsurance problem with delay for an insurer under the mean–variance criterion. A three-stage procedure is employed to solve the insurer’s mean–variance problem. We first use the maximum principle approach to solve a benchmark problem. Then applying the Lagrangian duality method, we derive the optimal solutions for a variance-minimization problem. Based on these solutions, we finally obtain the efficient strategy and the efficient frontier of the insurer’s mean–variance problem. Some numerical examples are also provided to illustrate our results.     

A Dynamic Analysis of Schelling’s Binary Corruption Model: A Competitive Equilibrium Approach

Schelling (in Micromotives and Macrobehavior, Norton, New York, 1978) suggested a simple binary choice model to explain the variation of corruption levels across societies. His basic idea was that the expected profitability of engaging in corruption depends on its prevalence. The key result of the so-called Schelling diagram is the existence of multiple equilibria and a tipping point. The present paper puts Schelling’s essentially static approach into an intertemporal setting. We show how the existence of an unstable interior steady state leads to thresholds such that history alone or history in addition to expectations (or coordination) is necessary to determine the long-run outcome. In contrast to the related literature, which classifies these two cases according to whether the unstable equilibrium is a node or a focus, the actual differentiation is more subtle because even a node can lead to an overlap of solution paths such that the initial conditions alone are insufficient to uniquely determine the competitive equilibrium. Another insight is that a (transiently) cycling competitive equilibrium can dominate the direct and monotonic route to a steady state, even if the direct route is feasible.     

The impact of controllable production rates on the performance of inventory systems: A systematic review of the literature

The lot sizing problem has attracted the attention of researchers for more than a century, and it still belongs to the most relevant decision problems in many manufacturing companies. During the evolution of research on lot sizing, the seminal economic order quantity (EOQ) model proposed by Harris [1913. How many parts to make at once. Factory, the Magazine of Management, 10 (2), 135-136.] has remained the most popular model, despite its limitations. To support lot sizing decisions in practice, researchers have frequently extended Harris’ basic EOQ model to better reflect the characteristics of real production processes. One of these extensions is the consideration of controllable (variable) production rates, which gives production planners more flexibility in managing the build-up and depletion of inventory and in controlling costs.The aim of this paper is to provide a comprehensive and systematic overview of EPQ-type lot sizing models that consider controllable production rates. First, the paper proposes a conceptual framework that captures the characteristics of controllable production rates including the planning horizon (short vs. long term), the number of potential interventions per production run (one vs. multiple), the effect of controllable production rates on the performance of the inventory system (e.g., unit production costs, energy consumption, product quality), and the type of lot sizing model considered (e.g., two-stage models, multi-stage models, multi-item models). Secondly, the paper presents the results of a systematic literature review and evaluates the state-of-research of lot sizing models with controllable production rates. Based on the analysis of the literature, key trends are summarized and promising research opportunities are discussed.     

Cryptanalysis of a chaos-based cryptosystem on DSP

In this work, we cryptanalyse a recently chaos-based cryptosystem on DSP by proposing three different attacks to break it. We report the weakness of this cryptosystem and hence demonstrate that in its actual design, it cannot be used in the real world applications and it needs to be first enhanced by avoiding the design drawbacks reported in this work.     

Routing and wavelength assignment by partition colouring

The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, followed by the solution of a partition colouring problem in a conflict graph. A new tabu search heuristic is also proposed for the partition colouring problem, which may be viewed as an extension of the graph colouring problem. Computational experiments are reported, showing that the tabu search heuristic outperforms the best heuristic for partition colouring by approximately 20% in the average and illustrating that the new approach for the problem of routing and wavelength assignment is more robust than a well established heuristic for this problem.     

Greedy algorithm for the general multidimensional knapsack problem

In this paper, we propose a new greedy-like heuristic method, which is primarily intended for the general MDKP, but proves itself effective also for the 0-1 MDKP. Our heuristic differs from the existing greedy-like heuristics in two aspects. First, existing heuristics rely on each item’s aggregate consumption of resources to make item selection decisions, whereas our heuristic uses the effective capacity, defined as the maximum number of copies of an item that can be accepted if the entire knapsack were to be used for that item alone, as the criterion to make item selection decisions. Second, other methods increment the value of each decision variable only by one unit, whereas our heuristic adds decision variables to the solution in batches and consequently improves computational efficiency significantly for large-scale problems. We demonstrate that the new heuristic significantly improves computational efficiency of the existing methods and generates robust and near-optimal solutions. The new heuristic proves especially efficient for high dimensional knapsack problems with small-to-moderate numbers of decision variables, usually considered as “hard” MDKP and no computationally efficient heuristic is available to treat such problems. Supported in part by the NSF grant DMI 9812994.     

Game theoretic models for climate change negotiations

Negotiations to reduce greenhouse gas accumulation in the atmosphere are modeled as extensive games of perfect information. Various solution concepts, such as Nash equilibrium, reaction function equilibrium, correlated equilibrium and bargaining solutions are applied, analyzed and computed. Special reduction techniques are used when the size of the game tree becomes excessive. A new solution concept, the tree-correlated equilibrium is also introduced. Main features of an Excel add-in designed to compute various solutions are briefly described and a sample policy analysis for a special negotiating scenario is discussed.     

The Discrete-Time GI/Geo/1 Queue with Multiple Vacations

We study a discrete-time GI/Geo/1 queue with server vacations. In this queueing system, the server takes vacations when the system does not have any waiting customers at a service completion instant or a vacation completion instant. This type of discrete-time queueing model has potential applications in computer or telecommunication network systems. Using matrix-geometric method, we obtain the explicit expressions for the stationary distributions of queue length and waiting time and demonstrate the conditional stochastic decomposition property of the queue length and waiting time in this system.     

Addendum to ‘The multi-year non-life insurance risk in the additive reserving model’ [Insurance Math. Econom. 52(3) (2013) 590–598]: Quantification of multi-year non-life insurance risk in chain ladder reserving models

This is the first study to derive closed-form analytical expressions for multi-year non-life insurance risk in the chain ladder model. Extending on previous research on the additive reserving model, we define multi-year risk via prediction errors of multi-year claims development results including both observed and future accident years. A resampling argument and a first-order Taylor approximation address the quantification of estimation errors and multiplicative dependencies in the chain ladder framework, respectively. From our generalized multi-year approach, we deduce estimators for reserve and premium risks in multi-year view and their implicit correlation. We reproduce well-known results from literature for the special cases of one-year and ultimo view. Further, we comment on how to obtain estimators for generalized versions of the chain ladder method. A case study demonstrates the applicability of our analytical formulae.