A COMPUTATIONAL MODEL OF COORDINATION

This paper explores and explicates the concept of coordination in smal l workgroups. We develop a computational model within which the key co nstructs of coordination can be precisely defined. This framework can serve as the basis for additional theoretical developments and as a ba sis for developing software systems designed to support coordination i n workgroups. Coordination is viewed as management of conflicting dema nds on finite resources by actors or activities. These activities may be informational in nature. We conceptualize the underlying primitive concepts that constitute the idea of coordination. This conceptualizat ion views coordination as a cycle of four phases: the definitional pha se, the conflict resolution phase, the action phase, and the adaptatio n phase. We then set forth a formal model of coordination, both as a p henomenon and as a process. Within the context of the framework we hav e created, key concepts of decomposability, Pareto-satisfactory, infor mational privacy, informational decentralization, and informational ef ficiency are explored.