In multi-objective scheduling problems, the objectives are usually in conflict. To obtain a satisfactory compromise and resolve the issue of NP-hardness, most existing works have suggested employing meta-heuristic methods, such as genetic algorithms. In this research, we propose a novel data-driven approach for generating a single solution that compromises multiple rules pursuing different objectives. The proposed method uses a data mining technique, namely, random forests, in order to extract the logics of several historic schedules and aggregate those. Since it involves learning predictive models, future schedules with the same previous objectives can be easily and quickly obtained by applying new production data into the models. The proposed approach is illustrated with a simulation study, where it appears to successfully produce a new solution showing balanced scheduling performances.

Extending from Grossman and Stiglitz (1980), we provide an asset pricing model of a synchronously traded cross-listed pair under information asymmetry. Following Garbade and Silber (1983), the model further embraces multi-market price discovery in a dynamic framework. The implications are as follows: The price sensitivity of holdings is higher for informed traders than for uninformed traders; the largest cross-border price spread occurs in the absence of arbitrageurs; price discovery is more likely in markets with a larger population of informed traders; and parity convergence accelerates with a higher price elasticity of demand of arbitrageurs.

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

A lot of researches have been conducted to estimate the volatility smile effect shown in the option market. This paper proposes a method to approximate an implied volatility function, given noisy real market option data. To construct an implied volatility function, we use Gaussian Processes (GPs). Their output values are implied volatilities while moneyness values (the ratios of strike price to underlying asset price) and time to maturities are as their input values. To show the performances of our proposed method, we conduct experimental simulations with Korean Equity-Linked Warrant (ELW) market data as well as toy data.

This paper introduces three different simulation algorithms of the shifted Poisson distribution. The first algorithm is the inverse transform method, the second is the rejection sampling, and the third is gamma-Poisson hierarchy sampling. Three algorithms have different regions of parameters at which they are efficient. We numerically compare those algorithms with different sets of parameters. As an application, we give a simulation method of the constant elasticity of variance model.