Using a Computational Approach for Generalizing a Consensus Measure to Likert Scales of Any Size

There are many consensus measures that can be computed using Likert data. Although these measures should work with any number n of choices on the Likert scale, the measurements have been most widely studied and demonstrated for n = 5 . One measure of consensus introduced by Akiyama et al. for n = 5 and theoretically generalized to all n depends on both the mean and variance and gives results that can differentiate between some group consensus behavior patterns better than other measures that rely on either just the mean or just the variance separately. However, this measure is more complicated and not easy to apply and understand. This paper addresses these two common problems by introducing a new computational method to find the measure of consensus that works for any number of Likert item choices. The novelty of the approach is that it uses computational methods in -dimensional space. Numerical examples in three-dimensional (for n=6) and four-dimensional (for n=7) spaces are provided in this paper to assure the agreement of the computational and theoretical approach outputs.