The Garbage Can Model of Organizational Choice: Looking Forward at Forty

Author(s):  
Alessandro Lomi ◽  
J. Richard Harrison
Author(s):  
Werner Jann

This chapter examines “A Garbage Can Model of Organizational Choice,” a paper authored by Michael D. Cohen, James G. March, and Johan P. Olsen. It first discusses the assumptions of the garbage can model about decision-making in organizations, paying particular attention its three main elements: problematic preferences, unclear technologies, and fluid participation. It then considers four “relatively independent streams” and their interrelations: problems, solutions, participants, and choice opportunities. The chapter also assesses the paper’s main impact by focusing on organization theory and the original formal model before turning to the more specific areas of policy-making, administrative reform, and institutional theory.


1972 ◽  
Vol 17 (1) ◽  
pp. 1 ◽  
Author(s):  
Michael D. Cohen ◽  
James G. March ◽  
Johan P. Olsen

Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1345
Author(s):  
Dorota Żuchowska-Skiba ◽  
Maria Stojkow ◽  
Malgorzata J. Krawczyk ◽  
Krzysztof Kułakowski

The main goal of our work is to show how ideas change in social networks. Our analysis is based on three concepts: (i) temporal networks, (ii) the Axelrod model of culture dissemination, (iii) the garbage can model of organizational choice. The use of the concept of temporal networks allows us to show the dynamics of ideas spreading processes in networks, thanks to the analysis of contacts between agents in networks. The Axelrod culture dissemination model allows us to use the importance of cooperative behavior for the dynamics of ideas disseminated in networks. In the third model decisions on solutions of problems are made as an outcome of sequences of pseudorandom numbers. The origin of this model is the Herbert Simon’s view on bounded rationality. In the Axelrod model, ideas are conveyed by strings of symbols. The outcome of the model should be the diversity of evolving ideas as dependent on the chain length, on the number of possible values of symbols and on the threshold value of Hamming distance which enables the combination.


Sign in / Sign up

Export Citation Format

Share Document