ABSTRACT. This paper studies the dynamics of the traditional cobweb model with risk averse heterogeneous producers who seek to learn the distribution of asset prices using geometric decay processes (GDP)—the expected mean and variance are estimated as a geometric weighted average of past observations—with either finite or infinite fading memory. With constant absolute risk aversion, the dynamic...

There are three species of the Genus Steatoda Sundevall, 1833 (Family Theridiidae 1833) distributed on Indian subcontinent. Here, we report first record S. erigoniformis (O. Pickard-Cambridge, 1872) from India, specifically Maharashtra and Rajasthan states. Previously, this was known Central Asia China, but now its range extends south to India.

We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from clustering. The problem of cluster-grouping can be regarded as a new type of inductive optimization query that asks for the k best patterns according to a convex criterion. The algorithm CG for solving cluster-grouping...

This paper first extracted 11 indicators from four aspects of infrastructure, educational equity, teaching quality, and scientific research level established a multidimensional higher education evaluation system. After that, according to TOPSIS the entropy method, comprehensive score development was obtained, index proposed. According score, we divide status into 5 categories, use discrete Hopf...

This paper studies aggregate dynamics in a cobweb model where learning takes place through a selection mecanism, by which more successful …rms are replicated at a higher rate. The structure of the model allows to characterize analytically the aggregate dynamics, and to compute the e¤ect on welfare of alternative levels of selectivity. A central aspect is that greater selectivity, while bringing...

Dynamic Programming hardly requires introduction. Since the term was in introduced by Richard Bellman in 1940’s it has countless applications and it’s power allows to have fast algorithms in cases where at a blush there seems to be no way to avoid exponential time. Such examples include graph algorithms: Bellman-Ford, Floyd-Warshall as well as option pricing, numerical solutions to HJB equation...