On Being Responsible

Joint responsibility is a mental and behavioural state which captures and formalizes many of the intuitive underpinnings of collaborative problem solving. It defines the pre-conditions which must hold before such activity can commence, how individuals should behave (in their own problem solving and towards others) once such problem solving has begun and minimum conditions which group participants must satisfy

Cooperation in Industrial Systems

ARCHON is an ongoing ESPRIT II project (P-2256) which is approximately half way through its five year duration. It is concerned with defining and applying techniques from the area of Distributed Artificial Intelligence to the development of real-size industrial applications. Such techniques enable multiple problem solvers (e.g. expert systems, databases and conventional numerical software systems) to communicate and cooperate with each other to improve both their individual problem solving behavior and the behavior of the community as a whole. This paper outlines the niche of ARCHON in the Distributed AI world and provides an overview of the philosophy and architecture of our approach the essence of which is to be both general (applicable to the domain of industrial process control) and powerful enough to handle real-world problems

On Agent-Based Software Engineering

Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly improve the theory and the practice of modeling, designing, and implementing computer systems. Yet, to date, there has been little systematic analysis of what makes the agent-based approach such an appealing and powerful computational model. Moreover, even less effort has been devoted to discussing the inherent disadvantages that stem from adopting an agent-oriented view. Here both sets of issues are explored. The standpoint of this analysis is the role of agent-based software in solving complex, real-world problems. In particular, it will be argued that the development of robust and scalable software systems requires autonomous agents that can complete their objectives while situated in a dynamic and uncertain environment, that can engage in rich, high-level social interactions, and that can operate within flexible organisational structures

Agent-Based Computing: Promise and Perils

Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly improve the theory and practice of modelling, designing and implementing complex systems. Yet, to date, there has been little systematic analysis of what makes an agent such an appealing and powerful conceptual model. Moreover, even less effort has been devoted to exploring the inherent disadvantages that stem from adopting an agent-oriented view. Here both sets of issues are explored. The standpoint of this analysis is the role of agent-based software in solving complex, real-world problems. In particular, it will be argued that the development of robust and scalable software systems requires autonomous agents that can complete their objectives while situated in a dynamic and uncertain environment, that can engage in rich, high-level social interactions, and that can operate within flexible organisational structures

Social influence, negotiation and cognition

To understand how personal agreements can be generated within complexly differentiated social systems, we develop an agent-based computational model of negotiation in which social influence plays a key role in the attainment of social and cognitive integration. The model reflects a view of social influence that is predicated on the interactions among such factors as the agents' cognition, their abilities to initiate and maintain social behaviour, as well as the structural patterns of social relations in which influence unfolds. Findings from a set of computer simulations of the model show that the degree to which agents are influenced depends on the network of relations in which they are located, on the order in which interactions occur, and on the type of information that these interactions convey. We also find that a fundamental role in explaining influence is played by how inclined the agents are to be concilatory with each other, how accurate their beliefs are, and how self-confident they are in dealing with their social interactions. Moreover, the model provides insights into the trade-offs typically involved in the exercise of social influence

Particle Filtering and Smoothing Using Windowed Rejection Sampling

"Particle methods" are sequential Monte Carlo algorithms, typically involving importance sampling, that are used to estimate and sample from joint and marginal densities from a collection of a, presumably increasing, number of random variables. In particular, a particle filter aims to estimate the current state $X_{n}$ of a stochastic system that is not directly observable by estimating a posterior distribution $\pi(x_{n}|y_{1},y_{2}, \ldots, y_{n})$ where the $\{Y_{n}\}$ are observations related to the $\{X_{n}\}$ through some measurement model $\pi(y_{n}|x_{n})$. A particle smoother aims to estimate a marginal distribution $\pi(x_{i}|y_{1},y_{2}, \ldots, y_{n})$ for $1 \leq i < n$. Particle methods are used extensively for hidden Markov models where $\{X_{n}\}$ is a Markov chain as well as for more general state space models. Existing particle filtering algorithms are extremely fast and easy to implement. Although they suffer from issues of degeneracy and "sample impoverishment", steps can be taken to minimize these problems and overall they are excellent tools for inference. However, if one wishes to sample from a posterior distribution of interest, a particle filter is only able to produce dependent draws. Particle smoothing algorithms are complicated and far less robust, often requiring cumbersome post-processing, "forward-backward" recursions, and multiple passes through subroutines. In this paper we introduce an alternative algorithm for both filtering and smoothing that is based on rejection sampling "in windows" . We compare both speed and accuracy of the traditional particle filter and this "windowed rejection sampler" (WRS) for several examples and show that good estimates for smoothing distributions are obtained at no extra cost

Optimal Combinatorial Electricity Markets

The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage and meet their energy needs. To this end, this paper develops a new model for electricity retail where end-use customers choose their supplier from competing electricity retailers. The model is based on simultaneous reverse combinatorial auctions, designed as a second-price sealed-bid multi-item auction with supply function bidding. This model prevents strategic bidding and allows the auctioneer to maximise its payoff. Furthermore, we develop optimal single-item and multi-item algorithms for winner determination in such auctions that are significantly less complex than those currently available in the literature

The organisation of sociality: a manifesto for a new science of multi-agent systems

In this paper, we pose and motivate a challenge, namely the need for a new science of multi-agent systems. We propose that this new science should be grounded, theoretically on a richer conception of sociality, and methodologically on the extensive use of computational modelling for real-world applications and social simulations. Here, the steps we set forth towards meeting that challenge are mainly theoretical. In this respect, we provide a new model of multi-agent systems that reflects a fully explicated conception of cognition, both at the individual and the collective level. Finally, the mechanisms and principles underpinning the model will be examined with particular emphasis on the contributions provided by contemporary organisation theory

Knowledge-based acquisition of tradeoff preferences of negotiating agents

A wide range of algorithms have been developed for various types of automated egotiation. In developing such algorithms the main focus has been on their efficiency and their effectiveness. However, this is only part of the picture. Agents typically negotiate on behalf of their owners and for this to be effective the agent must be able to adequately represent the owners' preferences. However, the process by which such knowledge is acquired is typically left unspecified. To remove this shortcoming, we present a case study indicating how the knowledge for a particular negotiation algorithm can be acquired. More precisely, according to the analysis on the automated negotiation model, we identified that user trade-off preferences play a fundamental role in negotiation in general. This topic has been addressed little in the research area of user preference elicitation for general decision making problems as well. In a previous paper, we proposed an exhaustive method to acquire user trade-off preferences. In this paper, we developed another method to remove the limitation of the high user workload of the exhaustive method. Although we cannot say that it can exactly capture user trade-off preferences, it models the main commonalities of trade-off relations and re users' individualities as well