Abstract
The present paper begins by deriving an instantaneous formulation for the backward-looking (reinforcement based learning) satisfaction balance model of Gray and Tallman (1984). This model is then used to generate interactional data from four simulated agents in a network interaction experiment. Because this initial model does not generate stable interaction structures in the network experiment, it is altered step by step in the direction of a forward-looking (agent with goals) model that has been shown to generate such stable interaction structures. The purpose of the modifications are to learn what aspects of the forward-looking model are needed to evolve a stable interaction structure, and to learn how these aspects may be incorporated into a model that remains essentially reinforcement based.
Similar content being viewed by others
References
Burke, P.J. (1991), "Identity Processes and Social Stress," American Sociological Review, 56, 836–849.
Burke, P.J. (1996), "Agency and Interaction," Social Interaction Processes Session of the American Sociological Association Meetings, New York, August 1996.
Burke, P.J. (1997), "An Identity Model for Network Exchange," American Sociological Review, 62, 134–150.
Estes, W.K. (1957), "Of Models and Men," American Psychologist, 12, 609–617.
Gray, L.N. and I. Tallman (1984), "A Satisfaction Balance Model of Decision Making and Choice Behavior," Social Psychology Quarterly, 47, 146–159.
Gray, L.N. (1996), "Cost Equalization as a Determinant of Behavioral Allocation: The Case of Binary Choice," Social Psychology Quarterly, 59, 154–161.
Macy, M.W. (1990), "Learning Theory and the Logic of Critical Mass," American Sociological Review, 55, 809–826.
Molm, L.D. (1989), "Punishment Power: A Balancing Process in Power-Dependence Relations," American Journal of Sociology, 94, 1392–1418.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Burke, P.J., Gray, L.N. Where Forward-Looking and Backward-Looking Models Meet. Computational & Mathematical Organization Theory 5, 75–95 (1999). https://doi.org/10.1023/A:1009668501158
Issue Date:
DOI: https://doi.org/10.1023/A:1009668501158