Group decision support systems (GDSSs) are computer-assisted collaborative work software that facilitates group meetings asynchronously and from different locations. Even so, collaborative work in GDSS demands coordination provided by a single controlling entity known as the GDSS facilitator. However, the problem of electing a GDSS Facilitator hasn’t been treated enough in the literature, and it is often neglected. Despite that, the large number of responsibilities assigned to the facilitator makes his role crucial to the effectiveness of the group meeting. Thus, the authors focused on finding an appropriate approach for electing the facilitator. The similarities between the problematics of electing a GDSS facilitator and a distributed system leader led the authors to consider applying a distributed election algorithm for electing a GDSS facilitator. Nonetheless, current algorithms only consider computer criteria and lack a formal weighting method. Consequently, we proposed a new distributed election algorithm called GFEA (GDSS Facilitator Election Algorithm) that is designed to choose a facilitator within a GDSS. This algorithm selects a facilitator among a set of decision-makers based on multiple election criteria weighted using an objective weighting method called MEREC. A backup leader is reserved to replace the leader if he fails, and a new tie-breaking mechanism is proposed. Moreover, the initiator failure is handled. By adopting distributed system leader election principles, GFEA provides a robust solution for a decisive GDSS challenge
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.