Danilo Saft and Volker Nissen (September 13th 2017). A Toolbox to Analyze Emergence in Multiagent Simulations, Multi-agent Systems, Jorge Rocha, IntechOpen, DOI: 10.5772/intechopen.69749. 

Daniela P. Alves, Li Weigang and Bueno B. Souza (January 1st 2008). Reinforcement Learning to Support Meta-Level Control in Air Traffic Management, Reinforcement Learning, Cornelius Weber, Mark Elshaw and Norbert Michael Mayer, IntechOpen, DOI: 10.5772/5293.

New Zealand

Simulated games have become a dominant platform for multiagent intelligence research in recent years. Previous works have succeeded on arcade, first person shooter (FPS), real-time strategy (RTS), and massive online battle arena (MOBA) games. Our work considers massively multiplayer online role-playing games (MMORPGs or MMOs), which capture several complexities of real-world learning that are not well modeled by any other game genre. We present a massively multiagent game environment inspired by MMOs and demonstrate that simple policy gradient methods produce interesting emergent exploration and specialization behaviors.


AAMAS 2020

Neural MMO v1.3: A Massively Multiagent Game Environment for Training and Evaluating Neural Networks

 **RTSS 2021** has successfully concluded. Hope you have enjoyed it, and look forward to seeing you next year in person.
    Announcement for the Awards:
 * Best Paper Award goes to: Monte Carlo Response-Time Analysis, Sergey Bozhko, Georg von der Brüggen, and Björn Brandenburg
 * Best Student Paper Award goes to: Automatic Energy-Hotspot Detection and Elimination in Real-Time Deeply Embedded Systems, Mohsen Shekarisaz, Lothar Thiele, and Mehdi Kargahi.
 * Best Solution Award for Industry Session goes to: Toward Real-Time Guaranteed Scheduling for Autonomous Driving Systems. Jinghao Sun, Tianyi Wang, Kailu Duan, Bin Lu, Jiankang Ren, Zhishan Guo, and Guozhen Tan.



IEEE RTSS 2021

The IEEE Real-Time Systems Symposium (RTSS) is the premier conference in the field of real-time systems, and is a venue for researchers and practitioners to showcase innovations covering all aspects of real-time systems, including theory, design, analysis, implementation, evaluation, and experience. 

technical paper

AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). The aim of the joint conference is to provide a single, high-profile, internationally-respected archival forum for scientific research in the theory and practice of autonomous agents and multi-agent systems.

Browse keynotes, discussions, panels and over 300 presentations.


AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). 

A key assumption in Distributed Constraint Optimization Problem (DCOP) model is that all constraints are fully specified or known a priori, which may not hold in applications where constraints encode preferences of human users. We extend the model to Incom- plete DCOPs (I-DCOPs), where some constraints can be partially specified. User preferences for these partially-specified constraints can be elicited during the execution of I-DCOP algorithms, but they incur some elicitation costs. Additionally, we extend the Synchro- nous Branch-and-Bound (SyncBB) algorithm to solve I-DCOPs. Our model extends the state of the art in distributed constraint reason- ing to better model and solve distributed agent-based applications with user preferences.


Embedding Preference Elicitation Within the Search for DCOP Solutions

Distributed Constraint Optimization Problems (DCOPs) are a suitable formulation for coordinating interactions (i.e. constraints) in cooperative multi-agent systems. The traditional DCOP model deals with variables that can take only discrete values. However, there are many applications where the variables are continuous decision variables. The existing methods for solving DCOPs with continuous variables come with a huge computation and communication overhead. In this paper, we apply continuous non-linear optimization methods on Cooperative Constraint Approximation (CoCoA) algorithm. Empirical results show that our algorithm is able to provide high-quality solutions at the expense of small communication cost and execution time.


C-CoCoA: A Continuous Cooperative Constraint Approximation Algorithm to Solve Functional DCOPs

The paper introduces a generic approach to solving Sequential Security Games (SGs) which utilizes Evolutionary Algorithms (EAs). Formulation of the method (named EASG) is general and largely game-independent, which allows for its application to a wide range of SGs with just little adjustments addressing game specificity. Experiments performed on 3 different types of games (with 300 instances in total) demonstrate robustness and stability of EASG, manifested by repeatable achieving optimal or near-optimal solutions in the vast majority of the cases. The main advantage of EASG is time efficiency. The method scales better than state-of-the-art approaches and can be applied to sequential SGs with bigger numbers of steps compared to the existing methods. Due to anytime characteristics, EASG is very well suited for time-critical applications.


A Generic Metaheuristic Approach to Sequential Security Games

This paper considers the fairness in the problem of budget-feasible mechanism design in two-sided markets where multiple sellers come with indivisible items and buyers come with budgets. Buyers could untruthfully claim their budgets to procure as much value of items as possible from sellers. Each seller with a single item is required to bid his cost since the cost is privately known, while the value of each item is publicly known. A viable mechanism should satisfy buyers’ fairness where a buyer with more budget can procure more value of items, and budget feasibility where buyers’ respective budgets are not exceeded. The goal is to investigate budget-feasible mechanisms that guarantee the fairness, incentives and efficiency simultaneously. We consider two models by distinguishing the types of items, one with homogeneous items and one with heterogeneous items. Our main contributions are the budget-feasible mechanisms for these models that guarantee the fairness, the truthfulness both on the sellers’ side and the buyers’ side, and constant approximation to the optimal total procured value from sellers.


Two-sided Auctions with Budgets: Fairness, Incentives and Efficiency

We develop a Multi-Agent Reinforcement Learning (MARL) method that finds approximately optimal policies for cooperative agents that co-exist in an environment. Central to achieving this is how the agents learn to communicate with each other. Can they together develop a language while learning to perform a common task? We formulate and study a MARL problem where cooperative agents are connected via a fixed underlying network. These agents communicate along the edges of this network by exchanging discrete symbols. However, the semantics of these symbols are not predefined and have to be learned during the training process. We propose a method for training these agents using emergent communication. We demonstrate the applicability of the proposed framework by applying it to the problem of managing traffic controllers, where we achieve state-of-the-art performance (as compared to several strong baselines) and perform a detailed analysis of the emergent communication.


Networked Multi-Agent Reinforcement Learning with Emergent Communication

Humans use language to collectively execute abstract strategies besides using it as a referential tool for identifying physical entities. In our paper, we study the role of emergent languages in discovering and implementing strategies. We formulate the problem using a voting game where two candidate agents contest in an election with the goal of convincing population members (other agents), that are connected to each other via an underlying network, to vote for them. To achieve this goal, agents are only allowed to exchange messages in the form of sequences of discrete symbols. Using our proposed framework, we answer the following questions: (i) Do the agents learn to communicate in a meaningful way? (ii) Does the system evolve as expected under various reward structures? (iii) How is the emergent language affected by the community structure in the network? To the best of our knowledge, we are the first to study emergence of communication among networked agents for discovering and implementing strategies.

Winning an Election: On Emergent Strategic Communication in Multi-Agent Networks

In many practical domains, applying machine learning is challenging not due to the lack of available data, but because labeled samples are in short supply. A common approach for obtaining additional labeled samples is co-training, a semi-supervised learning setting where two learners (agents), trained on different perspectives of the data, iteratively label additional samples. The rationale of this approach is that the different learner perspectives will produce a more diverse labeled set, resulting in more effective classifiers. While co-training proved effective in multiple cases, the labeling mechanisms used by existing approaches are heuristic and error-prone. We propose CoMet, a meta learning-based co-training algorithm. CoMet utilizes meta-models trained on previously analyzed datasets to select the samples to be labeled for the current dataset. Our experiments, conducted on 35 datasets, show that CoMet significantly outperforms the standard co-training approach.


CoMet: A Meta Learning-Based Approach for Cross-Dataset Labeling Using Co-Training

Testing modern computer games is notoriously hard. Highly dynamic behavior, inherent non-determinism, and fine grained interactivity blow up their state space; too large for traditional automated testing techniques. An agent-based testing approach offers an alternative as agents' goal driven planning, adaptivity, and reasoning ability can provide an extra edge. 
We present aplib, a Java library for programming intelligent test agents, featuring tactical programming as an abstract way to exert control on agents' underlying reasoning based behavior. Aplib is implemented in such a way to provide the fluency of a Domain Specific Language (DSL) while still staying in Java, and hence aplib programmers will keep all the advantages that Java programmers get: rich language features and a whole array of development tools.

APLIB: An Agent Programming Library for Testing Games

When dealing with election data it is reasonable to assume that the votes are incomplete or noisy. The reasons are manifold and range from cost-intensive elicitation to manipulation. We study the important questions of evaluating elections with incomplete data and the robustness of elections with noisy data from a computational point of view. To capture different motivations, we consider three models for the distribution of preferences: the uniform distribution over the completions of incomplete preferences inspired by the possible winner problem, the dispersion around complete preferences, also called Mallows noise model, and a model in which the distribution over the votes of each voter is explicitly given. We consider both approval vector preferences and linear order preferences and show that the complexity of the problem can vary greatly depending on the voting rule, the distribution model, and the parameterization.


Complexity of Election Evaluation and Probabilistic Robustness

In this paper, we propose a self-adaptive approach to build a smart traffic light management dealing with intersections. This approach relies on the multiagent systems architecture, suitable to support a distributed and collaborative mechanism of regulation while taking into account dynamic changes in the traffic flow. In our solution, the agents model the intersections and can decide how long is the duration of traffic lights according to their perception of the traffic flow. Each intersection agent uses a behavior tree to update the traffic light status (i.e. switch from green to red lights and vice-versa), changing the duration of each status dynamically, according to the number of cars perceived in each intersection. We also demonstrate how dynamic traffic control policies can be used in a collaborative scenario to regulate traffic flow. 


Neural MMO v1.3: A Massively Multiagent Game Environment for Training and Evaluating Neural Networks

Downloads

Next from AAMAS 2020

Embedding Preference Elicitation Within the Search for DCOP Solutions

Similar lecture

TimeWall: Enabling Time Partitioning for Real-Time Multicore+Accelerator Platforms

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Neural MMO v1.3: A Massively Multiagent Game Environment for Training and Evaluating Neural Networks

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAMAS 2020

Embedding Preference Elicitation Within the Search for DCOP Solutions

Similar lecture

TimeWall: Enabling Time Partitioning for Real-Time Multicore+Accelerator Platforms

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads