New Zealand

Jianfeng Gu (August 29th 2018). Systematic Identification of the Xylophilus Group in the Genus Bursaphelenchus, Advances in Plant Pathology, Josphert Ngui Kimatu, IntechOpen, DOI: 10.5772/intechopen.77096.

Jorge A. Ruiz-Vanoye, Ocotlan Diaz-Parra, Joaquin Perez-Ortega, Rodolfo A. Pazos R., Gerardo Reyes Salgado and Juan Javier Gonzalez-Barbosa (February 1st 2010). Complexity of Instances for Combinatorial Optimization Problems, Computational Intelligence and Modern Heuristics, Al-Dahoud Ali, IntechOpen, DOI: 10.5772/7807. 

This paper studies the complexity of two microbribery problems under the model of group identification. In these problems, we are given a subset of distinguished individuals, and the questions are whether these individuals can be made socially qualified or whether they can be made exactly the socially qualified individuals, respectively, by modifying a limited number of entries in the qualifications-profile. For consent rules, the consensus-start-respecting rule, and the liberal-start-respecting rule, we obtain many $\np$-hardness results as well as polynomial-time solvability results. We also study the problems in $r$-profiles where each individual qualifies exactly $r$ individuals.

AAMAS 2020

Microbribery in Group Identification

microbribery

group identification

complexity

The 45th Annual Meeting of the Cognitive Science Society will take place in Sydney, Australia as a modified hybrid conference. Presentations from the main-session room will be live-streamed every day for all events. This will include all invited talks and award sessions. Recordings of all CogSci 2023 sessions will be made available for on-demand viewing after the conference.<br>
The in-person component will be held at the International Convention Centre Sydney at Darling Harbour. The Conference will take place Wednesday July 26th – Saturday July 29th, 2023 (Wednesday, July 26th is the Workshops Day).

Join us!

<br>[**The Program at a Glance can be found here**](https://cognitivesciencesociety.org/wp-content/uploads/2023/07/COgSci-PAAG-V2.pdf)
<br>[**The Detailed Program can be found here**](https://online.fliphtml5.com/ebtyf/mswz/)
<br><br>

#### **CogSci 2023 Program Book**
<iframe style="width:700px;height:400px" src="https://online.fliphtml5.com/ebtyf/tzgk/"  seamless="seamless" scrolling="no" frameborder="0" allowtransparency="true" allowfullscreen="true" ></iframe>
<br>

CogSci 2023

The 45th Annual Meeting of the Cognitive Science Society presents the latest research across cognitive science and highlights the theme of Cognition in Context.

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). 

Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents from their start locations to their goal locations without collisions. We study the lifelong variant of MAPF where agents are constantly engaged with new goal locations, such as in warehouses. We propose a new framework for solving lifelong MAPF by decomposing the problem into a sequence of Windowed MAPF instances, where a Windowed MAPF solver resolves collisions among the paths of agents only within a finite time horizon and ignores collisions beyond it. Our framework is particularly well suited to generating pliable plans that adapt to continually arriving new goal locations. We evaluate our framework with a variety of MAPF solvers and show that it can produce high-quality solutions for up to 1,000 agents, significantly outperforming existing methods.

Lifelong Multi-Agent Path Finding in Large-Scale Warehouses

"Hierarchical clustering is a stronger extension of one of today's most influential unsupervised learning methods: clustering. The goal of this method is to create a hierarchy of clusters, thus constructing cluster evolutionary history and simultaneously finding clusterings at all resolutions. We propose four traits of interest for hierarchical clustering algorithms: (1) empirical performance, (2) theoretical guarantees, (3) balance (the minimum ratio between cluster sizes), and (4) scalability. While a number of algorithms are designed to achieve one to two of these traits at a time, there exist none that achieve all four.



Inspired by Bateni et al.'s scalable and empirically successful Affinity Clustering [NeurIPs 2017], we introduce Affinity's successor, Matching Affinity Clustering. Like its predecessor, Matching Affinity Clustering maintains strong empirical performance, even outperforming Affinity when the dataset is size 2^n and clusters are balanced, and uses Massively Parallel Communication as its distributed model. Designed to maintain provably balanced clusters, we show that our algorithm achieves a (1/3-epsilon)-approximation for Moseley and Wang's revenue (the dual to Dasgupta's cost) when the data set is of size 2^n, and a (1/9-epsilon)-approximation in general. We prove the former approximation is tight, and also that Affinity Clustering cannot do better than a 1/O(n)-approximation. In addition, we see that our algorithm empirically performs similarly to Affinity Clustering and k-Means, outperforming many state-of-the-art serial algorithms. Along the way, we also introduce an efficient k-sized maximum matching algorithm in the MPC model."

Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees

Option-Critic in Cooperative Multi-agent Systems

Researchers have long been interested in the role that norms can play in governing agent actions in multi-agent systems. Much work has been done on formalising normative concepts from human society and adapting them for the government of open software systems, and on the simulation of normative processes in human and artificial societies. However, there has been comparatively little work on applying normative MAS mechanisms to understanding the norms in human society. This work investigates this issue in the context of international politics. Using the GDELT dataset, containing machine-encoded records of international events extracted from news reports, we extracted bilateral sequences of inter-country events and applied a Bayesian norm mining mechanism to identify norms that best explained the observed behaviour. A statistical evaluation showed that the normative model fitted the data significantly better than a probabilistic discrete event model.

Mining International Political Norms from the GDELT Database

Designing Truthful Contexual Multi-Armed Bandits based Sponsored Search Auctions

Reinforcement learning algorithms have been shown to converge to the classic replicator dynamics of evolutionary game theory, which describe the evolutionary process in the limit of an infinite population. However, it is not clear how to interpret these dynamics from the perspective of a learning agent. In this paper we propose a data-inefficient batch-learning algorithm for temporal difference Q learning and show that it converges to a recently proposed deterministic limit of temporal difference reinforcement learning. In a second step, we state a data-efficient learning algorithm, that uses a form of experience replay, and show that it retains core features of the batch learning algorithm. Thus, we propose an agent-interpretation for the learning dynamics: What is the infinite population limit of evolutionary dynamics is the infinite memory limit of learning dynamics.

Reinforcement Learning Dynamics in the Infinite Memory Limit

Agent-Based Explanations in AI: Towards an Abstract Framework

On-line Estimators for Ad-hoc Task Allocation

"Cooperative cargo transport (e.g., two agents moving a table) is trivial for humans, but poses exceptional challenges to robots. One challenge is learning the dynamics properties of unknown cargo, which is critical for safe operations. We present an algorithm to estimate the inertial parameters of an object grasped by one or more robots in real-time. 
We model each robot's N sub-body system--- considering external and joint actuation--- using the Recursive Newton-Euler equations. A constrained Unscented Kalman Filter estimates the grasped object's mass, center of mass and moments of inertia. Our approach is validated through simulation using Astrobee, a free-flying robot."

Cooperative Real-Time Inertial Parameter Estimation

The problem of disinformation in online social networks has recently received a considerable amount of attention from the research community. It has been shown that online social networks are extensively getting exploited to alter public opinion and individuals’ stance on a wide-range of topics. This study proposes an agent-based model that simulates a disinformation campaign by a group of organized users called conspirators, targeting a susceptible population, which are then opposed by a parallel organized group of users referred to as inouclators that try to act as a barrier to the spread of disinformation. The results of this study indicate that the process of inoculating a susceptible population against disinformation is mostly at the price of further polarizing the population.

Downloads

Next from AAMAS 2020

Lifelong Multi-Agent Path Finding in Large-Scale Warehouses

Similar lecture

Groups are Better than Individuals at Solving Optimum Stopping Problems

.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

Lifelong Multi-Agent Path Finding in Large-Scale Warehouses

Similar lecture

Groups are Better than Individuals at Solving Optimum Stopping Problems

Downloads