NetLogo User Community Models

(back to the NetLogo User Community Models)

Download If clicking does not initiate a download, try right clicking or control clicking and choosing "Save" or "Download".(The run link is disabled for this model because it was made in a version prior to NetLogo 6.0, which NetLogo Web requires.)

WHAT IS IT?

The "Garbage Can" is a model of organizational decision-making. In the Garbage Can model, decision is made when the members of an organization apply a solution to an opportunity for making a choice. Note that solutions exist before problems, and that decisions can be made even without solving any problem. Eventually, a problem may be there to be solved, but this is not necessarily the case.

In this model, choice opportunities take the role of "garbage cans" where solutions and problems are dumped. Organizations whose processes of decision-making follow the Garbage Can model are called "organized anarchies".

There are four classes of agents in this model: participants, choice opportunities, solutions and problems. The number of participants measures the size of an organization by means of its members. The number of choice opportunities, henceforth "opportunities", measures the frequency by which decisions are made in the organization, e.g. whether contracts are signed every year or every five years. The number of solutions measures the variety of theories, schemata, mental models and frames available in the organization, each of which suggests a particular solution to a decision problem. Finally, the number of problems measures the difficulties actually encountered by the organization.

An organization starts its life with a given number of participants, choice opportunities, solutions and problems. These initial values are set by means of the parameters "initial-number-of-participants", "initial-number-of-opportunities", initial-number-of-solutions" and "initial-number-of-problems", respectively. These parameters may take any integer value greater or equal than zero.

Eventually, an organization may want to attract or expel participants, opportunities, solutions and problems in the course of its life. The corresponding net input-output flows are set by means of the parameters "net-flow-of-participants", "net-flow-of-opportunities", "net-flow-of-solutions" and "net-flow-of-problems", respectively. If these parameters are greater than zero, the organization attracts participants, choice opportunities, solutions or problems. If these parameters are less than zero, the organization expels participants, choice opportunities, solutions or problems into the environment. If these parameters are zero, the flows between the organization and its environment compensate one another. Since, as we shall see, an organization may destroy participants, opportunities, solutions or problems in order to make a decision, the net flows of these three classes of agents may be required to be positive in order for an organization to be viable in the long run.

The parameters "net-flow-of-participants", "net-flow-of-opportunities", "net-flow-of-solutions" and "net-flow-of-problems" take values in the [-5, 5] interval in decimal steps. If they take integer values, they denote the number of participants, opportunities, solutions or problems that enter or exit the organization at each step. If they have a decimal component, this denotes an additional number of agents that enter or exit the organization every 10 steps. For instance, "net-flow-of-participants = 3.4" means that in general 3 participants enter the organization at every time step, but 7 participants enter the organization every ten time steps.

The switches "stop-flow-par-at", "stop-flow-opp-at", "stop-flow-sol-at" and "stop-flow-pro-at" enable the user to stop these flows after a selected number of simulation steps. These parameters are ineffective when they are set to zero.

Participants, opportunities, solutions and problems may be required to exit the organization after decision-making. This option is chosen by means of the parameters "participants-exit?", "opportunities-exit?", "solutions-exit?" and "problems-exit?", respectively.

If the switch "participants-exit?" is ON, on each patch where a decision is made, all participants exit. This reflects the idea that all of them are involved in decision-making, be it resolution or overflight.

If the switch "opportunities-exit?" is ON, on each patch where a decision is made only one opportunity exits. This is chosen at random among the opportunities on the patch. The underlying idea is that decision-making requires only one choice opportunity.

If the switch "solutions-exit?" is ON, on each patch where a decision is made only one solution exits. The underlying idea is that even when decision-making involves many participants and solves several problems, only one solution is applied. If the decision is made by resolution, the chosen solution is the one with highest efficiency. If the decision is made by oversight, a solution is selected at random among those on the patch.

Finally, the switch "problems-exit?" is only effective when decisions are made by resolution. If it is ON, all problems on patches where a decision is made, exit.

The four monitors "participants", "opportunities", "solutions" and "problems" report the cumulative number of the corresponding agents. They reflect both net flows and deaths.

Participants, choice opportunities, solutions and problems walk freely on the model space if both "decision-structure = 0" and "access-structure = 0". If "decision-structure = 1" participants and choice opportunities are ranked in order of importance and participants are only allowed to move on to opportunities of less or equal importance. If "decision-structure = 2" participants are only allowed to move on to opportunities of equal importance. If "access-structure = 1" problems and opportunities are ranked in order of importance and problems are only allowed to move on to opportunities of less or equal importance. If "access-structure = 2" problems are only allowed to move on to opportunities of equal importance.

Participants are endowed with "energy", which denotes their personal ability in solving
problems. Problems are endowed with "energy" as well, which denotes their difficulty
to be solved. Solutions are endowed with "efficiency", a parameter which is applied to the energy of participants to yield their strength in solving problems. The sliders "show-energy-par?", "show-energy-pro?" and "show-efficiency?" allow to visualize energy and efficiency values of participants, problems and solutions, respectively.

Energy and efficiency take values within a range specified by the sliders "min-energy-par" and "max-energy-par", "min-energy-pro" and "max-energy-pro", "min-efficiency-sol" and "max-efficiency-sol". They may be assigned to participants, problems and solutions following three criteria that can be chosen by means of the slider "dist-energy-par", "dist-energy-pro" and "dist-efficiency", respectively:

0)
The participants, problems or solutions with lowest identification number (conventionally, the most important participants, problems and solutions in the organization) receive the lowest values of energy or efficiency;

1)
The values of energy and efficiency are assigned at random according to a uniform distribution that spans the range between minimum and maximum values;

2)
The participants, problems or solutions with lowest identification number (conventionally, the most important participants, problems and solutions in the organization) receive the highest values of energy or efficiency.

A problem is solved when a participant has enough personal energy and a sufficiently efficient solution such that their product is greater or equal to the energy of the problem. Intuitively, this process is analogous to that of a machine that transforms potential energy into kinetic energy. For instance, a car extracts potential energy from gasoline (the "energy" of the decision-maker) wasting a certain fraction of it (the "efficiency" of the solution) in order to cover a distance (the "energy" of the problem). When problems are solved, decision is made "by resolution".

However, a key feature of the Garbage Can model is that a lot of decision-making may not solve any problem at all. For instance, choice opportunities may be used as showrooms in corporate politics rather than as occasions to solve problems. In these cases, decision is made "by oversight". In the model, decision-making takes place when participants, choice opportunities, solutions and eventually problems happen to be on the same patch.

Participants, choice opportunities, solutions and problems walk freely on the model space if both "decision-structure = 0" and "access-structure = 0". If "decision-structure = 1" participants and choice opportunities are ranked in order of importance and participants are only allowed to move on to opportunities of less or equal importance. If "decision-structure = 2" participants are only allowed to move on to opportunities of equal importance. If "access-structure = 1" problems and opportunities are ranked in order of importance and problems are only allowed to move on to opportunities of less or equal importance. If "access-structure = 2" problems are only allowed to move on to opportunities of equal importance.

Decision-making by resolution takes place when at least one participant, at least one choice opportunity, at least one solution, at least one problem are on the same patch and the sum of the energies of the participants on the patch, multiplied by the efficiency of the most efficient solution on the patch, is greater or equal to the sum of the energies of the problems on the patch. Most often, decision-making by resolution occurs when just one participant, one choice opportunity, one solution and one problem happen to be on the same patch and the energy of the participant, multiplied by the efficiency of the solution that she is using, is greater or equal to the energy of the problem.

Decision-making by oversight takes place when at least one participant, at least one choice opportunity and at least one solution are on the same patch. No problem must be there to be solved, and no energy balance is required. Thus, decision-making by oversight occurs most often when a participant, a solution and a choice opportunity happen to be on the same patch.

The monitor "Decisions by Resolution" reports the cumulative number of decisions that are made by resolution. The monitor "Decisions by Oversight" reports the cumulative number of decisions that are made by oversight. The graph reports the number of decisions by resolution and by oversight that are made at each tick.

If problems are on a patch with participants, solutions and choice opportunities, but the energy of the participants and the efficiency of the solutions is not sufficient to solve the problems, all agents on the patch are blocked and no decision is made. However, if there is more than one choice opportunity on the patch, or if an additional opportunity just walks on a patch where decision is blocked, then an opportunity takes away the problem with the highest energy and walks together with it until they find a participant and a solution that are able to solve the problem. This is called a "flight". Since the most difficult problem left, the blocked participants may now be able to make a decision, either by resolution or by oversight.

Flight is very important in organizational decision-making. It represents all situations where a difficult problem is either postponed, or passed on to other decision-makers.

The monitor "Total Flights" reports the cumulative number of times that a problem flied away with another opportunity. Sometimes, a flight enables decision-making for the remaining agents. The monitor "Flights that cause Resolutions" reports the number of flights that enabled decision-making by resolution. The monitor "Flights that cause Oversights" reports the number of flights that enabled decision-making by oversight. Thus, the sum of "Flights that cause Resolutions" and "Flights that cause Oversights" is less or equal to "Total Flights". Note that, since decision is made one tick after a flight, the decisions caused by a flight may not reflect in the monitors "Decisions by Resolution" and "Decisions by Oversight" if the simulation is stopped just after a flight. Also note that, if "decision-structure" and "access-structure" are not set to 0, it may happen that an opportunity hinders the way of an opportunity that wants to fly. In this (very unlikely) case, the monitors "Flights that cause Resolutions" and "Flights that cause oversights" do not actually cause flights or oversights, respectively.

The Garbage Can model comes with the following indicators:

Problem Jumps
The number of times a problem jumps from one opportunity onto another one. This indicator is equivalent to the number of flights; it has been added for compatibility with Cohen, March and Olsen's model.

Problem Bindings
The length of time a problem cannot be solved, either because it is bound to participants with too low energy or because it is flying away with an opportunity, summed over all problems.

Problem Latency
The length of time a problem is not bound to an opportunity, summed over all problems.

Unsolved Problems
If problems exit when a decision is made, then the number of problems in the simulation denotes the number of unresolved problems. This indicator is not available if the parameter "problems-exit?" is OFF.

Participant Jumps
The number of times a participant leaves an opportunity after staying some time with it. This happens because of a flight. However, this indicator is not equivalent to the number of flights that cause decision-making because several participents may be involved.

Participant Bindings
The length of time a participant cannot make a decision because involved in problems for which she does not have sufficient energy, summed over all participants.

Used Energy
The cumulative energy used by all participants involved in decision-making, both by resolution and by oversight.

Excess Energy
The difference between the cumulative energy used by all participants who resolved problems, multiplied by the efficiency of the solution that they employed, and the cumulative energy of all the problems that they solved.

Unexploited Opportunities
If opportunities exit when a decision is made, then the number of opportunities in the simulation denotes the number of unexploited occasions for making a choice. This indicator is not available if the parameter "opportunities-exit?" is OFF.

Waiting Time
If opportunities exit when a decision is made, then the time they spend in the organization measures the time before a decision was made. This indicator is the cumulative lifespan summed over all opportunities. It is not available if the parameter "opportunities-exit?" is OFF.

Furthermore, the fraction of decisions made by oversight and resolution is disaggregated with respect to the importance of choice opportunities. If the decision structure is either hierarchical or specialized participants have a degree of importance, meaning that only certain participants are allowed to make use of certain opportunities. Likewise, if the access structure is either hierarchical or specialized problems have a degree of importance, meaning that only certain problems gain access to certain choice opportunities. In both cases, choice opportunities need to be ordered by their importance as well. Thus, the importance of choice opportunities can be used to rank decision-making both when the decision structure is hierarchical or specialized and when the access structure is hierarchical or specialized.

The degree of importance of opportunities, just like the degree of importance of participants and problems, is indicated by their identification number. The lowest numbered opportunities are the most important ones. Since the number of opportunities may vary during a simulation, classes of importance are defined in percent terms with respect to the current population of opportunities. Four classes are defined, entailing one fourth of all opportunities each.

The indicators that appear at the bottom right of the interface have the following meaning:
- %O-I reports the percent of decisions by oversight over total decisions, that are made on opportunities in first class of importance. Class I entails one fourth of all opportunities, the most important ones.
- %O-II reports the percent of decisions by oversight over total decisions, that are made on opportunities in the second class of importance. Class II entails one fourth of all opportunities, just less important than those of class I.
- %O-III reports the percent of decisions by oversight over total decisions, that are made on opportunities in the third class of importance. Class III entails one fourth of all opportunities, less important than those of class II and yet not the least important ones.
- %O-IV reports the percent of decisions by oversight over total decisions, that are made on opportunities in the fourth class of importance. Class IV entails one fourth of all opportunities, the least important ones.
- %R-I reports the percent of decisions by resolution over total decisions, that are made on opportunities in first class of importance. Class I entails one fourth of all opportunities, the most important ones.
- %R-II reports the percent of decisions by resolution over total decisions, that are made on opportunities in the second class of importance. Class II entails one fourth of all opportunities, just less important than those of class I.
- %R-III reports the percent of decisions by resolution over total decisions, that are made on opportunities in the third class of importance. Class III entails one fourth of all opportunities, less important than those of class II and yet not the least important ones.
- %R-IV reports the percent of decisions by resolution over total decisions, that are made on opportunities in the fourth class of importance. Class IV entails one fourth of all opportunities, the least important ones.

These indicators are not available if opportunities do not exit after decision-making or both the decision structure and the access structure are non segmented. Even if these conditions are satisfied, they remain unavailable until at least one decision is made.

Additional information on decision-making can be obtained by switching on "show-details?". If "show-details?" is ON, each time a decision is made a line is printed on the Command Center. Each line says whether the decision was made by oversight or resolution, which agents it involved according to current numbering, which was their identification number at the time they were created as well as the time step when they were created. If the simulation stops because the step specified by "stops-at" is reached, information on the current and original identification numbers of surviving agents is written on the Command Center. If this option is chosen it is advisable to enlarge the Command Center.

Finally, the following graphs are available:
- Current number of decisions by resolution, current number of decisions by oversight and current number of flights at each simulation step;
- Total potential energy available to participants, total effective energy available to participants and total energy required by problems at each simulation step. Total effective energy is defined as the total potential energy multiplied by the average of the efficiency of solutions.

HOW TO USE IT

The population of participants, opportunities, solutions and problems should collectively not exceed 1000 units, unless the simulation space is enlarged. Conversely, at least a few tens of each breed are needed in order to obtain interesting outcomes.

The energy of problems should not be too different to the energy of participants multiplied by the efficiency of solutions. Depending on energy configuration, maximum differences of one or two units are recommended.

With hierarchical or specialized decision structures or access structures, the number of decisions and particularly the number of decisions by resolution tends to be small. Thus, it is advisable to run the model with many opportunities, many problems, sufficiently high values of participant energy, sufficiently high values of solution efficiency and sufficiently low values of problem energy.

THINGS TO NOTICE

The most important and most robust conclusion of the Garbage Can model is that most decisions are made by oversight, few problems are solved and flight is widespread. A large number of flights do not cause decision-making. Most, but not all configurations are such that flights cause decisions by oversight are many more than the flights causing decisions by resolution.

The energy of problems affects all the above indicators, all of which measure some aspect of the difficulty of decision-making. Energy distribution influences the outcome of decision-making as well.

Another interesting conclusion is that the most important opportunities are less likely to solve problems than the least important opportunities. This can be seen by experimenting with hierarchical decision and access structures.

THINGS TO TRY

The default values of parameters have been chosen in order to resemble the original model by Cohen, March and Olsen as closely as possible. The user is invited to move away fron default values exploring alternative combinations.

The user can try different combinations of:
1)
Population, through the initial number of participants, opportunities, solutions and problems, their flows in or out of the organization and the time when these flows stop;
2)
Structures of interaction, through the decision structure and the access structure;
3)
Energy endowments, through minimum and maximum values as well as their distribution.

EXTENDING THE MODEL

In this version of the Garbage Can, the number of agents is exogenous. It might be interesting to devise an evolutionary dynamics of participants, opportunities, solutions and problems.

NETLOGO FEATURES

Note the extensive use of the instruction "without-interruption". This is needed in order to execute a series of instructions sequentially. For instance, a NetLogo code like this:

repeat N [
instruction A
instruction B
]

is equivalent to the following Java or C/C++ code:

for (i=0; i<N; i++)
instruction A
for (i=0; i<N; i++)
instruction B

If you want to write in NetLogo anything like:

for (i=0; i<N; i++) {
instruction A
instruction B
}

then you have to write:

repeat N [
without-interruption [
instruction A
instruction B
]
]

CREDITS AND REFERENCES

Cohen M.D. March J.G. and Olsen J.P. "A Garbage Can Model of Organizational Choice".
Administrative Science Quarterly, 17 (1972): 1-25.

This model was built by:
Guido Fioretti
University of Bologna
Department of Computer Science