New Zealand


In this work, we give an operational semantics for speech acts that BDI agents can use to communicate enthymemes. The approach uses argumentation schemes as common organisational knowledge to guide the construction of enthymemes by the proponents of arguments. Such schemes are also used to guide the reconstruction of the intended argument by the recipients of such enthymemes.

AAMAS 2022

Towards an Enthymeme-Based Communication Framework

enthymemes

multi-agent systems

argumentation

The 9th Brazilian Conference on Intelligent Systems (BRACIS), the 16h Encontro Nacional de Inteligência Artificial e Computacional (ENIAC), and the 12th Concurso de Teses e Dissertações em Inteligência Artificial e Computacional (CTDIAC) was held from 20 to 23 October, 2020.

BRACIS originated from the combination of the two most important scientific events in Brazil in Artificial Intelligence (AI) and Computational Intelligence (CI): the Brazilian Symposium on Artificial Intelligence - SBIA (22 editions), and the Brazilian Symposium on Neural Networks - SBRN (13 editions). ENIAC is a national forum for researchers, practitioners, educators and students to present and discuss innovations, trends, experiences, developments and work in progress in the fields of Artificial and Computational Intelligence. CTDIAC is a satellite event whose goals are to disseminate and award the best dissertations and theses (MSc and PhDs concluded in Brazilian universities from June 2018 to May 2020) in Artificial and Computational Intelligence areas.

In this year, the Symposium on Knowledge Discovery, Mining and Learning (KDMiLe) will be held in conjunction with BRACIS 2020. This sysposium aims at integrating researchers, practitioners, developers, students and users to present their research results, to discuss ideas, and to exchange techniques, tools, and practical experiences – related to the Data Mining and Machine Learning areas.

BRACIS 2020

poster

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


We consider average-based and min-based altruistic hedonic games and study the problem of verifying popular and strictly popular coalition structures. While strict popularity verification has been shown to be coNP-complete in min-based altruistic hedonic games, this problem has been open for equal-treatment and altruistic-treatment average-based altruistic hedonic games. We solve these two open cases of strict popularity verification and then provide the first complexity results for popularity verification in (both average- and min-based) altruistic hedonic games, where we cover all three degrees of altruism.

Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games

**Read paper on the following link:**

https://ifaamas.org/Proceedings/aamas2022/pdfs/p1551.pdf

**Abstract:**



Contrastive Explanations for Argumentation-Based Conclusions


In many practical applications, we often need to form a team of agents to solve a task, since no agent alone has the full set of required competences or the power to complete the task on time. Here, we address the problem of distributing individuals in teams, with each team being in charge of a specific task. In particular, we formalise the problem and propose a heuristic approach to solve it.

An anytime heuristic algorithm for allocating many teams to many tasks


Call centers, in which human operators attend clients using textual chat, are very common in modern e-commerce. Training enough skilled operators who are able to provide good service is a challenge. We propose a methodology for the development of an assisting agent that provides online advice to operators while they attend clients. The agent is easy-to-build and can be introduced to new domains without major effort in design, training and organizing structured knowledge of the professional discipline. We demonstrate the applicability of the system in an experiment that realizes its full life-cycle on a specific domain, and analyze its capabilities.

Advising Agent for Service-Providing Live-Chat Operators


In this paper we put forward a novel extension of the classic Max-sum algorithm to the framework of Continuous Distributed Constrained Optimization Problems (Continuous DCOPs), in which we model the exchanged messages by means of a popular geometric algorithm, Quadtrees. As such, the discretization process is dynamic and embedded in the internal Max-sum operations (addition and marginal maximization). We apply our Max-sum with Quadtrees approach to Lane-Free Autonomous Driving in a highway populated with vehicles. Our experimental evaluation verifies the efficiency of our approach in this challenging dynamic coordination domain, demonstrating its superior performance with respect to the standard Max-sum algorithm.

Max-sum with Quadtrees for Continuous DCOPs with Application to Lane-Free Autonomous Driving

For autonomous agents to successfully perform in open hybrid scenarios (with people and agents), they need to adapt to different social contexts. 
Simultaneously, the people involved must understand the observed changes in the agents, particularly to identify the social motivations for such behavior.
In this paper, we report an experimental study conducted to assess if an agent's behavioral changes (gait), are perceived as more socially motivated than its appearance adaptations (color). Furthermore, we explore if other agents' presence and behavior affect the attribution of motivations.
Our findings suggest that external observers identify agents' appearance adaptations as more socially and spatially motivated than behavioral changes. Furthermore, the agents' awareness is rated higher when the agents adjust their physical characteristics compared to behavioral adaptations.

Behavior vs Appearance: what type of adaptations are more socially motivated?


Round-robin tournaments are, besides single-elimination tournaments, by far the most prominent and widely used tournament format in sports and other competitions. We study the average-case complexity of two problems related to the prediction of roundrobin tournaments, namely first the problem of calculating the championship probability of a team and second the well-known sports elimination problem where one has to decide whether a team still has the possibility to become champion. We show that, under certain assumptions, these problems are solvable in expected polynomial time for a distribution which, for the algorithm used, seems to dominate the distribution of real instances in terms of complexity, despite their computational worst-case hardness.

On the Average-Case Complexity of Predicting Round-Robin Tournaments


Gale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both improve their utility by forming a new pair. They proved, algorithmically, the existence of a stable matching. Shapley and Shubik, Demange and Gale, and many others extended the model by allowing monetary transfers. We offer a further extension by assuming that matched couples obtain their payoff endogenously as the outcome of a strategic game they have to play in a usual non-cooperative sense (without commitment) or in a semi-cooperative way (with commitment, as the outcome of a bilateral binding contract in which each player is responsible for his/her part of the contract). Depending on whether the players can commit or not, we define in each case a solution concept that combines Gale-Shapley pairwise stability with a (generalized) Nash equilibrium stability. In each case, we give the necessary and sufficient conditions for the set of stable allocations to be non-empty, we study its lattice structure, and provide an algorithm that converges to its maximal element. Finally, we prove that our second model -with commitment- encompasses and refines most of the literature.

Stable Matching Games


In settings without well-defined goals, methods for reward learning
allow reinforcement learning agents to infer goals from human
feedback. Existing work has discussed the problem that such agents
may manipulate humans, or the reward learning process, in order
to gain higher reward. We introduce the neglected problem that, in
multi-agent settings, agents may have incentives to manipulate one
another’s reward functions in order to change each other’s behav-
ioral policies. We focus on the setting with humans acting alongside
assistive (artificial) agents who must learn the reward function by
interacting with these humans. We propose a possible solution to
manipulation of human feedback in this setting: the Shared Value
Prior (SVP). The SVP equips agents with an assumption that the
reward functions of all humans are similar. Given this assumption,
the actions of any human provide information to an agent about
its reward, and so the agent is incentivised to observe these actions
rather than to manipulate them. We present an expository example
in which the SVP prevents manipulation.

On Agent Incentives to Manipulate Human Feedback in Multi-Agent Reward Learning Scenarios


In this work we propose a concept for the real-world implementation of traffic light (TL) optimization by reinforcement learning (RL). This is achieved by combining RL with state-of-the-art traffic theory and real-world control and perception methods.

Towards an Enthymeme-Based Communication Framework

Downloads

Next from AAMAS 2022

Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games

Similar lecture

AgentDevLaw: A Middleware Architecture for Integrating Legal Ontologies and Multi-Agent Systems

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Towards an Enthymeme-Based Communication Framework

.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

Popularity and Strict Popularity in Altruistic Hedonic Games and Minimum-Based Altruistic Hedonic Games

Similar lecture

AgentDevLaw: A Middleware Architecture for Integrating Legal Ontologies and Multi-Agent Systems

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads