Chore division on a graph

The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected subgraph of this graph. Although a similar model has been investigated before for goods, we show that the goods and chores settings are inherently different. In particular, it is impossible to derive the solution of the chores instance from the solution of its naturally associated fair division instance. We consider three common fair division solution concepts, namely proportionality, envy-freeness and equitability, and two individual disutility aggregation functions: additive and maximum based. We show that deciding the existence of a fair allocation is hard even if the underlying graph is a path or a star. We also present some efficiently solvable special cases for these graph topologies

Practical Application of a Multi-Agent Systems Society for Energy Management and Control

Power and energy systems lack decision-support systems that enable studying big problems as a whole. The interoperability between multi-agent systems that address specific parts of the global problem is essential. Ontologies ease interoperability between heterogeneous systems providing semantic meaning to the information exchanged between the various parties. This paper presents the practical application of a society of multi-agent systems, which uses ontologies to enable the interoperability between different types of agent-based simulators, directed to the simulation and operation of electricity markets, smart grids and residential energy management. Real data-based demonstration shows the proposed approach advantages in enabling comprehensive, autonomous and intelligent power system simulation studies.This work has been developed under the MAS-SOCIETY project - PTDC/EEI-EEE/28954/2017 and has received funding from UID/EEA/00760/2019, funded by FEDER Funds through COMPETE and by National Funds through FCTinfo:eu-repo/semantics/publishedVersio

Decision Support System for Opponents Selection in Electricity Markets Bilateral Negotiations

This paper presents a new multi-agent decision support system with the purpose of aiding bilateral contract negotiators in the pre-negotiation phase, through the analysis of their possible opponents. The application area of this system is the electricity market, in which players trade a certain volume of energy at a specified price. Consequently, the main output of this system is the recommendation of the best opponent(s) to trade with and the target energy volume to trade with each of the opponents. These recommendations are achieved through the analysis of the possible opponents’ past behavior, namely by learning on their past actions. The result is the forecasting of the expected prices against each opponent depending on the volume to trade. The expected prices are then used by a game-theory based model, to reach the final decision on the best opponents to negotiate with and the ideal target volume to be negotiated with each of themThis work has been developed under the MAS-SOCIETY project - PTDC/EEI-EEE/28954/2017 and has received funding from UID/EEA/00760/2019, funded by FEDER Funds through COMPETE and by National Funds through FCTinfo:eu-repo/semantics/publishedVersio

Explaining Latent Factor Models for Recommendation with Influence Functions

Latent factor models (LFMs) such as matrix factorization achieve the state-of-the-art performance among various Collaborative Filtering (CF) approaches for recommendation. Despite the high recommendation accuracy of LFMs, a critical issue to be resolved is the lack of explainability. Extensive efforts have been made in the literature to incorporate explainability into LFMs. However, they either rely on auxiliary information which may not be available in practice, or fail to provide easy-to-understand explanations. In this paper, we propose a fast influence analysis method named FIA, which successfully enforces explicit neighbor-style explanations to LFMs with the technique of influence functions stemmed from robust statistics. We first describe how to employ influence functions to LFMs to deliver neighbor-style explanations. Then we develop a novel influence computation algorithm for matrix factorization with high efficiency. We further extend it to the more general neural collaborative filtering and introduce an approximation algorithm to accelerate influence analysis over neural network models. Experimental results on real datasets demonstrate the correctness, efficiency and usefulness of our proposed method

RELEVANCE OF ETHICAL GUIDELINES FOR ARTIFICIAL INTELLIGENCE – A SURVEY AND EVALUATION

Ethics for artificial intelligence (AI) is a topic of growing practical relevance. Many people seem to believe that AI could render jobs obsolete in the future. Others wonder who is in charge for the actions of AI systems they encounter. Providing and prioritizing ethical guidelines for AI is therefore an important measure for providing safeguards and increasing the acceptance of this technology. The aim of this research is to survey ethical guidelines for the handling of AI in the ICT industry and evaluate them with respect to their relevance. For this goal, first, an overview of AI ethics is derived from the literature, with a focus on classical Western ethical theories. From this, a candidate set of important ethical guidelines is developed. Then, qualitative interviews with experts are conducted for in-depth feedback and ranking of these guidelines. Furthermore, an online survey is performed in order to more representatively weight the ethical guidelines in terms of importance among a broader audience. Combining both studies, a prioritization matrix is created using the weights from the experts and the survey participants in order to synthesize their votes. Based on this, a ranked catalogue of ethical guidelines for AI is created, and novel avenues for research on AI ethics are presented