The awareness about healthy lifestyles is increasing, opening to personalized intelligent health coaching applications. A demand for more than mere suggestions and mechanistic interactions has driven attention to nutrition virtual coaching systems (NVC) as a bridge between human–machine interaction and recommender, informative, persuasive, and argumentation systems. NVC can rely on data-driven opaque mechanisms. Therefore, it is crucial to enable NVC to explain their doing (i.e., engaging the user in discussions (via arguments) about dietary solutions/alternatives). By doing so, transparency, user acceptance, and engagement are expected to be boosted. This study focuses on NVC agents generating personalized food recommendations based on user-specific factors such as allergies, eating habits, lifestyles, and ingredient preferences. In particular, we propose a user-agent negotiation process entailing run-time feedback mechanisms to react to both recommendations and related explanations. Lastly, the study presents the findings obtained by the experiments conducted with multi-background participants to evaluate the acceptability and effectiveness of the proposed system. The results indicate that most participants value the opportunity to provide feedback and receive explanations for recommendations. Additionally, the users are fond of receiving information tailored to their needs. Furthermore, our interactive recommendation system performed better than the corresponding traditional recommendation system in terms of effectiveness regarding the number of agreements and rounds.

This paper introduces a negotiation framework to solve the Multi-Agent Path Finding (MAPF) Problem for self-interested agents in a decentralized fashion. The framework aims to achieve a good trade-off between the privacy of the agents and the effectiveness of solutions. Accordingly, a token-based bilateral negotiation protocol and two negotiation strategies are presented. The experimental results over four different settings of the MAPF problem show that the proposed approach could find conflict-free path solutions albeit suboptimally, especially when the search space is large and high-density. In contrast, Explicit Estimation Conflict-Based Search (EECBS) struggles to find optimal solutions. Besides, deploying a sophisticated negotiation strategy that utilizes information about local density for generating alternative paths can yield remarkably better solution performance in this negotiation framework.

Existing agent-based chatbot frameworks need seamless mechanisms to include explainable dialogic engines within the contextual flow. To this end, this paper presents a set of novel modules within the EREBOTS agent-based framework for chatbot development, including dialog-based plug-and-play custom algorithms, agnostic back/front ends, and embedded interactive explainable engines that can manage human feedback at run time. The framework has been employed to implement an explainable agent-based interactive food recommender system. The latter has been tested with 44 participants, who followed a nutrition recommendation interaction series, generating explained recommendations and suggestions, which were, in general, well received. Additionally, the participants provided important insights to be included in future work.

As recommendation systems become increasingly prevalent in numerous fields, the need for clear and persuasive interactions with users is rising. Integrating explainability into these systems is emerging as an effective approach to enhance user trust and sociability. This research focuses on recommendation systems that utilize a range of explainability techniques to foster trust by providing understandable personalized explanations for the recommendations made. In line with this, we study three distinct explanation methods that correspond with three basic recommendation strategies and assess their efficacy through user experiments. The findings from the experiments indicate that the majority of participants value the suggested explanation styles and favor straightforward, concise explanations over comparative ones.

By examining the patterns of solutions obtained for various instances, one can gain insights into the structure and behavior of combinatorial optimization (CO) problems and develop efficient algorithms for solving them. Machine learning techniques, especially Graph Neural Networks (GNNs), have shown promise in parametrizing and automating this laborious design process. The inductive bias of GNNs allows for learning solutions to mixed-integer programming (MIP) formulations of constrained CO problems with a relational representation of decision variables and constraints. The trained GNNs can be leveraged with primal heuristics to construct high-quality feasible solutions to CO problems quickly. However, current GNN-based end-to-end learning approaches have limitations for scalable training and generalization on larger-scale instances; therefore, they have been mostly evaluated over small-scale instances. Addressing this issue, our study builds on supervised learning of optimal solutions to the downscaled instances of given large-scale CO problems. We introduce several improvements on a recent GNN model for CO to generalize on instances of a larger scale than those used in training. We also propose a two-stage primal heuristic strategy based on uncertainty-quantification to automatically configure how solution search relies on the predicted decision values. Our models can generalize on 16x upscaled instances of commonly benchmarked five CO problems. Unlike the regressive performance of existing GNN-based CO approaches as the scale of problems increases, the CO pipelines using our models offer an incremental performance improvement relative to CPLEX. The proposed uncertainty-based primal heuristics provide 6-75% better optimality gap values and 45-99% better primal gap values for the 16x upscaled instances and brings immense speedup to obtain high-quality solutions. All these gains are achieved through a computationally efficient modeling approach without sacrificing solution quality.

The paper introduces a comprehensive human-agent negotiation framework designed to facilitate the development and evaluation of research studies on human-agent negotiation without building each component from scratch. Leveraging the interoperability and reusability of its components, this framework offers various functionalities, including speech-to-text conversion, emotion recognition, a repository of negotiation strategies, and an interaction manager capable of managing gestures designed for Nao, Pepper, and QT, and coordinating message exchanges in a turn-taking fashion. This framework aims to lower the entry barrier for researchers in human-agent negotiation by providing a versatile platform that supports a wide range of research directions, including affective computing, natural language processing, decision-making, and non-verbal communication.

The complexity of automated negotiation research calls for dedicated, user-friendly research frameworks that facilitate advanced analytics, comprehensive loggers, visualization tools, and auto-generated domains and preference profiles. This paper introduces NegoLog, a platform that provides advanced and customizable analysis modules to agent developers for exhaustive performance evaluation. NegoLog introduces an automated scenario and tournament generation tool in its Web-based user interface so that the agent developers can adjust the competitiveness and complexity of the negotiations. One of the key novelties of the NegoLog is an individual assessment of preference estimation models independent of the strategies.

The vast range of possible fully autonomous multiunmanned aerial vehicle (multi-UAV) operations is creating a new and expanding market where technological advances are happening at a breakneck pace. The integration of UAVs in airspaces (not just for military purposes but also for civil, commercial, and leisure use) is essential in realizing the potential of this growing industry. Furthermore, with the advent of 6G, such integration will be cost-effective and more flexible. However, to reach widespread adoption, new models focusing on the safety, efficiency, reliability, and privacy of fully autonomous multi-UAV operations, ensuring that the operation history is trustworthy and can be audited by the relevant stakeholders, need to be developed. Accordingly, this work presents a research guideline for fully autonomous trustworthy UAV teamwork through layer 2 blockchains that provide efficient, privacy-preserving, reliable, and secure multi-UAV service delivery. We show the implications of this approach for an aerial surveillance use case.

This paper presents the negotiation support mechanisms provided by the Pocket Negotiator (PN) and an elaborate empirical evaluation of the economic decision support (EDS) mechanisms during the bidding phase of negotiations as provided by the PN. Some of these support mechanisms are offered actively, some passively. With passive support we mean that the user only gets that support by clicking a button, whereas active support is provided without prompting. Our results show, that PN improves negotiation outcomes, counters cognitive depletion, and encourages exploration of potential outcomes. We found that the active mechanisms were used more effectively than the passive ones and, overall, the various mechanisms were not used optimally, which opens up new avenues for research. As expected, the participants with higher negotiation skills outperformed the other groups, but still they benefited from PN support. Our experimental results show that people with enough technical skills and with some basic negotiation knowledge will benefit most from PN support. Our results also show that the cognitive depletion effect is reduced by Pocket Negotiator support. The questionnaire taken after the experiment shows that overall the participants found Pocket Negotiator easy to interact with, that it made them negotiate more quickly and that it improves their outcome. Based on our findings, we recommend to 1) provide active support mechanisms (push) to nudge users to be more effective, and 2) provide support mechanisms that shield the user from mathematical complexities.

The International Automated Negotiating Agent Competition introduces a new challenge each year to facilitate the research on agent-based negotiation and provide a test benchmark. ANAC 2020 addressed the problem of designing effective agents that do not know their users’ complete preferences in addition to their opponent’s negotiation strategy. Accordingly, this paper presents the negotiation strategy of the winner agent called “AhBuNe Agent”. The proposed heuristic-based bidding strategy checks whether it has sufficient orderings to reason about its complete preferences and accordingly decides whether to sacrifice some utility in return for preference elicitation. While making an offer, it uses the most-desired known outcome as a reference and modifies the content of the bid by adopting a concession-based strategy. By analyzing the content of the given ordered bids, the importance ranking of the issues is estimated. As our agent adopts a fixed time-based concession strategy and takes the estimated issue importance ranks into account, it determines to what extent the issues are to be modified. The evaluation results of the ANAC 2020 show that our agent beats the other participating agents in terms of the received individual score.

Building on prior works on explanation negotiation protocols, this paper proposes a general-purpose protocol for multi-agent systems where recommender agents may need to provide explanations for their recommendations. The protocol specifies the roles and responsibilities of the explainee and the explainer agent and the types of information that should be exchanged between them to ensure a clear and effective explanation. However, it does not prescribe any particular sort of recommendation or explanation, hence remaining agnostic w.r.t. such notions. Novelty lays in the extended support for both ordinary and contrastive explanations, as well as for the situation where no explanation is needed as none is requested by the explainee. Accordingly, we formally present and analyse the protocol, motivating its design and discussing its generality. We also discuss the reification of the protocol into a re-usable software library, namely PyXMas, which is meant to support developers willing to build explainable MAS leveraging our protocol. Finally, we discuss how custom notions of recommendation and explanation can be easily plugged into PyXMas.

An international competition for negotiating agents has been organized for years to facilitate research in agent-based negotiation and to encourage the design of negotiating agents that can operate in various scenarios. The 13th International Automated Negotiating Agents Competition (ANAC 2022) was held in conjunction with IJCAI2022. In ANAC2022, we had two leagues: Automated Negotiation League (ANL) and Supply Chain Management League (SCML). For the ANL, the participants designed a negotiation agent that can learn from the previous bilateral negotiation sessions it was involved in. In contrast, the research challenge was to make the right decisions to maximize the overall profit in a supply chain environment, such as determining with whom and when to negotiate. This chapter describes the overview of ANL and SCML in ANAC2022, and reports the results of each league, respectively.

Day by day, human-agent negotiation becomes more and more vital to reach a socially beneficial agreement when stakeholders need to make a joint decision together. Developing agents who understand not only human preferences but also attitudes is a significant prerequisite for this kind of interaction. Studies on opponent modeling are predominantly based on automated negotiation and may yield good predictions after exchanging hundreds of offers. However, this is not the case in human-agent negotiation in which the total number of rounds does not usually exceed tens. For this reason, an opponent model technique is needed to extract the maximum information gained with limited interaction. This study presents a conflict-based opponent modeling technique and compares its prediction performance with the well-known approaches in human-agent and automated negotiation experimental settings. According to the results of human-agent studies, the proposed model outpr erforms them despite the diversity of participants’ negotiation behaviors. Besides, the conflict-based opponent model estimates the entire bid space much more successfully than its competitors in automated negotiation sessions when a small portion of the outcome space was explored. This study may contribute to developing agents that can perceive their human counterparts’ preferences and behaviors more accurately, acting cooperatively and reaching an admissible settlement for joint interests.

Recommender systems aim to support their users by reducing information overload so that they can make better decisions. Recommender systems must be transparent, so users can form mental models about the system’s goals, internal state, and capabilities, that are in line with their actual design. Explanations and transparent behaviour of the system should inspire trust and, ultimately, lead to more persuasive recommendations. Here, explanations convey reasons why a recommendation is given or how the system forms its recommendations. This paper focuses on the question how such claims about effectiveness of explanations can be evaluated. Accordingly, we investigate various models that are used to assess the effects of explanations and recommendations. We discuss objective and subjective measurement and argue that both are needed. We define a set of metrics for measuring the effectiveness of explanations and recommendations. The feasibility of using these metrics is discussed in the context of a specific explainable recommender system in the food and health domain.

People’s awareness about the importance of healthy lifestyles is rising. This opens new possibilities for personalized intelligent health and coaching applications. In particular, there is a need for more than simple recommendations and mechanistic interactions. Recent studies have identified nutrition virtual coaching systems (NVC) as a technological solution, possibly bridging technologies such as recommender, informative, persuasive, and argumentation systems. Enabling NVC to explain recommendations and discuss (argument) dietary solutions and alternative items or behaviors is crucial to improve the transparency of these applications and enhance user acceptability and retain their engagement. This study primarily focuses on virtual agents personalizing the generation of food recipes recommendation according to users’ allergies, eating habits, lifestyles, nutritional values, etc. Although the agent would nudge the user to consume healthier food, users may tend to object in favor of tastier food. To resolve this divergence, we propose a user-agent negotiation interacting over the revision of the recommendation (via feedback and explanations) or convincing (via explainable arguments) the user of its benefits and importance. Finally, the paper presents our initial findings on the acceptability and usability of such a system obtained via tests with real users. Our preliminary experimental results show that the majority of the participants appreciate the ability to express their feedback as well as receive explanations of the recommendations, while there is still room for improvement in the persuasiveness of the explanations.

Background and objective:This paper focuses on nutritional recommendation systems (RS), i.e. AI-powered automatic systems providing users with suggestions about what to eat to pursue their weight/body shape goals. A trade-off among (potentially) conflictual requirements must be taken into account when designing these kinds of systems, there including: (i) adherence to experts’ prescriptions, (ii) adherence to users’ tastes and preferences, (iii) explainability of the whole recommendation process. Accordingly, in this paper we propose a novel approach to the engineering of nutritional RS, combining machine learning and symbolic knowledge extraction to profile users—hence harmonising the aforementioned requirements. MethodsOur contribution focuses on the data processing workflow. Stemming from neural networks (NN) trained to predict user preferences, we use CART Breiman et al.(1984) to extract symbolic rules in Prolog Körner et al.(2022) form, and we combine them with expert prescriptions brought in similar form. We can then query the resulting symbolic knowledge base via logic solvers, to draw explainable recommendations. ResultsExperiments are performed involving a publicly available dataset of 45,723 recipes, plus 12 synthetic datasets about as many imaginary users, and 6 experts’ prescriptions. Fully-connected 4-layered NN are trained on those datasets, reaching ∼86% test-set accuracy, on average. Extracted rules, in turn, have ∼80% fidelity w.r.t. those NN. The resulting recommendation system has a test-set precision of ∼74%. The symbolic approach makes it possible to devise how the system draws recommendations. ConclusionsThanks to our approach, intelligent agents may learn users’ preferences from data, convert them into symbolic form, and extend them with experts’ goal-directed prescriptions. The resulting recommendations are then simultaneously acceptable for the end user and adequate under a nutritional perspective, while the whole process of recommendation generation is made explainable.

This paper introduces a dependency analysis and a categorization of conceptualized and existing economic decision support mechanisms for negotiation. The focus of our survey is on economic decision support mechanisms, although some behavioural support mechanisms were included, to recognize the important work in that area. We categorize support mechanisms from four different aspects: (i) economic versus behavioral decision support, (ii) analytical versus strategical support, (iii) active versus passive support and (iv) implicit versus explicit support. Our survey suggests that active mechanisms would be more effective than passive ones, and that implicit mechanisms can shield the user from mathematical complexities. Furthermore, we provide a list of existing economic support mechanisms.

In agent-based negotiations, it is crucial to understand the opponent’s behavior and predict its bidding pattern to act strategically. Foreseeing the utility of the opponent’s coming offer provides valuable insight to the agent so that it can decide its next move wisely. Accordingly, this paper addresses predicting the opponent’s coming offers by employing two deep learning-based approaches: Long Short-Term Memory Networks and Transformers. The learning process has three different targets: estimating the agent’s utility of the opponent’s coming offer, estimating the agent’s utility of that without using opponent-related variables, and estimating the opponent’s utility of that by using opponent-related variables. This work reports the performances of these models that are evaluated in various negotiation scenarios. Our evaluation showed promising results regarding the prediction performance of the proposed methods.

Designing an effective and intelligent bidding strategy is one of the most compelling research challenges in automated negotiation, where software agents negotiate with each other to find a mutual agreement when there is a conflict of interests. Instead of designing a hand-crafted decision-making module, this work proposes a novel bidding strategy adopting an actor-critic reinforcement learning approach, which learns what to offer in a bilateral negotiation. An entropy reinforcement learning framework called Soft Actor-Critic (SAC) is applied to the bidding problem, and a self-play approach is employed to train the model. Our model learns to produce the target utility of the coming offer based on previous offer exchanges and remaining time. Furthermore, an imitation learning approach called behavior cloning is adopted to speed up the learning process. Also, a novel reward function is introduced that does take not only the agent’s own utility but also the opponent’s utility at the end of the negotiation. The developed agent is empirically evaluated. Thus, a large number of negotiation sessions are run against a variety of opponents selected in different domains varying in size and opposition. The agent’s performance is compared with its opponents and the performance of the baseline agents negotiating with the same opponents. The empirical results show that our agent successfully negotiates against challenging opponents in different negotiation scenarios without requiring any former information about the opponent or domain in advance. Furthermore, it achieves better results than the baseline agents regarding the received utility at the end of the successful negotiations.

Increasingly, on-demand nature of customer interactions put pressure on companies to build real-time campaign management systems. Instead of having managers to decide on the campaign rules, such as, when, how and whom to offer, creating intelligent campaign management systems that can automate such decisions is essential. In addition, regulations or company policies usually restrict the number of accesses to the customers. Efficient learning of customer behaviour through dynamic campaign participation observations becomes a crucial feature that may ultimately define customer satisfaction and retention. This paper builds on the recent successes of deep learning techniques and proposes a classification model to predict customer responses for campaigns. Classic deep neural networks are good at learning hidden relations within data (i.e., patterns) but with limited capability for memorization. One solution to increase memorization is to use manually craft features, as in Wide & Deep networks, which are originally proposed for Google Play App. recommendations. We advocate using decision trees as an easier way of mining high-level relationships for enhancing Wide & Deep networks. Such an approach has the added benefit of beating manually created rules, which, most of the time, use incomplete data and have biases. A set of comprehensive experiments on campaign participation data from a leading GSM provider shows that automatically crafted features make a significant increase in the accuracy and outperform Deep and Wide & Deep models with manually crafted features.