This paper tries to connect the theory of genetic algorithm (GA) learning to evolutionary game theory. It is shown that economic learning via genetic algorithms can be described as a specific form of evolutionary game. It will be pointed out that GA learning results in a series of near Nash...

This paper presents the conditions required for a profile in order to never exhibit either the strong or the strict Borda paradoxes under all weighted scoring rules in three-candidate elections. The main particularity of our paper is that all the conclusions are extracted from the differences of...

In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...

We study the problem of determining memberships to the groups in a Boolean algebra. The Boolean algebra is composed of basic groups (e.g., “J” and “K”) and the other groups that are derived from basic groups through the conjunction, disjunction, or negation operations (e.g., “J and...

A solution method is derived in this paper for solving a system of linear rational-expectations equation with lagged expectations (e.g., models incorporating sticky information) using the method of undetermined coefficients for the infinite MA representation. The method applies a combination of...

Several approaches for subset recovery and improved forecasting accuracy have been proposed and studied. One way is to apply a regularization strategy and solve the model selection task as a continuous optimization problem. One of the most popular approaches in this research field is given by...

Value function iteration is one of the standard tools for the solution of the Ramsey model. We compare six different ways of value function iteration with regard to speed and precision. We find that value function iteration with cubic spline interpolation between grid points dominates the other...

Prefetching is a simple and general method for single-chain parallelisation of the Metropolis-Hastings algorithm based on the idea of evaluating the posterior in parallel and ahead of time. Improved Metropolis-Hastings prefetching algorithms are presented and evaluated. It is shown how to use...

In facility layout problems, a major concern is the optimal design or remodeling of the facilities of an organization. The decision maker's objective is to arrange the facility in an optimal way, so that the interaction among functions (i.e. machines, inventories, persons) and places (i.e....

In linear-quadratic control (LQC) problems with singular control cost matrix and/or singular transition matrix, we derive a reduction of the dimension of the Riccati matrix, simplifying iteration and solution. Employing a novel transformation, we show that, under a certain rank condition, the...