A generic model of dyadic social relationships

We introduce a model of dyadic social interactions and establish its correspondence with relational models theory (RMT), a theory of human social relationships. RMT posits four elementary models of relationships governing human interactions, singly or in combination: Communal Sharing, Authority Ranking, Equality Matching, and Market Pricing. To these are added the limiting cases of asocial and null interactions, whereby people do not coordinate with reference to any shared principle. Our model is rooted in the observation that each individual in a dyadic interaction can do either the same thing as the other individual, a different thing or nothing at all. To represent these three possibilities, we consider two individuals that can each act in one out of three ways toward the other: perform a social action X or Y, or alternatively do nothing. We demonstrate that the relationships generated by this model aggregate into six exhaustive and disjoint categories. We propose that four of these categories match the four relational models, while the remaining two correspond to the asocial and null interactions defined in RMT. We generalize our results to the presence of N social actions. We infer that the four relational models form an exhaustive set of all possible dyadic relationships based on social coordination. Hence, we contribute to RMT by offering an answer to the question of why there could exist just four relational models. In addition, we discuss how to use our representation to analyze data sets of dyadic social interactions, and how social actions may be valued and matched by the agents

Division of Labour and Social Coordination Modes : A simple simulation model

This paper presents a preliminary investigation of the relationship between the process of functional division of labour and the modes in which activities and plans are coordinated. We consider a very simple production process: a given heap of bank-notes has to be counted by a group of accountants. Because of limited individual capabilities and/or the possibilities of mistakes and external disturbances, the task has to be divided among several accountants and a hierarchical coordination problem arises. We can imagine several different ways of socially implementing coordination of devided tasks. 1) a central planner can compute the optimal architecture of the system; 2) a central planner can promote quantity adjustments by moving accountants from hierarchical levels where there exist idle resources to levels where resources are insufficient; 3) quasi-market mechanisms can use quantity or price signals for promoting decentralized adjustments. By means of a simple simulation model, based on Genetic Algorithms and Classifiers Systems, we can study the dynamic efficiency properties of each coordination mode and in particular their capability, speed and cost of adaptation to changing environmental situations (i.e. variations of the size of the task and/or variations of agents' capabilities). Such interesting issues as returns to scale, specialization and workers exploitation can be easily studied in the same model

The hippocampus and cerebellum in adaptively timed learning, recognition, and movement

The concepts of declarative memory and procedural memory have been used to distinguish two basic types of learning. A neural network model suggests how such memory processes work together as recognition learning, reinforcement learning, and sensory-motor learning take place during adaptive behaviors. To coordinate these processes, the hippocampal formation and cerebellum each contain circuits that learn to adaptively time their outputs. Within the model, hippocampal timing helps to maintain attention on motivationally salient goal objects during variable task-related delays, and cerebellar timing controls the release of conditioned responses. This property is part of the model's description of how cognitive-emotional interactions focus attention on motivationally valued cues, and how this process breaks down due to hippocampal ablation. The model suggests that the hippocampal mechanisms that help to rapidly draw attention to salient cues could prematurely release motor commands were not the release of these commands adaptively timed by the cerebellum. The model hippocampal system modulates cortical recognition learning without actually encoding the representational information that the cortex encodes. These properties avoid the difficulties faced by several models that propose a direct hippocampal role in recognition learning. Learning within the model hippocampal system controls adaptive timing and spatial orientation. Model properties hereby clarify how hippocampal ablations cause amnesic symptoms and difficulties with tasks which combine task delays, novelty detection, and attention towards goal objects amid distractions. When these model recognition, reinforcement, sensory-motor, and timing processes work together, they suggest how the brain can accomplish conditioning of multiple sensory events to delayed rewards, as during serial compound conditioning.Air Force Office of Scientific Research (F49620-92-J-0225, F49620-86-C-0037, 90-0128); Advanced Research Projects Agency (ONR N00014-92-J-4015); Office of Naval Research (N00014-91-J-4100, N00014-92-J-1309, N00014-92-J-1904); National Institute of Mental Health (MH-42900

Robotic Sensorimotor Learning in Continuous Domains

We propose that some aspects of task based learning in robotics can be approached using nativist and constructivist views on human sensorimotor development as a metaphor. We use findings in developmental psychology, neurophysiology, and machine perception to guide a robotic learning system\u27s level of representation both for actions and for percepts. Visually driven grasping is chosen as the experimental task since it has general applicability and it has been extensively researched from several perspectives. An implementation of a robotic system with a dexterous three fingered hand, compliant instrumented wrist, arm and vision is used to test these ideas. Several sensorimotor primitives (vision segmentation and manipulatory reflexes) are implemented in this system and may be thought of as the innate perceptual and motor abilities of the system. Applying empirical learning techniques to real situations brings up some important issues such as observation sparsity in high dimensional spaces, arbitrary underlying functional forms of the reinforcement distribution and robustness to noise in exemplars. The well established technique of non-parametric projection pursuit regression (PPR) is used to accomplish reinforcement learning by searching for generalization directions determining projections of high dimensional data sets which capture task invariants. Additionally, the learning process generally implies failures along the way. Therefore, the mechanics of the untrained robotic system must be able to tolerate grave mistakes during learning and not damage itself. We address this by the use of an instrumented compliant robot wrist which controls impact forces

Sparse Stabilization and Control of Alignment Models

From a mathematical point of view self-organization can be described as patterns to which certain dynamical systems modeling social dynamics tend spontaneously to be attracted. In this paper we explore situations beyond self-organization, in particular how to externally control such dynamical systems in order to eventually enforce pattern formation also in those situations where this wished phenomenon does not result from spontaneous convergence. Our focus is on dynamical systems of Cucker-Smale type, modeling consensus emergence, and we question the existence of stabilization and optimal control strategies which require the minimal amount of external intervention for nevertheless inducing consensus in a group of interacting agents. We provide a variational criterion to explicitly design feedback controls that are componentwise sparse, i.e. with at most one nonzero component at every instant of time. Controls sharing this sparsity feature are very realistic and convenient for practical issues. Moreover, the maximally sparse ones are instantaneously optimal in terms of the decay rate of a suitably designed Lyapunov functional, measuring the distance from consensus. As a consequence we provide a mathematical justification to the general principle according to which "sparse is better" in the sense that a policy maker, who is not allowed to predict future developments, should always consider more favorable to intervene with stronger action on the fewest possible instantaneous optimal leaders rather than trying to control more agents with minor strength in order to achieve group consensus. We then establish local and global sparse controllability properties to consensus and, finally, we analyze the sparsity of solutions of the finite time optimal control problem where the minimization criterion is a combination of the distance from consensus and of the l1-norm of the control.Comment: 33 pages, 5 figure