Showing 1 - 10 of 16,932
not fixed but arise from Walrasian interactions of total demand and a stylized supply function for each of the goods … Güterpreise nicht fest, sondern entstehen jeweils durch Walrasianische Interaktion von aggregierter Nachfrage und einer …
Persistent link: https://www.econbiz.de/10011526771
Under adaptive learning, recursive algorithms are proposed to represent how agents update their beliefs over time. For applied purposes these algorithms require initial estimates of agents perceived law of motion. Obtaining appropriate initial estimates can become prohibitive within the usual...
Persistent link: https://www.econbiz.de/10011619472
In this paper, we perform an in - depth investigation of relative merits of two adaptive learning algorithms with constant gain, Recursive Least Squares (RLS) and Stochastic Gradient (SG), using the Phelps model of monetary policy as a testing ground. The behavior of the two learning algorithms...
Persistent link: https://www.econbiz.de/10012724434
This paper considers the dynamic lot sizing problem of H. M. Wagner and T. M. Whitin with the assumption that the total cost of n setups is a concave nondecreasing function of n. Such setup costs could arise from the worker learning in setups and/or technological improvements in setup methods....
Persistent link: https://www.econbiz.de/10014218587
Minimax lower bounds for concept learning state, for example, that for each sample size n and learning rule gn , there exists a distribution of the observation X and a concept C to be learnt such that the expected error of gn is at least a constant times V=n, where V is the vc dimension of the...
Persistent link: https://www.econbiz.de/10014089349
This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that …
Persistent link: https://www.econbiz.de/10011526540
This paper proposes a novel method of global optimization based on cuckoo-host co-evaluation. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 96 benchmark functions (of which the results of 30 relatively harder problems have been reported). The proposed...
Persistent link: https://www.econbiz.de/10014040268
The set covering problem is an NP-hard combinatorial optimization problem that arises in applications ranging from crew scheduling in airlines to driver scheduling in public mass transport. In this paper we analyze search space characteristics of a widely used set of benchmark instances through...
Persistent link: https://www.econbiz.de/10014116698
We propose a new, highly effective and easy-to-implement algorithm for solving large-scale mean-variance optimization problems --- with weight upper bound constraints and without short sales --- when the size of mean-variance portfolios is much smaller than the number of assets, which is almost...
Persistent link: https://www.econbiz.de/10013308810
Persistent link: https://www.econbiz.de/10009759481