We built a conversational agent performing social promotion (CASP) to assist in automation of interacting with Facebook friends. CASP relies on a domain-independent natural language relevance technique which filters web mining results to support a conversation with friends and other network members. In this study we focus on recognizing friends’ intents to better support automated conversation with them. We learn the plausible sequences of communicative actions and mental states as they are expressed in text to support plausible dialogue. We evaluate the relevance of the constructed conversations with respect to suitability of topicality and communicative actions, measuring how human users loose trust in the system. It is confirmed that maintaining a plausible sequences of communicative actions in automated postings is important for retaining trust of human peers and efficient social promotion by means of CASP.

Reinforcement learning with reward shaping is a well established but often computationally expensive approach to large multiagent systems. Agent partitioning can reduce this computational complexity by treating each partition of agents as an independent problem. We introduce a novel agent partitioning approach called Reward/Utility-Based Impact (RUBI). RUBI finds an effective partitioning of agents while requiring no prior domain knowledge, improves performance by discovering a non-trivial agent partitioning, and leads to faster simulations. We test RUBI in the Air Traffic Flow Management Problem (ATFMP), where there are tens of thousands of aircraft affecting the system and no obvious similarity metric between agents. When partitioning with RUBI in the ATFMP, there is a 37% increase in performance, with a 510x speed increase over non-partitioning approaches. Additionally, RUBI matches the performance of the current domain-dependent ATFMP gold standard using no prior knowledge and with 10% faster performance.

This paper introduces a novel autonomous interactive learning cooperative (ILCP) who receives expected value and variance of load from consumers and participates in the electricity market on their behalf. Using an axiomatic approach, the share of each consumer's payment as well as its weight in calculating the modification of total day-ahead load are formulated. This scheme applies double-seasonal smoothing exponential, a recent load forecasting technique, and a classifier for real-time to day-ahead price direction forecasting (Gaussian Naïve Bayes). In addition to this, the ILCP employs interactive cooperative algorithms for both trading cooperative and consumer side. The ILCP scheme is investigated and its performance is compared to those of non-cooperative real-time pricing (RTP), LCP (non-interactive learning cooperative) and CP (non-interactive non-learning cooperative). The developed system was implemented using PJM(world's largest  wholesale electricity market) real-time and day-ahead data for 2013 and half of 2014; real load profiles were selected from a set of 579 residential and commercial consumers, and weather data were applied to forecasting electricity price direction. We demonstrate the advantages of ILCP to lower the average electricity cost and to reduce unit price variations.

In open multi-agent systems, often, agents interact with each other to meet their objectives. Trust is, therefore, considered essential to make such interactions useful. However, trust is a complex, multifaceted concept and includes more than just evaluating other’s honesty. Many trust evaluation models have been proposed and implemented in different areas; most of them focused on creating algorithms for trusters to model the honesty of trustees in order to make effective decisions about which trustees to select. However, slight consideration is paid to trust establishment. This work describes a trust establishment model that goes beyond trust evaluation to outline actions to guide trustees (instead of trustors). The model uses a multicriteria method for measuring and analysing needs of trusters and evaluates the satisfaction level of trusters based on their values and expressed preferences. Using the feedback from trusters, trustees attempt to modify their behavior in order to achieve higher confidence levels as part of their plans to be selected as partners of other agents in the community for future interactions. Simulation results indicate that trustees can become more trusted if they adjust their behaviour based of satisfaction feedback from trusters.

In this work we present a theoretical approach (not currently implemented), to the problem of predicting agent behavior. The ultimate goal of this work is to learn models that can be used to predict the future actions of intelligent agents, based on previously recorded data on those agents’ behavior. We believe that we can improve the predictive accuracy of our models by assuming that an agent reasons about the actions it takes, and trying to explicitly model that reasoning process. Here, we model an agent’s reasoning process as a form of Monte-Carlo search, and attempt to learn a state evaluation function that, when used with this planning algorithm, yields a similar distribution of actions given the current state of the world as we observe in the data. While it is simple to simulate Monte-Carlo search given an evaluation function, it is much more difficult to determine an evaluation function that will generate a certain behavior. Here we will use Expectation-Maximization to find a maximum likelihood estimate of the parameters of the evaluation function, treating the actual steps taken in planning each action as unobserved data.

Vehicle-sharing (ex: bike sharing, car sharing) is widelyadopted in many cities of the world due to concernsassociated with extensive private vehicle usage, whichhas led to increased carbon emissions, traffic conges-tion and usage of non-renewable resources. In vehicle-sharing systems, base stations are strategically placedthroughout a city and each of the base stations containa pre-determined number of vehicles at the beginningof each day. Due to the stochastic and individualisticmovement of customers, typically, there is either con-gestion (more than required) or starvation (fewer thanrequired) of vehicles at certain base stations. As demon-strated in our experimental results, this happens oftenand can cause a significant loss in demand. We proposeto dynamically redeploy idle vehicles using carriers soas to minimize lost demand or alternatively maximizerevenue of the vehicle sharing company. To that end,we contribute an optimization formulation to jointly ad-dress the redeployment (of vehicles) and routing (of car-riers) problems and provide two approaches that rely ondecomposability and abstraction of problem domains toreduce the computation time significantly. Finally, wedemonstrate the utility of our approaches on two realworld data sets of bike-sharing companies.

Hutter's universal artificial intelligence (AI) showed how to define future AI systems by mathematical equations. Here we adapt those equations to define a self-modeling framework, where AI systems learn models of their own calculations of future values. Hutter discussed the possibility that AI agents may maximize rewards by corrupting the source of rewards in the environment. Here we propose a way to avoid such corruption in the self-modeling framework. This paper fits in the context of my book Ethical Artificial Intelligence.

Cyber-Physical Production Systems’ (CPPSs) main feature is adaptability, i.e. they can adapt quickly to new production goals such as new products or product variants. Today, the bottleneck of such approaches is the automation system, which still requires high manual engineering efforts for every adaptation step. Many recent solutions for a more adaptable automation software have focused on the automatic orchestration of software systems: for a new product and production configuration, a software solutions is created by putting together reusable software components. But such solutions come with a price: reusable software components must be, by definition, applicable to wide range of configurations. For this, software components come with free parameters that must be set according to the current configuration. Typically, the main problem is not the orchestration of software components but their correct parameterization. This paper presents, to the best of our knowledge for the first time, a solution to the parameterization problem of adaptable, CPPS-enable software systems. Due to the nature of CPPSs, no direct computation of parameters is possible. Instead, an iteration-based approach using a model of both the plant and the automation system is needed. An example from process industry illustrates the ideas.

Communication involves transferring information from one agent to another. An intelligent agent, either human or machine, is often able to choose to hide information in order to protect their interests. The notion of information hiding is closely linked to secrecy and dishonesty, but it also plays an important role in domains such as software engineering. In this paper, we consider the ethics of information hiding, particularly with respect to intelligent agents. In other words, we are concerned with situations that involve a human and an intelligent agent with access to different information. Is the intelligent agent justified in preventing a human user from accessing the information that they possess? This is trivially true in the case where access control systems exist. However, we are concerned with the situation where an intelligent agent is able to using a reasoning system to decide not to share information with all humans. On the other hand, we are also concerned with situations where humans hide information from machines. Are we ever under a moral obligation to share information with a computional agent? We argue that questions of this form are increasingly important now, as people are increasingly willing to divulge private information to machines with a great capacity to reason with that information and share it with others.

We propose and evaluate a number of solutions to the problem of calculating the cost to serve each location in a single-vehicle transport setting. Such cost to serve analysis has application both strategically and operationally in transportation. The problem is formally given by the traveling salesperson game (TSG), a cooperative total utility game in which agents correspond to locations in a travelling salesperson problem (TSP). The cost to serve a location is an allocated portion of the cost of an optimal tour. The Shapley value is one of the most important normative division schemes in cooperative games, giving a principled and fair allocation both for the TSG and more generally. We consider a number of direct and sampling-based procedures for calculating the Shapley value, and present the first proof that approximating the Shapley value of the TSG within a constant factor is NP-hard. Treating the Shapley value as an ideal baseline allocation, we then develop six proxies for that value which are relatively easy to compute. We perform an experimental evaluation using Synthetic Euclidean games as well as games derived from real-world tours calculated for fast-moving consumer goods scenarios. Our experiments show that several computationally tractable allocation techniques correspond to good proxies for the Shapley value.