<?xml version="1.0" encoding="UTF-8" standalone="no" ?>
<rss version="2.0">
  <channel>
    <title>Computational Techniques; Simulation Modelling</title>
    <link>http://repub.eur.nl/res/concept/jel-C63/</link>
    <description>Recent publications classified by JEL Code C63</description>
    <language>en</language>
    <image>
      <url>http://repub.eur.nl/static-eur/img/logo.png</url>
      <title>RePub, Erasmus University Rotterdam</title>
      <link>http://repub.eur.nl</link>
    </image>
    <item>
      <title>Towards autonomous decision-making: A probabilistic model for learning multi-user preferences (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/40144/</link>
      <pubDate>2013-05-22T00:00:00Z</pubDate>
      <description>
        
        Information systems have revolutionized the provisioning of decision-relevant information, and decision support tools have improved human decisions in many domains. Autonomous decision- making, on the other hand, remains hampered by systems’ inability to faithfully capture human preferences. We present a computational preference model that learns unobtrusively from lim- ited data by pooling observations across like-minded users. Our model quantifies the certainty of its own predictions as input to autonomous decision-making tasks, and it infers probabilistic segments based on user choices in the process. We evaluate our model on real-world preference data collected on a commercial crowdsourcing platform, and we find that it outperforms both individual and population-level estimates in terms of predictive accuracy and the informative- ness of its certainty estimates. Our work takes an important step toward systems that act autonomously on their users’ behalf.
      </description>
      <author>Peters, M.</author> <author>Ketter, W.</author>
    </item> <item>
      <title>The 2013 Power Trading Agent Competition (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/40138/</link>
      <pubDate>2013-05-22T00:00:00Z</pubDate>
      <description>
        
        This is the specification for the Power Trading Agent Competition for 2013 (Power TAC 2013). Power TAC is a competitive simulation that models a “liberalized” retail electrical energy market, where competing business entities or “brokers” offer energy services to customers through tariff contracts, and must then serve those customers by trading in a wholesale market. Brokers are challenged to maximize their profits by buying and selling energy in the wholesale and retail markets, subject to fixed costs and constraints. Costs include fees for publication and withdrawal of tariffs, and distribution fees for transporting energy to their contracted customers. Costs are also incurred whenever there is an imbalance between a broker’s total contracted energy supply and demand within a given time slot.

The simulation environment models a wholesale market, a regulated distribution utility, and a population of energy customers, situated in a real location on Earth during a specific period for which weather data is available. The wholesale market is a relatively simple call market, similar to many existing wholesale electric power markets, such as Nord Pool in Scandinavia or FERC markets in North America, but unlike the FERC markets we are modeling a single region, and therefore we do not model location-marginal pricing. Customer models include households and a variety of commercial and industrial entities, many of which have production capacity (such as solar panels or wind turbines) as well as electric vehicles. All have “real-time” metering to support allocation of their hourly supply and demand to their subscribed brokers, and all are approximate utility maximizers with respect to tariff selection, although the factors making up their utility functions may include aversion to change and complexity that can retard uptake of marginally better tariff offers. The distribution utility models the regulated natural monopoly that owns the regional distribution network, and is responsible for maintenance of its infrastructure and for real-time balancing of supply and demand. The balancing process is a market-based mechanism that uses economic incentives to encourage brokers to achieve balance within their portfolios of tariff subscribers and wholesale market positions, in the face of stochastic customer behaviors and weather-dependent renewable energy sources. The broker with the highest bank balance at the end of the simulation wins.
      </description>
      <author>Ketter, W.</author> <author>Collins, J.</author> <author>Reddy, P.</author> <author>Weerdt, M.M. de</author>
    </item> <item>
      <title>Power Structures and Adaptation: How to Distribute Power within a Group (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/30573/</link>
      <pubDate>2011-11-21T00:00:00Z</pubDate>
      <description>
        
        How steep should a hierarchy be, or should there be a hierarchical stratification at all? Research on power, divided between two main research streams (i.e., functionalist and conflict theories of power), reports discrepant answers to this question. This paper suggests that the choice between groups with low, high, and moderate power disparity depends on whether power assignment is based on competency or not. Problem complexity, group size, and size of the difference between high and low power are also proposed as moderators in comparing different power models. The present paper extends earlier work by conceptualizing power simultaneously as a relational capacity, behaviors emanating from this capacity, and exercise of power in the form of influence. Additionally, it goes beyond the formal organizational design perspective where power is confined to formal and stable hierarchies, and allows for informal power structures and evolutionary dynamics.
      </description>
      <author>Tarakci, M.</author> <author>Groenen, P.J.F.</author>
    </item> <item>
      <title>Modelling Issues in Kernel Ridge Regression (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/26508/</link>
      <pubDate>2011-09-01T00:00:00Z</pubDate>
      <description>
        
        Kernel ridge regression is gaining popularity as a data-rich nonlinear forecasting tool, which is applicable in many different contexts. This paper investigates the influence of the choice of kernel and the setting of tuning parameters on forecast accuracy. We review several popular kernels, including polynomial kernels, the Gaussian kernel, and the Sinc kernel. We interpret the latter two kernels in terms of their smoothing properties, and we relate the tuning parameters associated to all these kernels to smoothness measures of the prediction function and to the signal-to-noise ratio. Based on these interpretations, we provide guidelines for selecting the tuning parameters from small grids using cross-validation. A Monte Carlo study confirms the practical usefulness of these rules of thumb. Finally, the flexible and smooth functional forms provided by the Gaussian and Sinc kernels makes them widely applicable, and we recommend their use instead of the pop ular polynomial kernels in general settings, in which no information on the data-generating process is available.
      </description>
      <author>Exterkate, P.</author>
    </item> <item>
      <title>An Alternative Bayesian Approach to Structural Breaks in Time Series Models (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/22551/</link>
      <pubDate>2011-02-07T00:00:00Z</pubDate>
      <description>
        
        We propose a new approach to deal with structural breaks in time series models. The key contribution is an alternative dynamic stochastic specification for the model parameters which describes potential breaks. After a break new parameter values are generated from a so-called baseline prior distribution. Modeling boils down to the choice of a parametric likelihood specification and a baseline prior with the proper support for the parameters. The approach accounts in a natural way for potential out-of-sample breaks where the number of breaks is stochastic. Posterior inference involves simple computations that are less demanding than existing methods. The approach is illustrated on nonlinear discrete time series models and models with restrictions on the parameter space.
      </description>
      <author>Hauwe, S. van den</author> <author>Paap, R.</author> <author>Dijk, D.J.C. van</author>
    </item> <item>
      <title>Nonlinear Forecasting with Many Predictors using Kernel Ridge Regression (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/22335/</link>
      <pubDate>2011-01-04T00:00:00Z</pubDate>
      <description>
        
        This paper puts forward kernel ridge regression as an approach for forecasting with many predictors that are related nonlinearly to the target variable. In kernel ridge regression, the observed predictor variables are mapped nonlinearly into a high-dimensional space, where estimation of the predictive regression model is based on a shrinkage estimator to avoid overfitting. We extend the kernel ridge regression methodology to enable its use for economic time-series forecasting, by including lags of the dependent variable or other individual variables as predictors, as is typically desired in macroeconomic and financial applications. Monte Carlo simulations as well as an empirical application to various key measures of real economic activity confirm that kernel ridge regression can produce more accurate forecasts than traditional linear methods for dealing with many predictors based on principal component regression.
      </description>
      <author>Exterkate, P.</author> <author>Groenen, P.J.F.</author> <author>Heij, C.</author> <author>Dijk, D.J.C. van</author>
    </item> <item>
      <title>A comparison of biased simulation schemes for stochastic volatility models (Article)</title>
      <link>http://repub.eur.nl/res/pub/18571/</link>
      <pubDate>2010-02-01T00:00:00Z</pubDate>
      <description>
        
        Using an Euler discretization to simulate a mean-reverting CEV process gives rise to the problem that while the process itself is guaranteed to be nonnegative, the discretization is not. Although an exact and efficient simulation algorithm exists for this process, at present this is not the case for the CEV-SV stochastic volatility model, with the Heston model as a special case, where the variance is modelled as a mean-reverting CEV process. Consequently, when using an Euler discretization, one must carefully think about how to fix negative variances. Our contribution is threefold. Firstly, we unify all Euler fixes into a single general framework. Secondly, we introduce the new full truncation scheme, tailored to minimize the positive bias found when pricing European options. Thirdly and finally, we numerically compare all Euler fixes to recent quasi-second order schemes of Kahl and Jckel, and Ninomiya and Victoir, as well as to the exact scheme of Broadie and Kaya. The choice of fix is found to be extremely important. The full truncation scheme outperforms all considered biased schemes in terms of bias and root-mean-squared error
      </description>
      <author>Lord, R.</author> <author>Koekkoek, R.</author> <author>Dijk, D.J.C. van</author>
    </item> <item>
      <title>Stochastic Dominance: Convexity and Some Efficiency Tests (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/17495/</link>
      <pubDate>2009-11-01T00:00:00Z</pubDate>
      <description>
        
        This paper points out the importance of Stochastic Dominance (SD) efficient sets being convex. We review classic convexity and efficient set characterization results on SD efficiency of a given portfolio relative to a diversified set of assets and generalize them in the following aspects. First, we broaden the class of individual utilities in Rubinstein (1974) that lead to two-fund separation. Secondly, we propose a linear programming SSD test that is more efficient than that of Post (2003) and expand the SSD efficiency criteria developed by Dybvig and Ross (1982) onto the Third Order Stochastic Dominance and further to Decreasing Absolute and Increasing Relative Risk Aversion Stochastic Dominance. The efficient sets for those are finite unions of convex sets.
      </description>
      <author>Lizyayev, A.M.</author>
    </item> <item>
      <title>Tactical and Strategic Sales Management for Intelligent Agents Guided By Economic Regimes (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/13547/</link>
      <pubDate>2008-10-20T00:00:00Z</pubDate>
      <description>
        
        We present a computational approach that autonomous software agents can adopt to make tactical decisions, such as product pricing, and strategic decisions, such as product mix and production planning, to maximize profit in markets with supply and demand uncertainties. Using a combination of machine learning and optimization techniques, the agent is able to characterize economic regimes, which are historical microeconomic conditions reflecting situations such as over-supply and scarcity. We assume an agent is capable of using real-time observable information to identify the current dominant market condition and we show how it can forecast regime changes over a planning horizon. We demonstrate how the agent can then use regime characterization to predict prices, price trends, and the probability of receiving a customer order in a dynamic supply chain environment. We validate our methods by presenting experimental results from a testbed derived from the Trading Agent Competition for Supply Chain Management (TAC SCM). The results show that our agent outperforms traditional short- and long-term predictive methodologies (such as exponential smoothing) significantly, resulting in accurate prediction of customer order probabilities, and competitive market prices. This, in turn, has the potential to produce higher profits. We also demonstrate the versatility of our computational approach by applying the methodology to prediction of stock price trends.
      </description>
      <author>Ketter, W.</author> <author>Collins, J.</author> <author>Gini, M.</author> <author>Gupta, A.</author> <author>Schrater, P.</author>
    </item> <item>
      <title>Including Item Characteristics in the Probabilistic Latent Semantic Analysis Model for Collaborative Filtering (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/13180/</link>
      <pubDate>2008-08-27T00:00:00Z</pubDate>
      <description>
        
        We propose a new hybrid recommender system that combines some advantages of collaborative and content-based recommender systems. While it uses ratings data of all users, as do collaborative recommender systems, it is also able to recommend new items and provide an explanation of its recommendations, as do content-based systems. Our approach is based on the idea that there are communities of users that find the same characteristics important to like or dislike a product. This model is an extension of the probabilistic latent semantic model for collaborative filtering with ideas based on clusterwise linear regression. On a movie data set, we show that the model is competitive to other recommenders and can be used to explain the recommendations to the users.
      </description>
      <author>Kagie, M.</author> <author>Loos, M.J.H.M. van der</author> <author>Wezel, M.C. van</author>
    </item> <item>
      <title>Optimal Fourier Inversion in Semi-analytical Option Pricing (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/7915/</link>
      <pubDate>2006-07-18T00:00:00Z</pubDate>
      <description>
        
        At the time of writing this article, Fourier inversion is the computational method of choice for a fast and accurate calculation of plain vanilla option prices in models with an analytically available characteristic function. Shifting the contour of integration along the complex plane allows for different representations of the inverse Fourier integral. In this article, we present the optimal contour of the Fourier integral, taking into account numerical issues such as cancellation and explosion of the characteristic function. This allows for robust and fast option pricing for almost all levels of strikes and maturities.
      </description>
      <author>Lord, R.</author> <author>Kahl, Ch.</author>
    </item> <item>
      <title>A Comparison of Biased Simulation Schemes for Stochastic Volatility Models (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/7738/</link>
      <pubDate>2006-05-17T00:00:00Z</pubDate>
      <description>
        
        When using an Euler discretisation to simulate a mean-reverting square root process, one runs into the problem that while the process itself is guaranteed to be nonnegative, the discretisation is not. Although an exact and efficient simulation algorithm exists for this process, at present this is not the case for the Heston stochastic volatility model, where the variance is modelled as a square root process. Consequently, when using an Euler discretisation, one must carefully think about how to fix negative variances. Our contribution is threefold. Firstly, we unify all Euler fixes into a single general framework. Secondly, we introduce the new full truncation scheme, tailored to minimise the upward bias found when pricing European options. Thirdly and finally, we numerically compare all Euler fixes to a recent quasi-second order scheme of Kahl and Jäckel and the exact scheme of Broadie and Kaya. The choice of fix is found to be extremely important. The full truncation scheme by far outperforms all biased schemes in terms of bias, root-mean-squared error, and hence should be the preferred discretisation method for simulation of the Heston model and extensions thereof.
      </description>
      <author>Lord, R.</author> <author>Koekkoek, R.</author> <author>Dijk, D.J.C. van</author>
    </item> <item>
      <title>On the Design of Artificial Stock Markets (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/1900/</link>
      <pubDate>2005-02-18T00:00:00Z</pubDate>
      <description>
        
        Artificial stock markets are designed with the aim to study and understand market dynamics
by representing (part of) real stock markets. Since there is a large variety of real
stock markets with several partially observable elements and hidden processes, artificial
markets differ regarding their structure and implementation. In this paper we analyze to
what degree current artificial stock markets reflect the workings of real stock markets. In
order to conduct this analysis we set up a list of factors which influence market dynamics
and are as a consequence important to consider for designing market models. We differentiate
two categories of factors: general, well-defined aspects that characterize the organization
of a market and hidden aspects that characterize the functioning of the markets and the
behaviour of the traders.
      </description>
      <author>Boer-Sorban, K.</author> <author>Bruin, A. de</author> <author>Kaymak, U.</author>
    </item> <item>
      <title>Adaptive radial-based direction sampling: some flexible and robust Monte Carlo integration methods (Article)</title>
      <link>http://repub.eur.nl/res/pub/11191/</link>
      <pubDate>2004-12-01T00:00:00Z</pubDate>
      <description>
        
        Adaptive radial-based direction sampling (ARDS) algorithms are specified for Bayesian analysis of models with non-elliptical, possibly, multimodal target distributions. A key step is a radial-based transformation to directions and distances. After the transformation a Metropolis-Hastings method or, alternatively, an importance sampling method is applied to evaluate generated directions. Next, distances are generated from the exact target distribution. An adaptive procedure is applied to update the initial location and covariance matrix in order to sample directions in an efficient way. The ARDS algorithms are illustrated on a regression model with scale contamination and a mixture model for economic growth of the USA.
      </description>
      <author>Bauwens, L.</author> <author>Bos, C.S.</author> <author>Dijk, H.K. van</author> <author>Oest, R.D. van</author>
    </item> <item>
      <title>An Improved Estimator For Black-Scholes-Merton Implied Volatility (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/1472/</link>
      <pubDate>2004-08-11T00:00:00Z</pubDate>
      <description>
        
        We derive an estimator for Black-Scholes-Merton implied volatility that, when compared to the familiar Corrado &amp; Miller [JBaF, 1996] estimator, has substantially higher approximation accuracy and extends over a wider region of moneyness.
      </description>
      <author>Hallerbach, W.G.P.M.</author>
    </item> <item>
      <title>Adaptive radial-based direction sampling; Some flexible and robust Monte Carlo integration methods (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/1722/</link>
      <pubDate>2003-08-06T00:00:00Z</pubDate>
      <description>
        
        Adaptive radial-based direction sampling (ARDS) algorithms are specified for Bayesian analysis of models with nonelliptical, possibly, multimodal target distributions.
A key step is a radial-based transformation to directions and distances. After the transformations a Metropolis-Hastings method or, alternatively, an importance sampling method is applied to evaluate generated directions. Next, distances are generated from the exact target distribution by means of the numerical inverse transformation method. An adaptive procedure is applied to update the initial location and covariance matrix in order to sample directions in an efficient way. Tested on a set of canonical mixture models that feature multimodality, strong correlation, and skewness, the ARDS algorithms compare favourably with the standard Metropolis-Hastings and importance samplers in terms of flexibility and robustness. The empirical examples include a regression model with scale contamination and a mixture model for economic growth of the USA.
      </description>
      <author>Bauwens, L.</author> <author>Bos, C.S.</author> <author>Dijk, H.K. van</author> <author>Oest, R.D. van</author>
    </item> <item>
      <title>Adaptive Polar Sampling with an Application to a Bayes Measure of Value-at-Risk (Research Paper)</title>
      <link>http://repub.eur.nl/res/pub/7712/</link>
      <pubDate>1999-10-21T00:00:00Z</pubDate>
      <description>
        
        Adaptive Polar Sampling (APS) is proposed as a Markov chain Monte Carlo method for Bayesian analysis of models with ill-behaved posterior distributions. In order to sample efficiently from such a distribution, a location-scale transformation and a transformation to polar coordinates are used. After the transformation to polar coordinates, a Metropolis-Hastings algorithm is applied to sample directions and, conditionally on these, distances are generated by inverting the CDF. A sequential procedure is applied to update the location and scale.
Tested on a set of canonical models that feature near non-identifiability, strong correlation, and bimodality, APS compares favourably with the standard Metropolis-Hastings sampler in terms of parsimony and robustness. APS is applied within a Bayesian analysis of a GARCH-mixture model which is used for the evaluation of the Value-at-Risk of the return of the Dow Jones stock index.
      </description>
      <author>Bauwens, L.</author> <author>Bos, C.S.</author> <author>Dijk, H.K. van</author>
    </item>
  </channel>
</rss>