Computational Model Library

Garbage can model NetLogo implementation (1.0.0)

The concept of GCM is decision making, which resolve Problems. Problems have Energy Required (ER) for their decision, Managers (decision makers) have Effective Energy (EE) for the decisions generation. The place of decision-making is the Choice Opportunities (Choices) - abstraction of commitees, consul boards and so on.
The Choices and Problems open randomly. The Problems activated by two items and Choices by one item per step of modellig (tick) in first halfe of modelling time. All Managers are ready for action from first modelling step.
Problems and Managers access to Choices in according with system structrure. There is three types of Problems access to Choices and three types of Managers access to Choices.
Presented model literally reproduces the original logic of GCM (with one exception: the equal effective energy distribution between managers assumed).

garbage_can_model_NetLogo.jpg

Release Notes

v 1.0

Associated Publications

This release is out-of-date. The latest version is 1.1.0

Garbage can model NetLogo implementation 1.0.0

Submitted by Smarzhevskiy Ivan Published Feb 14, 2016 Last modified Jul 30, 2019
garbage can model problem decision maker decision access structure decision structure NetLogo

The concept of GCM is decision making, which resolve Problems. Problems have Energy Required (ER) for their decision, Managers (decision makers) have Effective Energy (EE) for the decisions generation. The place of decision-making is the Choice Opportunities (Choices) - abstraction of commitees, consul boards and so on.
The Choices and Problems open randomly. The Problems activated by two items and Choices by one item per step of modellig (tick) in first halfe of modelling time. All Managers are ready for action from first modelling step.
Problems and Managers access to Choices in according with system structrure. There is three types of Problems access to Choices and three types of Managers access to Choices.
Presented model literally reproduces the original logic of GCM (with one exception: the equal effective energy distribution between managers assumed).

Release Notes

v 1.0

Cite this Model

Smarzhevskiy Ivan (2016, February 14). “Garbage can model NetLogo implementation” (Version 1.0.0). CoMSES Computational Model Library. Retrieved from: https://www.comses.net/codebases/4892/releases/1.0.0/

Replication of a previously described model

Cohen, Michael, James March, and Johan Olsen. 1972. “A Garbage Can Model of Organizational Choice.” Administrative Science Quarterly 17 (March): 1-25.

Create an Open Code Badge that links to this model more info

This model has not been reviewed by CoMSES Net and should be independently reviewed to meet the Open Code Badge guidelines.
You can use the following HTML or Markdown code to create an Open Code Badge that links to version 1.0.0 of this computational model. 

<a href="https://www.comses.net/codebases/4892/releases/1.0.0/">
  <img height="100" src="https://miracle.comses.net/static/images/icons/open-code-badge.svg" alt="Open Code Badge">
</a>


[![Open Code Badge](https://miracle.comses.net/static/images/icons/open-code-badge.svg)](https://www.comses.net/codebases/4892/releases/1.0.0/)
Contributors
Smarzhevskiy Ivan
DOI
No assigned DOI
Model Version
1.0.0
License
GPL-2.0
Programming Language
Logo
Software Framework
NetLogo
Operating System
Windows
Publish Date
Sunday, February 14, 2016
Last Updated
Monday, February 19, 2018
Downloads 603
This release has not been reviewed but a different version has passed peer review.
Version Submitter First published Last modified Status
1.1.0 Smarzhevskiy Ivan Tue Jul 30 06:37:58 2019 Thu Sep 12 17:16:01 2019 Published Peer Reviewed https://doi.org/10.25937/3fn0-4h60
1.0.0 Smarzhevskiy Ivan Sun Feb 14 20:58:39 2016 Mon Feb 19 23:14:19 2018 Published

Discussion

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.
Accept