New Zealand


Agents have been used for simulating cultural evolution and cultural evolution can be used as a model for artificial agents. Previous results have shown that horizontal, or intra-generation, knowledge transmission allows agents to improve the quality of their knowledge to a certain level. Moreover, variation generated through vertical, or inter-generation, transmission allows agents to exceed that level. Such results have been obtained under specific conditions such as the drastic selection of agents allowed to transmit their knowledge, seeding the process with correct knowledge or introducing artificial noise during transmission. Here, we question the necessity of such measures and study their impact on the quality of transmitted knowledge. For that purpose, we combine the settings of two previous experiments and we relax these assumptions (no strong selection of teachers, no fully correct seed, no introduction of artificial noise). The rationale is that if interactions lead agents to improve their overall knowledge quality, this should be sufficient to ensure correct knowledge transmission, and that transmission mechanisms are sufficiently imperfect to produce variation. In this setting, we confirm that vertical transmission improves on horizontal transmission even without drastic selection and oriented learning. We also show that horizontal transmission is able to compensate for the lack of parent selection if it is maintained for long enough. This shows that it is not necessary to take the most successful agents as teachers, neither in vertical nor horizontal transmission, to cumulatively improve knowledge.

AAMAS 2022

Knowledge Transmission and Improvement Across Generations do not Need Strong Selection

cultural knowledge evolution

agent generation

knowledge transmission

multi-agent social simulation

cultural evolution

### Welcome to the fourth Cultural Evolution Society Conference, CES2022! 

As last year, Underline will support the online component of the conference. The ongoing COVID-19 pandemic is causing a great deal of uncertainty for all of us. Therefore, we seek to offer a hybrid format that will hopefully allow some folks to travel to Aarhus, others to meet up locally or regionally in CES hub-lets, and other yet to participate online. The field of cultural evolution is growing in size and scope; its theories, methods and applications - both academic and applied - are getting ever more robust. Do join us in what promises to be an exciting exchange of ideas and a celebration of our field.

##### ***For SoMe interaction and live tweeting please tag @CulturalEvolSoc and use #CESconf2022***


#### The CES 2022 local organising committee
* Luseadra Joy McKerracher
* Jesper Sørensen 
* Niels Nørkjær Johannsen 
* Benjamin Grant Purzycki 
* Mette Løvschal 
* Felix Riede
* Iza Romanowska 
* Karsten Olsen 
<br><br>

Please click on the button bellow if you want to watch the videos

Cultural Evolution Society 2022

The field of cultural evolution is growing in size and scope; its theories, methods and applications - both academic and applied - are getting ever more robust. Do join us in what promises to be an exciting exchange of ideas and a celebration of our field.

technical paper

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems. AAMAS is the flagship conference of the non-profit International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

The AAMAS conference series was initiated in 2002 in Bologna, Italy as a joint event comprising the 6th International Conference on Autonomous Agents (AA), the 5th International Conference on Multiagent Systems (ICMAS), and the 9th International Workshop on Agent Theories, Architectures, and Languages (ATAL).

Subsequent AAMAS conferences have been held in Melbourne, Australia (July 2003), New York City, NY, USA (July 2004), Utrecht, The Netherlands (July 2005), Hakodate, Japan (May 2006), Honolulu, Hawaii, USA (May 2007), Estoril, Portugal (May 2008), Budapest, Hungary (May 2009), Toronto, Canada (May 2010), Taipei, Taiwan (May 2011), Valencia, Spain (June 2012), Minnesota, USA (May 2013), Paris, France (May 2014), Istanbul, Turkey (May 2015), Singapore (May 2016), São Paulo (2017) and Stockholm, Sweden (2018), Montreal (May 2019), Auckland (May 2020, Virtual), London (May 2021, Virtual).
<br>
<br>



A ticket is required to attend this event, please register using the link below:

https://aamas2022-conference.auckland.ac.nz/attending/registration/

Registration Is Required

AAMAS (International Conference on Autonomous Agents and Multiagent Systems) is the largest and most influential conference in the area of agents and multiagent systems. The aim of the conference is to bring together researchers and practitioners in all areas of agent technology and to provide a single, high-profile, internationally renowned forum for research in the theory and practice of autonomous agents and multiagent systems. AAMAS is the flagship conference of the non-profit International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).


Ants have evolved to seek and retrieve food by leaving trails of pheromones. This mechanism has inspired several approaches to decentralized multi-robot coordination. However, in this paper, we show that pheromone trails are a fragile mechanism for coordination, and can be sabotaged to starve the colony. We introduce detractors: malicious agents that leave a misleading, but indistinguishable, trail of food pheromone to distract and trap cooperator ants in the nest. We analyze the effectiveness of detractors with respect to parameters such as evaporation rate of misleading pheromone and fraction of detractors in the colony. In addition, we propose a countermeasure to this attack by introducing a new type of pheromone: the cautionary pheromone. Cooperator ants secrete this type of pheromone atop existing food trails as a warning. When the cautionary pheromone intensity exceeds the food pheromone intensity, cooperator ants ignore overlapping food pheromone. We show that, despite its simplicity, this defense mechanism can limit, but not nullify, the effect of detractors. Ultimately, our work shows that pheromone-based coordination, while effective, is also fragile.

Hacking the Colony: On the Disruptive Effect of Misleading Pheromone and How to Defend against It


The trustors in a reputation system share trust-relevant information amongst themselves about trustees. 
If there is lag present in the sharing mechanism, a malicious trustee can exploit it to perform additional bad actions that would not be permitted otherwise. 
This is the reputation lag attack. 
In this paper, we use a simulation model to explore properties of the reputation lag attack, attack strategies which improve the attacker's success and factors which mitigate the attacker. 
In particular, we demonstrate the following key findings: 
Attackers in lagged systems clearly outperform attackers in lag-free systems.
The attacker's success is proportional to their rate of action until a plateau at the maximum number of bad actions. 
Attackers which wait for their good reputation to disseminate outperform those who do not. 
Attackers which perform only good actions, wait for dissemination and then perform only bad actions outperform attackers who do not follow such an ordering.
Using centrality metrics to target users improves the attacker's performance.
Temporarily avoiding users that reject them will improve the attacker's performance.
Putting a time-decay on the information value of a message will worsen an ordered attacker.
A network with a homogeneous structure will worsen the performance of a centrality-targetting attacker.
To summarize, we demonstrate not only the viability of the reputation lag attack in our model but also the presence of strategies that both aid and mitigate the attacker.

Properties of Reputation Lag Attack Strategies


A classical problem in the fair allocation literature is finding an envy-free assignment of indivisible resources to agents with additive utility-based preferences over resources. Motivated by the possible non-existence but evident need of envy-free allocations in some applications, we study the following problem modeling one possible way out: Given an allocation of indivisible resources to agents, is it possible to socially donate some of the resources (which means removing these resources from the allocation instance) such that the resulting modified allocation is envy-free (up to one good). We require that the number of deleted resources and/or the caused utilitarian welfare loss of the allocation are bounded. We conduct a thorough study of the (parameterized) computational complexity of this problem considering various natural and problem-specific parameters (e.g., the number of agents, the number of deleted resources, or the maximum number of resources assigned to an agent in the initial allocation) and different preference models, including unary and 0/1-valuations. In our studies, we obtain a rich set of (parameterized) tractability and intractability results and discover several surprising contrasts, for instance, between the two closely related fairness concepts envy-freeness and envy-freeness up to one good and between the influence of the parameters maximum number and welfare of the deleted resources.

Multivariate Algorithmics for Eliminating Envy by Donating Goods


The notion of envy-freeness is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guaranteed to exist. Classical works have avoided this issue by introducing an additional divisible resource, i.e., money, to subsidize envious agents. In this paper, we aim to design a truthful allocation mechanism of indivisible goods to achieve both fairness and efficiency criteria with a limited amount of subsidy. Following the work of Halpern and Shah, our central question is as follows: to what extent do we need to rely on the power of money to accomplish these objectives? We show that, when agents have matroidal valuations, there is a truthful allocation mechanism that achieves envy-freeness and utilitarian optimality by subsidizing each agent with at most 1, the maximum marginal contribution of each item for each agent. The design of the mechanism rests crucially on the underlying matroidal M-convexity of the Lorenz dominating allocations. For superadditive valuations, we show that there is a truthful mechanism that achieves envy-freeness and utilitarian optimality, with each agent receiving a subsidy of at most m; furthermore, we show that the amount m is necessary even when agents have additive valuations.

Fair and Truthful Mechanism with Limited Subsidy


We study the problem of fairly allocating a set of $m$ indivisible chores (i.e. items with non-positive value) to $n$ agents. We consider the desirable fairness notion of $1$-out-of-$d$ maximin share (MMS)---the minimum value that an agent can guarantee by partitioning items into $d$ bundles and selecting the least valued bundle---and focus on ordinal approximation of MMS that aims at finding the largest $d$ for which $1$-out-of-$d$ MMS exists. Our main theoretical contribution is showing the existence of $1$-out-of-$\lfloor\frac{3n}{4}\rfloor$ MMS allocations and proving that $1$-out-of-$\lfloor\frac{2n}{3}\rfloor$ MMS allocations of chores can be computed in polynomial time. Furthermore, we show that practical polynomial-time algorithms exist for approximating $1$-out-of-$\lfloor\frac{3n}{4}\rfloor$ MMS bound for chores. This is in contrast to computing allocations that guarantee a fraction of MMS to each agent, where only a polynomial-time approximation scheme (PTAS) with run-time exponential in the approximation accuracy $1/\epsilon$ is known.

Ordinal Maximin Share Approximation for Chores


The problem of fair division known as ``cake cutting'' has been the focus of multiple papers spanning several decades. The most prominent problem in this line of work has been to bound the query complexity of computing an envy-free outcome in the Robertson-Webb query model. However, the root of this problem's complexity is somewhat artificial: the agents' values are assumed to be additive across different pieces of the ``cake'' but infinitely complicated within each piece. This is unrealistic in most of the motivating examples, where the cake represents a finite collection of homogeneous goods. 

We address this issue by introducing a fair division model that more accurately captures these applications: the value that an agent gains from a given good depends only on the amount of the good they receive, yet it can be an arbitrary function of this amount, allowing the agents to express preferences that go beyond standard cake cutting. In this model, we study the query complexity of computing allocations that are not just envy-free, but also approximately Pareto optimal among all envy-free allocations. Using a novel flow-based approach, we show that we can encode the ex-post feasibility of randomized allocations via a polynomial number of constraints, which reduces our problem to solving a linear program.

Beyond Cake Cutting: Allocating Homogeneous Divisible Goods


Autonomous shepherding is a bio-inspired swarm guidance approach, whereby an artificial sheepdog guides a swarm of artificial or biological agents, such as sheep, towards a goal. While the success in this guidance depends on the set of behaviours exhibited by the sheepdog, the main source of complexity for learning effective behaviours lies within the highly non-linear dynamics featured among the swarm members as well as between the swarm and the sheepdog. 
Attempts to apply reinforcement learning (RL) to shepherding have so far relied greatly on rule-based algorithms for calculating waypoints to guide the RL algorithm. In this paper, we propose a curriculum-based approach for RL that does not rely on any external algorithm to pre-determine waypoints for the sheepdog. Instead, the approach uses task decomposition by formulating shepherding in terms of two sub-tasks: (1) pushing an agent from a start to a target location and (2) selecting between collecting scattered agents or driving the biggest cluster of agents to the goal. Simple-to-complex curriculum learning is used to accelerate the learning of each sub-task. For the first sub-task, the complexity is gradually increased over training time, whereas for the second sub-task a simplified environment is designed for initial learning before proceeding with the main environment. 
The proposed approach results in high-performance shepherding with a success rate of about 96\%. While curriculum learning was found to expedite the learning of the first sub-task, it was not as efficient for the second sub-task. Our analyses highlight the need for the careful design of the curriculum to ensure that skills acquired in intermediate tasks are useful for the main tasks.

Autonomous Swarm Shepherding Using Curriculum-Based Reinforcement Learning


This paper presents a hybrid online Partially Observable Markov Decision Process (POMDP) planning system that addresses the problem of autonomous navigation in the presence of complex, multi-modal uncertainties introduced by other agents in the environment. As a particular example, we consider the problem of autonomous navigation in dense crowds of pedestrians and among obstacles. A popular previous approach first generates a path using ad-hoc assumptions about uncertainty and then uses an online tree-based POMDP planning algorithm that reasons about uncertainty to control a very limited aspect of the problem (i.e. speed along the path). We advocate a more general alternative approach in which the tree-based POMDP planner has control over all degrees of freedom (i.e. speed and heading for this autonomous navigation problem). Since this modification greatly extends the region of the state space that the POMDP planner reasons over, an important challenge is finding effective roll-out policies within the limited computational budget. Our key insight is to use multi-query motion planning techniques (e.g., Probabilistic Roadmaps or Fast Marching Method) that generate efficient roll-out policies for every state that the POMDP planning tree might reach during its limited horizon search. Our proposed approach generates trajectories that are safe and significantly more efficient than the previous approach, even in densely crowded dynamic environments with long planning horizons.

Intention-Aware Navigation in Crowds with Extended-Space POMDP Planning


Robots learning from observations in the real world using inverse reinforcement learning (IRL) may encounter objects or agents in the environment, other than the expert, that cause nuisance observations during the demonstration. These confounding elements are typically removed in fully-controlled environments such as virtual simulations or lab settings. When complete removal is impossible the nuisance observations must be filtered out. However, identifying the source of observations when large amounts of observations are made is difficult. To address this, we present a hierarchical Bayesian process that models both the expert's and the confounding elements' observations thereby explicitly modeling the diverse observations a robot may receive. We extend an existing IRL algorithm originally designed to work under partial occlusion of the expert to consider the diverse and noisy observations. In a simulated robotic sorting domain containing both occlusion and confounding elements, we demonstrate the model's effectiveness. In particular, our technique outperforms several other comparative methods, second only to having perfect knowledge of the subject's trajectory.

A Hierarchical Bayesian Process for Inverse RL in Partially-Controlled Environments


Sampling-based motion planners such as RRT* and BIT*, when applied to kinodynamic motion planning, rely on steering functions to generate time-optimal solutions connecting sampled states. Implementing exact steering functions requires either analytical solutions to the time-optimal control problem, or nonlinear programming (NLP) solvers to solve the boundary value problem given the system's kinodynamic equations. Unfortunately, analytical solutions are unavailable for many real-world domains, and NLP solvers are prohibitively computationally expensive, hence fast and optimal kinodynamic motion planning remains an open problem. We provide a solution to this problem by introducing State Supervised Steering Function (S3F), a novel approach to learn time-optimal steering functions. S3F is able to produce near-optimal solutions to the steering function orders of magnitude faster than its NLP counterpart. Experiments conducted on three challenging robot domains show that RRT* using S3F significantly outperforms state-of-the-art planning approaches on both solution cost and runtime. We further provide a proof of probabilistic completeness of RRT* modified to use S3F.

Downloads

Next from AAMAS 2022

Hacking the Colony: On the Disruptive Effect of Misleading Pheromone and How to Defend against It

Similar lecture

Inter-generation knowledge transmission without individual selection

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

Hacking the Colony: On the Disruptive Effect of Misleading Pheromone and How to Defend against It

Similar lecture

Inter-generation knowledge transmission without individual selection

Downloads