Abstract
Certain tasks undertaken by groups using Group Decision Support Systems (GDSS) can be viewed as search problems. These tasks involve arriving at a solution or decision where the problem is complex enough to warrant the use of computerized decision support tools. For these types of GDSS tasks, we propose to model the information exchange and convergence toward a solution by the group as a simple genetic algorithm. The simple genetic algorithm is a generalized search technique that is based on the
principles of evolution and natural selection. Simply put, the best points in the current population are more
likely to be selected and combined through genetic operators to determine new points. We propose that
groups using GDSS to address certain tasks behave like a simple genetic algorithm in the manner in which
possible solutions are generated, enhanced and altered in attempting to reach a decision or consensus.
