default search action
Computational & Mathematical Organization Theory, Volume 2
Volume 2, Number 1, March 1996
- Martin Ruef:
The evolution of convention: Conformity and innovation in task-oriented networks. 5-28 - Kevin Crowston:
An approach to evolving novel organizational forms. 29-47 - Faison P. Gibson:
The sugar production factory - A dynamic decision task. 49-60
Volume 2, Number 2, June 1996
- Michael Masuch, Zhisheng Huang:
A case study in logical deconstruction: Formalizing J.D. Thompson's Organizations in Action in a multi-agent action logic. 71-113 - Evelien P. H. Zeggelink, Reinier Oosten, Frans N. Stokman:
Object oriented modeling of social networks. 115-138 - David Rose, Thomas R. Willemain:
The principal-agent problem with evolutionary learning. 139-162 - Thomas W. Valente:
Network models of the diffusion of innovations. 163-164
Volume 2, Number 3, September 1996
- Yan Jin, Raymond E. Levitt:
The virtual design team: A computational model of project organizations. 171-195 - Steven Durlauf:
An incomplete markets model of business cycles. 197-218 - Young-pa So, Edmund H. Durfee:
Designing tree-structured organizations for computational agents. 219-245 - Christina Dorfhuber, Diana Burley Gant:
Book review. 247-251
Volume 2, Number 4, December 1996
- Kathleen M. Carley, William A. Wallace:
Note to reviewers. 259-260 - Moshe Tennenholtz:
Convention evolution in organizations and markets. 261-283 - Andrew Hyatt, Noshir S. Contractor, Patricia Jones:
Computational organizational network modeling: Strategies and an example. 285-300 - David L. Paul, John C. Butler, Keri E. Pearlson, Andrew B. Whinston:
Computationally modeling organizational learning and adaptability as resource allocation: An artificial adaptive systems approach. 301-324
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.