New Zealand

Esmail Khodadadi (December 13th 2019). Investigating the Factors Affecting the Hand Hygiene Compliance from the Viewpoints of Iranian Nurses Who Work in Intensive Care Units, Surgical Infections - Some Facts, Manal Mohammad Baddour, IntechOpen, DOI: 10.5772/intechopen.81561. 

AAMAS 2020

Silly rules improve the capacity of agents to learn stable enforcement and compliance behaviors

norms

multi-agent

reinforcement learning

### Conference Welcome

Welcome to the third Cultural Evolution Society Conference, CES2021. In the conference, which will be held from June 9-11, 2021, about 180 researchers from East Asia, Oceania, Middle East, Europe, North and South America give presentations on their latest research advancing the evolutionary understanding of human and nonhuman animal culture.

### Schedule and Program

[![](https://assets.underline.io/uploads/markdown_image/1/image/1ef06ffd05f80957b4a5b685f63ee3ba.png)](https://www.chain.hokudai.ac.jp/CES2020/wp-content/uploads/2021/06/fullprogram.pdf)
[![](https://assets.underline.io/uploads/markdown_image/1/image/12285eb22580949635121d15d5b46325.png)](https://www.chain.hokudai.ac.jp/CES2020/wp-content/uploads/2021/06/abstracts.pdf)

**Program-at-glance**

![](https://assets.underline.io/uploads/markdown_image/1/image/c0d0d4c8fcdad49d12631574fd966ae8.png)

### About the conference 
 
**Help-desk:** 
Please first visit [Help-desk](https://underline.io/events/120/help-desk) where you can find the instructions and manuals for exploring the conference site. 

**Plenary sessions:**
Five leading researchers give a live talk. It is like a TV show. The audience can submit a question from the chat window. Chat messages are immediately delivered to speakers and moderators.

**Q&A sessions (parallel):**
Each presenter first gives a 2-minute live lightning talk followed by an 8-minute live discussion with the audience. It uses Zoom.

**Discussion sessions:** 
The audience can approach presenters and discuss their research. The sessions are held in a dedicated room in Gathertown.
 
**Gathertown:**
It is a platform dedicated to live virtual interactions.
Gather Town is available for all participants 24 hours during the conference.
You can meet and talk with anybody at a lounge or at a table in Gathertown.
Further Gather Town instruction and how to use short keys please find in our [Help desk page](https://underline.io/events/120/help-desk). 

**Videos and slides:**

* Plenary sessions and the Q&A sessions will be recorded and uploaded after the sessions.
* All the videos and slides are available for 60 days after the conference but only to registered ones. 

**Text-based chatting with the speakers:** 
You can chat with any speaker in the Q&A and discussion sessions. A chat window is available on each speaker’s page, and you can leave your questions there. 

**Announcement to the other participants:**
If you want to make an announcement to the other participants (e.g., “Hey, let’s meet at the lounge in Gathertown from 9pm CEST!), please use twitter (#CESConf2021).



### Code of conduct

See the full details of [the code of conduct](https://www.chain.hokudai.ac.jp/CES2020/code-of-conduct/).
&nbsp; 
 CES is dedicated to providing a welcoming and harassment-free conference experience for everyone, regardless of gender, gender identity and expression, sexual orientation, disability, physical appearance, body size, race, age, religion, nationality, or the presence of or care for dependents. 
We do not tolerate harassment of conference participants in any form. Conference participants violating these rules may be sanctioned or expelled from the conference at the discretion of the conference organizers.

&nbsp;
**Harassment can occur in-person or virtually, and includes, but is not limited to:**
* Comments (verbal, text, etc.) that reinforce social structures of domination related to gender, gender identity and expression, sexual orientation, disability, physical appearance, body size, race, age, religion, nationality
* Sexual images in public spaces (physical or virtual)
* Deliberate intimidation, stalking, or following
* Harassing photography or recording (including sharing of presentation materials without consent)
* Sustained disruption of talks or other events (including “Zoombombing”)
* Inappropriate physical contact or unwelcome sexual attention
* Advocating for, or encouraging, any of the above behaviour 

&nbsp;
 **Inclusiveness Committee**:
&nbsp;
 To facilitate implementing the code of conduct and foster a climate of inclusion, we have developed an inclusiveness committee. Below is their contact information:
 **Hiromi Matsumae**:	matsumae.hiromi.g@tokai.ac.jp
 **Patrick Savage**:	psavage@sfc.keio.ac.jp
 **Sarah Mathew**:	Sarah.Mathew@asu.edu
 **Gmail:** inclusivenessCES2021@gmail.com
 See [more details about reporting the harassment.](https://www.chain.hokudai.ac.jp/CES2020/code-of-conduct/)

### Organizing committee

**Honorary Conference Organizer:** [Kenichi Aoki (Meiji University)](https://sites.google.com/site/kenichi1aoki/home) 

**Chair:** [Masanori Takezawa (Hokkaido University)](https://lalalarakko.github.io)

**Scientific Committee:** [Kenichi Aoki (Meiji University)](https://sites.google.com/site/kenichi1aoki/home), [Yasuo Ihara (the University of Tokyo)](https://researchmap.jp/read0209180?lang=en), [Hiromi Matsumae (Tokai University)](https://sites.google.com/site/hiromimatsumae/eng), [Naoko Matsumoto (Okayama University)](https://researchmap.jp/nmatsumoto_okayama-u), [Masako Myowa (Kyoto University)](https://myowa.educ.kyoto-u.ac.jp/en), [Hisashi Nakao (Nanzan University)](https://www.hisashinakao.com/), [Patrick E. Savage (Keio University)](https://sites.google.com/view/comp-music-lab/home)

**Local Organizing Committee:** [Yutaka Horita (Teikyo University)](https://sites.google.com/site/yhoritapage/), [Masanori Takezawa (Hokkaido University)](https://lalalarakko.github.io/), [Ayaka Takimoto (Hokkaido University)](https://lynx.let.hokudai.ac.jp/~takimoto/), [Kohei Tamura (Tohoku University)](https://researchmap.jp/7000017854)

**Inclusiveness Committee:** [Sarah Mathew (Arizona State University)](https://www.sarahmathew.net/), [Hiromi Matsumae (Tokai University)](https://sites.google.com/site/hiromimatsumae/eng), [Patrick E. Savage (Keio University)](https://sites.google.com/view/comp-music-lab/home)


![](https://assets.underline.io/uploads/markdown_image/1/image/967110a00d200a6b20d6f4fa6556ba13.png)

For attending the conference, you first need to register and pay fees from [the link here](https://www.chain.hokudai.ac.jp/CES2020/registration/). After the payment of the registration fees, you will receive a ticket, which is necessary for accessing the conference site. After the payment of the registration fees, you will receive a ticket, which is necessary for accessing the conference site

Registration fee

Cultural Evolution Society 2021

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

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.

Microbribery in Group Identification

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

Downloads

Next from AAMAS 2020

Microbribery in Group Identification

Similar lecture

Silly rules enhance learning of compliance and enforcement behavior in artificial agents

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

.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

Microbribery in Group Identification

Similar lecture

Silly rules enhance learning of compliance and enforcement behavior in artificial agents

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads