New Zealand


The use of norms to guide and coordinate interactions has gained tremendous attention in the multiagent community. However, as the interest moves towards dynamic socio-technical systems, where human and software agents interact and interactions are required to adapt to the human&#39;s changing needs, new challenges arise. For instance, different agents (human or software) might not have the same understanding of what it means to violate a norm (e.g., what characterizes hate speech), or that their understanding of a norm might change over time (e.g., what constitutes an acceptable response time). The challenge is to address these issues by learning the meaning of a norm violation from the limited interaction data. For this, we propose a framework that learns and updates the meaning of a norm violation from interaction data through a combination of ensemble and incremental learning techniques. Ensemble learning handles the imbalance class distribution of the interaction stream, and incremental learning is used to continuously update the ensemble models as community members interact, which is an essential feature to keep the ensemble models in accordance with the latest community view on the meaning of norm violation. We evaluate the proposed approach in the use case of Wikipedia article edits, where interactions revolve around editing articles and the norm in question is prohibiting vandalism. Results show that the proposed framework can learn the meaning of a norm violation in a setting with data imbalance and concept drift.

AAMAS 2022

Ensemble and Incremental Learning for Norm Violation Detection

norm violation

concept drift

ensemble learning

imbalanced dataset

incremental learning

### Welcome to IJCNLP-AACL 2025! 
 It is a great honor to host this joint conference in Mumbai, India, from December 20 to 24, 2025. The joint conferences of IJCNLP and AACL are organized with alternating leadership in the Asia-Pacific region. The event is run by the Asian Federation of Natural Language Processing (AFNLP) in odd years, and by AACL in even years, while it is organized solely by ACL when the annual ACL meeting is held in the region. This year, the conference is primarily organized by AFNLP. 
*Kentaro Inui
MBZUAI, UAE
General Chair, IJCNLP-AACL 2025* 
Read full message and download the Conference Handbook [**here**](https://drive.google.com/file/d/1UTwxkAqSqI-GAoJC3wE1zZt5VP1Y8GX0/view?usp=sharing).

IJCNLP-AACL 2025

The 14th IJCNLP & 4th AACL will be held in Mumbai, India from December 20th to December 24th, 2025.


The use of norms to guide and coordinate interactions has gained tremendous attention in the multiagent community. However, as the interest moves towards dynamic socio-technical systems, where human and software agents interact and interactions are required to adapt to the human's changing needs, new challenges arise. For instance, different agents (human or software) might not have the same understanding of what it means to violate a norm (e.g., what characterizes hate speech), or that their understanding of a norm might change over time (e.g., what constitutes an acceptable response time). The challenge is to address these issues by learning the meaning of a norm violation from the limited interaction data. For this, we propose a framework that learns and updates the meaning of a norm violation from interaction data through a combination of ensemble and incremental learning techniques. Ensemble learning handles the imbalance class distribution of the interaction stream, and incremental learning is used to continuously update the ensemble models as community members interact, which is an essential feature to keep the ensemble models in accordance with the latest community view on the meaning of norm violation. We evaluate the proposed approach in the use case of Wikipedia article edits, where interactions revolve around editing articles and the norm in question is prohibiting vandalism. Results show that the proposed framework can learn the meaning of a norm violation in a setting with data imbalance and concept drift.

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

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


The evolving relationship between humans and technology entails increasing concerns about the impact on ethical issues such as bias, unfairness, and lack of accountability. There is thus a need for consistent responses to multiple-user social dilemma that arise during interactions in sociotechnical systems, where combinations of humans and technical agents work together as ethical duos. The outcomes of these systems can be evaluated by the values that participating humans hold, which in turn influence the development of norms used to guide acceptable behaviour. However, when values are misjudged or norms conflict, systematic methodologies are needed to resolve the dilemmas that arise in satisfactory ways.

Adapting a macro-ethics perspective, in which ethics is addressed through the governance of sociotechnical systems with multiple agents rather than the actions of single agents, we propose that ethical principles can be mechanised in a way that considers a variety of contextual inputs to produce a satisfactory outcome. The application of these ethical principles would enable practitioners to think analytically and systematically about the multiple-user social dilemmas that occur in these systems to resolve them in satisfactory ways. In order to achieve this, we need to formulate new ways of (1) developing consistent responses to multiple-user social dilemmas, (2) categorizing ethical principles used in AI, and (3) systematically operationalizing ethical principles.

Macro Ethics for Governing Equitable Sociotechnical Systems


We develop a learning-based algorithm for the distributed formation control of networked multi-agent systems governed by unknown, nonlinear dynamics. The proposed algorithm integrates neural network-based learning with adaptive control in a two-step procedure. In the first step, each agent learns a controller, represented as a neural network, using training data that correspond to a collection of formation tasks and agent parameters. These parameters and tasks are derived by varying the nominal agent parameters and the formation specifications of the task in hand, respectively. In the second step of the algorithm, each agent incorporates the
trained neural network into an online and adaptive control policy in such a way that the behavior of the multi-agent closed-loop system satisfies a user-defined formation task. Both the learning phase and the adaptive control policy are distributed, in the sense that each agent computes its own actions using only local information from its neighboring agents.

Non-Parametric Neuro-Adaptive Coordination of Multi-Agent Systems

This paper tackles the problem of learning generalizable congestion-mitigation strategies in simple representations of traffic. In particular, we look to mixed-autonomy ring roads as depictions of instabilities common to many generic settings, and ask the question: What features are needed to ensure that policies here can be adapted to typical multi-lane highways? To answer this, we study the implications of the scale of the source task and the modeling of pseudo-lane change events within it on the transferability of policies learned to complex networks. Our findings suggest that negating the effects of boundary conditions and introducing lane changes that approximately match trends in more complex systems can significantly improve the generalizability of learned behaviors.

Learning Generalizable Multi-Lane Mixed Autonomy Control Strategies in Single-Lane Settings


The Belief Desire Intention model is a widely used architecture for
developing rational agents. Because of its expressiveness, the task
of programming a BDI agent can be challenging, especially when
applied to safety-critical scenarios. In such scenarios, it is important
to provide a safeguard for the critical behaviour of the agent. In this
poster, we summarise how to extend the agent’s reasoning cycle
in the BDI model with safety shields. A safety shield works as a
sandbox for the agents’ plans that is enforced at runtime so that the
agent behaves according to a safety formal specification. A runtime
monitor is automatically synthesised from a shield to detect any
failure that is within the scope of the shielded plan.

Safety Shields, an Automated Failure Handling Mechanism for BDI Agents

We introduce the Forecasting Argumentation Framework (FAF), a novel argumentation framework for forecasting informed by recent judgmental forecasting research. FAFs comprise update frameworks which empower (human or artificial) agents to argue over time with and about probability of scenarios, whilst flagging perceived irrationality in their behaviour with a view to improving their forecasting accuracy. FAFs include three argument types with future forecasts and aggregate the strength of these arguments to inform estimates of the likelihood of scenarios. We provide an example of an implementation of FAFs for supporting forecasting agents.

Argumentative Forecasting


In sequential multi-objective decision making (MODeM) settings, when the utility of a user is derived from a single execution of a policy, policies for the expected scalarised returns (ESR) criterion should be computed. In multi-objective settings, a user's preferences over objectives, or utility function, may be unknown at the time of planning. When the utility function of a user is unknown, multi-policy methods are deployed to compute a set of optimal policies. However, the state-of-the-art sequential MODeM multi-policy algorithms compute a set of optimal policies for the scalarised expected returns (SER) criterion. Algorithms that compute a set of optimal policies for the SER criterion utilise expected value vectors which cannot be used when optimising for the ESR criterion. We propose multi-objective distributional value iteration (MODVI) that replaces value vectors with distributions over the returns and computes a set of optimal policies for the ESR criterion.

Decision-Theoretic Planning for the Expected Scalarised Returns

In adversarial patrolling games, a mobile Defender strives to discover intrusions at vulnerable targets initiated by an Attacker.
The Attacker's utility is traditionally defined as the probability of completing an attack, possibly weighted by target costs.
However, in many real-world scenarios, the actual damage caused by the Attacker depends on the time elapsed since the attack's initiation to its detection.
We introduce a formal model for such scenarios, and we show that the Defender always has an optimal strategy achieving maximal protection.
We also prove that finite-memory Defender's strategies are sufficient for achieving protection arbitrarily close to the optimum.
Then, we design an efficient strategy synthesis algorithm based on differentiable programming and gradient descent.
We evaluate the efficiency of our method experimentally.

Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

We consider the computational problem of partitioning items into bundles among alternatives to maximize social welfare. Unfortunately, many important classes of this problem are computationally hard, including well-known instances in the multi-agent systems literature. We analyze novel concise representations and restrictions that admit polynomial-time algorithms for many such combinatorial assignment problems, and prove several complexity results for them. We provide efficient approximation algorithms and non-trivial exponential-time algorithms for the hard cases.

Concise Representations and Complexity of Combinatorial Assignment Problems

We consider the popular Partially Observable Monte-Carlo Planning (POMCP) algorithm and propose a methodology, called Active XPOMCP, for generating compact logical rules that represent properties of the control policy.
These rules are then used as shields to prevent POMCP from selecting unexpected actions, with useful implications on the security and trustworthiness of the algorithm.
Contrary to state-of-the-art methods, Active XPOMCP does not require a previously generated set of belief-action pairs to generate the logical rule, but it actively generates this data in an information-efficient way by querying the algorithm.
Active XPOMCP reduces the number of beliefs needed to generate accurate rules with respect to state-of-the-art methods, and it allows to produce more accurate shields when few belief-action samples are available.

Active Generation of Logical Rules for POMCP Shielding


We study the problem of fair allocation of a set of indivisible items among agents with additive valuations, under cardinality constraints. In this setting, the items are partitioned into categories, each with its own limit on the number of items it may contribute to any bundle. We consider the fairness measure known as the maximin share (MMS) guarantee and propose a novel polynomial-time algorithm for finding 1/2-approximate MMS allocations–an improvement from the previously best available guarantee of 11/30.

Downloads

Next from AAMAS 2022

Macro Ethics for Governing Equitable Sociotechnical Systems

Similar lecture

MINDS: A Cross-Cultural Dialogue Corpus for Social Norm Classification and Adherence Detection

Stay up to date with the latest Underline news!

PRODUCT

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 2022

Macro Ethics for Governing Equitable Sociotechnical Systems

Similar lecture

MINDS: A Cross-Cultural Dialogue Corpus for Social Norm Classification and Adherence Detection

Stay up to date with the latest Underline news!

PRODUCT

COMPANY

RESOURCES

Downloads