there are different strategies for selecting stocks, and different investors use different strategies according to their risk tolerance or their expected rate of return. in this study, the profitability of a broad range of stock se-lection strategies in tehran stock exchange over the period 1370-1383, has been examined, and it has been investigated whether the successful strategies in other cou...

This paper presents first results of an analysis of the σ-self-adaptation mechanism on the sharp ridge for non-recombinative (1, λ) evolution strategies (ES). To analyze the ES’s evolution, we consider the so-called evolution equations which describe the one-generation change. Neglecting stochastic perturbations and considering only the mean value dynamics, we will investigate possible causes w...

this paper presents an analytic procedure for the value added to different production levels with different policy options. the approach is stochastic and thus provides a framework for informed decision-making on productivity growth under uncertainty conditions. the model was applied to data collected from a firm and re-sults recommend that the firm should redevelop if in diversification and sy...

Due to the exibility in adapting to diierent tness landscapes, self-adaptive evolutionary algorithms (SA-EAs) have been gaining popularity in the recent past. In this paper, we postulate the properties that SA-EA operators should have for successful applications in real-valued search spaces. Speciically, population mean and variance of a number of SA-EA operators, such as various real-parameter...

The evolution of dispersal is examined by looking at evolutionarily stable strategies (ESS) for dispersal parameters in discrete time multisite models without any cost of dispersal. ESS are investigated analytically, based on explicit results on sensitivity analysis of matrix models. The basic model considers an arbitrary number of sites and a single age class. An ESS for dispersal parameters i...

We consider a multi-awards generalization of King Solomon’s problem: k identical and indivisible awards should be distributed among n agents, k < n, with the top k valuation agents receiving the awards. Agents have complete information about each others’ valuations. Glazer and Ma (1989) analyzed the single-prize (i.e., k = 1) version of this problem. We show that in the ‘more than two agents’ p...

Determining the best, or near best timetable of lecture/courses for a university department, which optimizes enrollment, is a challenging problem. Described herein is a platform developed to accept student-generated data of course preferences, the university department curriculum, and resource constraints. The platform then generates the best or near best feasible schedule using an Evolutionary...