Evolutionary Game Theoretic Multi-Objective Optimization Algorithms and Their Applications

Multi-objective optimization problems require more than one objective functions to be optimized simultaneously. They are widely applied in many science fields, including engineering, economics and logistics where optimal decisions need to be taken in the presence of trade-offs between two or more conicting objectives. Most of the real world multi-objective optimization problems are NP-Hard problems. It may be too computationally costly to find an exact solution but sometimes a near optimal solution is sufficient. In these cases, Multi-Objective Evolutionary Algorithms (MOEAs) provide good approximate solutions to problems that cannot be solved easily using other techniques. However Evolutionary Algorithm is not stable due to its random nature, it may produce very different results every time it runs. This dissertation proposes an Evolutionary Game Theory (EGT) framework based algorithm (EGTMOA) that provides optimality and stability at the same time. EGTMOA combines the notion of stability from EGT and optimality from MOEA to form a novel and promising algorithm to solve multi-objective optimization problems. This dissertation studies three different multi-objective optimization applications, Cloud Virtual Machine Placement, Body Sensor Networks, and Multi-Hub Molecular Communication along with their proposed EGTMOA framework based algorithms. Experiment results show that EGTMOAs outperform many well known multi-objective evolutionary algorithms in stability, performance and runtime

Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes

I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data in a better way, thus making it subjectively simpler and more beautiful. Curiosity is the desire to create or discover more non-random, non-arbitrary, regular data that is novel and surprising not in the traditional sense of Boltzmann and Shannon but in the sense that it allows for compression progress because its regularity was not yet known. This drive maximizes interestingness, the first derivative of subjective beauty or compressibility, that is, the steepness of the learning curve. It motivates exploring infants, pure mathematicians, composers, artists, dancers, comedians, yourself, and (since 1990) artificial systems.Comment: 35 pages, 3 figures, based on KES 2008 keynote and ALT 2007 / DS 2007 joint invited lectur

SiblingRivalry: Online Autotuning Through Local Competitions

Modern high performance libraries, such as ATLAS and FFTW, and programming languages, such as PetaBricks, have shown that autotuning computer programs can lead to significant speedups. However, autotuning can be burdensome to the deployment of a program, since the tuning process can take a long time and should be re-run whenever the program, microarchitecture, execution environment, or tool chain changes. Failure to re-autotune programs often leads to widespread use of sub-optimal algorithms. With the growth of cloud computing, where computations can run in environments with unknown load and migrate between different (possibly unknown) microarchitectures, the need for online autotuning has become increasingly important. We present SiblingRivalry, a new model for always-on online autotuning that allows parallel programs to continuously adapt and optimize themselves to their environment. In our system, requests are processed by dividing the available cores in half, and processing two identical requests in parallel on each half. Half of the cores are devoted to a known safe program configuration, while the other half are used for an experimental program configuration chosen by our self-adapting evolutionary algorithm. When the faster configuration completes, its results are returned, and the slower configuration is terminated. Over time, this constant experimentation allows programs to adapt to changing dynamic environments and often outperform the original algorithm that uses the entire system.United States. Dept. of Energy (DOE Award DE-SC0005288

Modeling the Evolution of Agent Capabilities and Specialization

A social system is a patterned network of interrelationships that exist between individuals, institutions, and groups forming a coherent whole. Understanding the varying system outcomes for different decision-making processes selected under varying environment constraints in advance will aid in the realization the of best decision towards an effective outcome. One of the ways to increase system productivity is ‘Agent Specialization’. Also, the agents (individuals) who operate as generalists are most vulnerable to being replaced. Therefore, there is a need to focus on agent specialization to enhance the ability of an agent along with the evolution of an agent. Multi-Agent Based Simulation, a subfield of distributed AI, provides a technique to naturally describe a social system. To help improve decision-making intricacies of the agents to evolve and specialize, there is an increasing need to formulate an enhanced model of MABS. This thesis proposes a novel framework that exploits the benefits of social networks providing a decision support system for agent (individual) specialization by integrating the concept of ‘Positive Social Influence’ exerted by experts in the system. Consequently, the proposed framework assists the growth of agents by enabling the evolution of agent capabilities with the identification of suitable producer-agents using an evolutionary component (cultural algorithms). Enabling agent specialization and assisting the ability of the agents through capability evolution is anticipated to increase the productivity of the system. Evaluation of results shows the successful evolution of agent capabilities with the identification of suitable producer-agents in an optimized aspect (reduced operational cost and reduced distance cost) in comparison with exhaustive search, random search, and genetic algorithms and the improved degree of specialization of agents (increased dol values with a minimum of 3% increase to a maximum of 16.7% increase in comparison with standard genetic threshold model for varying agents and task number) in a given dynamic environment

Improving Artificial-Immune-System-based computing by exploiting intrinsic features of computer architectures

Biological systems have become highly significant for traditional computer architectures as examples of highly complex self-organizing systems that perform tasks in parallel with no centralized control. However, few researchers have compared the suitability of different computing approaches for the unique features of Artificial Immune Systems (AIS) when trying to introduce novel computing architectures, and few consider the practicality of their solutions for real world machine learning problems. We propose that the efficacy of AIS-based computing for tackling real world datasets can be improved by the exploitation of intrinsic features of computer architectures. This paper reviews and evaluates current existing implementation solutions for AIS on different computing paradigms and introduces the idea of “C Principles” and “A Principles”. Three Artificial Immune Systems implemented on different architectures are compared using these principles to examine the possibility of improving AIS through taking advantage of intrinsic hardware features

Multiagent systems: games and learning from structures

Multiple agents have become increasingly utilized in various fields for both physical robots and software agents, such as search and rescue robots, automated driving, auctions and electronic commerce agents, and so on. In multiagent domains, agents interact and coadapt with other agents. Each agent's choice of policy depends on the others' joint policy to achieve the best available performance. During this process, the environment evolves and is no longer stationary, where each agent adapts to proceed towards its target. Each micro-level step in time may present a different learning problem which needs to be addressed. However, in this non-stationary environment, a holistic phenomenon forms along with the rational strategies of all players; we define this phenomenon as structural properties. In our research, we present the importance of analyzing the structural properties, and how to extract the structural properties in multiagent environments. According to the agents' objectives, a multiagent environment can be classified as self-interested, cooperative, or competitive. We examine the structure from these three general multiagent environments: self-interested random graphical game playing, distributed cooperative team playing, and competitive group survival. In each scenario, we analyze the structure in each environmental setting, and demonstrate the structure learned as a comprehensive representation: structure of players' action influence, structure of constraints in teamwork communication, and structure of inter-connections among strategies. This structure represents macro-level knowledge arising in a multiagent system, and provides critical, holistic information for each problem domain. Last, we present some open issues and point toward future research

Negotiation-Style Recommender Based on Computational Ecology in Open Negotiation Environments.

The system described herein represents the first example of a recommender system in digital ecosystems where agents negotiate services on behalf of small companies. The small companies compete not only with price or quality, but with a wider service-by-service composition by subcontracting with other companies. The final result of these offerings depends on negotiations at the scale of millions of small companies. This scale requires new platforms for supporting digital business ecosystems, as well as related services like open-id, trust management, monitors and recommenders. This is done in the Open Negotiation Environment (ONE), which is an open-source platform that allows agents, on behalf of small companies, to negotiate and use the ecosystem services, and enables the development of new agent technologies. The methods and tools of cyber engineering are necessary to build up Open Negotiation Environments that are stable, a basic condition for predictable business and reliable business environments. Aiming to build stable digital business ecosystems by means of improved collective intelligence, we introduce a model of negotiation style dynamics from the point of view of computational ecology. This model inspires an ecosystem monitor as well as a novel negotiation style recommender. The ecosystem monitor provides hints to the negotiation style recommender to achieve greater stability of an open negotiation environment in a digital business ecosystem. The greater stability provides the small companies with higher predictability, and therefore better business results. The negotiation style recommender is implemented with a simulated annealing algorithm at a constant temperature, and its impact is shown by applying it to a real case of an open negotiation environment populated by Italian companies.Fil: De La Rosa, Josep Lluis. Universidad de Girona; EspañaFil: Hormazábal, Nicolás. Universidad de Girona; EspañaFil: Aciar, Silvana Vanesa. Universidad Nacional de San Juan; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - San Juan; ArgentinaFil: Lopardo, Gabriel Alejandro. Universidad de Girona; EspañaFil: Trias, Albert. Universidad de Girona; EspañaFil: Montaner, Miquel. No especifíca