4,476 research outputs found

    Democracy under uncertainty: The ‘wisdom of crowds’ and the free-rider problem in group decision making

    Get PDF
    We introduce a game theory model of individual decisions to cooperate by contributing personal resources to group decisions versus by free-riding on the contributions of other members. In contrast to most public-goods games that assume group returns are linear in individual contributions, the present model assumes decreasing marginal group production as a function of aggregate individual contributions. This diminishing marginal returns assumption is more realistic and generates starkly different predictions compared to the linear model. One important implication is that, under most conditions, there exist equilibria where some, but not all members of a group contribute, even with completely self-interested motives. An agent-based simulation confirms the individual and group advantages of the equilibria in which behavioral asymmetry emerges from a game structure that is a priori perfectly symmetric for all agents (all agents have the same payoff function and action space, but take different actions in equilibria). And a behavioral experiment demonstrates that cooperators and free-riders coexist in a stable manner in groups performing with the non-linear production function. A collateral result demonstrates that, compared to a ―dictatorial‖ decision scheme guided by the best member in a group, the majority-plurality decision rules can pool information effectively and produce greater individual net welfare at equilibrium, even if free-riding is not sanctioned. This is an original proof that cooperation in ad hoc decision-making groups can be understood in terms of self-interested motivations and that, despite the free-rider problem, majority-plurality decision rules can function robustly as simple, efficient social decision heuristics.group decision making under uncertainty, free-rider problem, majority-plurality rules, marginally-diminishing group returns, evolutionary games, behavioral experiment

    Myths and Legends of the Baldwin Effect

    Get PDF
    This position paper argues that the Baldwin effect is widely misunderstood by the evolutionary computation community. The misunderstandings appear to fall into two general categories. Firstly, it is commonly believed that the Baldwin effect is concerned with the synergy that results when there is an evolving population of learning individuals. This is only half of the story. The full story is more complicated and more interesting. The Baldwin effect is concerned with the costs and benefits of lifetime learning by individuals in an evolving population. Several researchers have focussed exclusively on the benefits, but there is much to be gained from attention to the costs. This paper explains the two sides of the story and enumerates ten of the costs and benefits of lifetime learning by individuals in an evolving population. Secondly, there is a cluster of misunderstandings about the relationship between the Baldwin effect and Lamarckian inheritance of acquired characteristics. The Baldwin effect is not Lamarckian. A Lamarckian algorithm is not better for most evolutionary computing problems than a Baldwinian algorithm. Finally, Lamarckian inheritance is not a better model of memetic (cultural) evolution than the Baldwin effect

    A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems

    Get PDF
    Copyright @ Springer-Verlag 2008Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This paper investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework of memetic algorithms, which combines the features of greedy crossover-based hill climbing and steepest mutation-based hill climbing. In order to address the convergence problem, two diversity maintaining methods, called adaptive dual mapping and triggered random immigrants, respectively, are also introduced into the proposed memetic algorithm for dynamic optimization problems. Based on a series of dynamic problems generated from several stationary benchmark problems, experiments are carried out to investigate the performance of the proposed memetic algorithm in comparison with some peer evolutionary algorithms. The experimental results show the efficiency of the proposed memetic algorithm in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant Nos. 70431003 and 70671020, the National Innovation Research Community Science Foundation of China under Grant No. 60521003, and the National Support Plan of China under Grant No. 2006BAH02A09 and the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01

    Evolutionary model type selection for global surrogate modeling

    Get PDF
    Due to the scale and computational complexity of currently used simulation codes, global surrogate (metamodels) models have become indispensable tools for exploring and understanding the design space. Due to their compact formulation they are cheap to evaluate and thus readily facilitate visualization, design space exploration, rapid prototyping, and sensitivity analysis. They can also be used as accurate building blocks in design packages or larger simulation environments. Consequently, there is great interest in techniques that facilitate the construction of such approximation models while minimizing the computational cost and maximizing model accuracy. Many surrogate model types exist ( Support Vector Machines, Kriging, Neural Networks, etc.) but no type is optimal in all circumstances. Nor is there any hard theory available that can help make this choice. In this paper we present an automatic approach to the model type selection problem. We describe an adaptive global surrogate modeling environment with adaptive sampling, driven by speciated evolution. Different model types are evolved cooperatively using a Genetic Algorithm ( heterogeneous evolution) and compete to approximate the iteratively selected data. In this way the optimal model type and complexity for a given data set or simulation code can be dynamically determined. Its utility and performance is demonstrated on a number of problems where it outperforms traditional sequential execution of each model type

    Self-adaptive hybrid genetic algorithm using an ant-based algorithm

    Get PDF
    The pheromone trail metaphor is a simple and effective way to accumulate the experience of the past solutions in solving discrete optimization problems. Ant-based optimization algorithms have been successfully employed to solve hard optimization problems. The problem of achieving an optimal utilization of a hybrid genetic algorithm search time is actually a problem of finding its optimal set of control parameters. In this paper, a novel form of hybridization between an ant-based algorithm and a genetic-local hybrid algorithm is proposed. An ant colony optimization algorithm is used to monitor the behavior of a genetic-local hybrid algorithm and dynamically adjust its control parameters to optimize the exploitation-exploration balance according to the fitness landscape
    corecore