This survey characterizes an emerging research area, sometimes called coordination theory, that focuses on the interdisciplinary study of coordination. Research in this area uses and extends ideas about coordination from disciplines such as computer science, organization theory, operations research, economics, linguistics, and psychology. A key insight of the framework presented here is that coordination can be seen as the process of managing dependencies among activities. Further progress, therefore, should be possible by characterizing different kinds of dependencies and identifying the coordination processes that can be used to manage them. A variety of processes are analyzed from this perspective, and commonalities across disciplines are identified. Processes analyzed include those for managing shared resources, producer/consumer relationships, simultaneity constraints, and tank/subtask dependencies. Section 3 summarizes ways of applying a coordination perspective in three different domains: (1) understanding the effects of information technology on human organizations and markets, (2) designing cooperative work tools, and (3) designing distributed and parallel computer systems. In the final section, elements of a research

this paper we set out an approach to CSCW as a field of research which we believe provides a coherent conceptual framework for this area, suggesting that it should be concerned with the support requirements of cooperative work arrangements. This provides a more principled, comprehensive, and, in our opinion, more useful conception of the field than that provided by the conception of CSCW as being focused on computer support for groups. We then investigate the consequences of taking this alternative conception seriously, in terms of research directions for the field. As an indication of the fruits of this approach, we discuss the concept of `articulation work' and its relevance to CSCW. This raises a host of interesting problems that are marginalized in the work on small group support but critical to the success of CSCW systems `in the large', i. e., that are designed to meet current work requirements in the everyday world

We analyze a large-scale custom software effort, the Worm Community system (WCS), a collaborative system designed for a geographically dispersed community of geneticists. There were complex challenges in creating this infrastructural tool, ranging from simple lack of resources to complex organizational and intellectual communication failures and tradeoffs. Despite high user satisfaction with the system and interface, and extensive user needs assessment, feedback and analysis, many users experienced difficulties in signing on and use. The study was conducted during a time of unprecedented growth in the Internet and its utilities (1991-1994), and many respondents turned to the World Wide Web for their information exchange. Using Bateson’s model of levels of learning, we analyze the levels of infrastructural complexity involved in system access and designeruser communication. We analyze the connection between systems development aimed at supporting specific forms of collaborative knowledge work, local organizational transformation, and large-scale infrastructural change.

Introduction Cooperative Distributed Problem-Solving (CDPS) studies how a loosely-coupled network of problem solvers can work together to solve problems that are beyond their individual capabilities. Each problem-solving node in the network is capable of sophisticated problem solving and can work independently, but the problems faced by the nodes cannot be completed without cooperation. Cooperation is necessary because no single node has sufficient expertise, resources, and information to solve a problem, and different nodes might have expertise for solving different parts of the problem. For example, if the problem is to design a house, one node might have expertise on the strength of structural materials, another on the space requirements for different types of rooms, another on plumbing, another on electrical wiring, and so on. Different nodes might have different resources: some might be very fast at computation, others might have connections that speed communication, whil

We investigate the semantics for Knowledge Query Manipulation Language (KQML) and we propose a semantic framework for the language. KQML is a language and a protocol to support communication between software agents. Based on ideas from speech act theory,we propose a semantic description for KQML that associates descriptions of the cognitive states of agents with the use of the language 's primitives (performatives). We use this approachto describe the semantics for the basic set of KQML performatives. We also investigate implementation issues related to our semantic approach. We suggest that KQML can o#er an all purpose communication language for software agents that requires no limiting pre-commitments on the agents' structure and implementation. KQML can provide the Distributed AI, Cooperative Distributed Problem Solving and Software Agents communities with an all purpose language and environment for intelligent inter-agent communication.

This paper presents some results of a detailed empirical study of routine computer use in several organizations. We present a theoretical account of computing work and use it to explain a number of observed phenomena, such as: --How people knowingly use "false" data to obtain desired analytical results by tricking their systems. --How organizations come to rely upon complex, critical computer systems despite significant, recurrent, known errors and inaccurate data

. This paper describes the fundamental concepts of a social reasoning mechanism, designed to be part of an agent's internal model, in a multi-agent systems (MAS) context. It enables an agent to reason about the others using information about their goals, actions, resources and plans. Every agent stores this information in a data structure called external description. We have formally defined and implemented the concepts of external description, dependence relation, and dependence network. One of the main contributions of this work is that an agent can infer his dependence on others using either his own plans or those of the others. As a result, we have defined a preliminary taxonomy of dependence situations regarding the goal being analysed (unilateral, mutual or reciprocal) and the sets of plans used in this reasoning mechanism (mutually or locally believed). We have used this model to build a dependence network simulator, called DEPNET, which is also briefly described in this paper...

Every office is an open system, and the products of office work are the result of decentralized negotiations. Changing patterns of task organization and alliance inevitably give rise to inconsistent knowledge bases and procedures. This implies that there are no globally correct answers to problems addressed by OIL%. Rather, systems must deal with multiple competing, possibly irreconcilable, solutions. Articulating alternative solutions is the problem of due process. This problem and its consequences are illustrated by a case study of a rate-setting group in a large health insurance firm. There is no formal solution to the problem of due process. But it must be solved in practice if distributed intelligent 01 % are to be developed. We propose an alternative approach based on the work of social scientists concerned with analyzing analogous problems in human organization. Solution of the due process problem hinges on developing local closures to the problem faced by an organization. This means analyzing (a) local, tacit knowledge and its transfer ability; (b) articulation work, that is, reconciling incommensurate assumptions and procedures.

Coordination, as the act of managing interdependencies between activities, is one of the central research issues in Distributed Artificial Intelligence. Many researchers have shown that there is no single best organization or coordination mechanism for all environments. Problems in coordinating the activities of distributed intelligent agents appear in many domains: the control of distributed sensor networks; multi-agent scheduling of people and/or machines; distributed diagnosis of errors in local-area or telephone networks; concurrent engineering; `software agents' for information gathering. The design of coordination mechanisms for group...

The distributed coordination problem can be described as how should the local scheduling of activities at each agent be affected by non-local concerns and constraints. Partial global planning (PGP) is a flexible approach to distributed coordination that allows agents to respond dynamically to their current situation. It is based on detecting relationships in the computational goal structures of the distributed agents. However, the detailed PGP mechanisms depend on the existence and availability of certain characteristics and structures ...