# Potentially all pairwise rankings of all possible alternatives

Potentially All Pairwise RanKings of all possible Alternatives (PAPRIKA) is a method for multi-criteria decision making (MCDM) or conjoint analysis, as implemented by decision-making software and conjoint analysis products 1000minds and MeenyMo.
The PAPRIKA method is based on users expressing their preferences with respect to the relative importance of the criteria or attributes of interest for the decision or choice at hand by pairwise comparing (ranking) alternatives.
In MCDM applications, PAPRIKA is used by decision-makers to determine weights on the criteria for the decision being made, representing their relative importance. Depending on the application, these weights are used to rank, prioritize or choose between alternatives.
In conjoint analysis applications, PAPRIKA is used with consumers or other stakeholders to estimate 'part-worth utilities' (i.e. weights) representing the relative importance of the attributes characterizing products or other objects of interest (i.e., choice modelling, conjoint analysis and discrete choice).

## Applications

The PAPRIKA method is implemented by decision-making software and conjoint analysis products 1000minds and MeenyMo.
Examples of areas in which the method is used for multi-criteria decision making or conjoint analysis include (see also 1000minds applications):
* Patient and health technology prioritization
* Disease diagnosis and classification
* Clinical guidelines development
* Disease R&D prioritization
* Marketing research (conjoint analysis)
* Environmental resources management and climate change research
* Animal and plant breeding
* Urban planning and waste management
* Information and communications technology (ICT)
* Research into monetary policy, retirement income policies and charitable giving

## Additive multi-attribute value models

The PAPRIKA method specifically applies to additive multi-attribute value models with performance categories – also known as 'points', 'scoring', 'point-count' or 'linear' systems or models. The following explanations are mostly couched in terms of multi-criteria decision making. Analogous explanations in terms of conjoint analysis are possible but not presented here.
As the name implies, additive multi-attribute value models with performance categories – hereinafter referred to simply as 'value models' – consist of multiple criteria (or 'attributes'), with two or more performance categories (or 'levels') within each criterion, that are combined additively.
Each category within each criterion is worth a certain number of points that is intended to reflect both the relative importance ('weight') of the criterion and its degree of achievement. For each alternative being considered, the point values are summed across the criteria to get a total score – hence, these are additive value models – by which the alternatives are prioritized or ranked (or otherwise classified) relative to each other.
Thus, a value model (or 'points system') is simply a schedule of criteria (and categories) and point values for the decision problem at hand; for an example, see Table 1 in the sub-section below. This 'points system' representation is equivalent to a more traditional approach involving normalized criterion weights and 'single-criterion value functions' to represent the relative importance of the criteria and to combine values overall (see weighted sum model). The unweighted points system representation is easier to use and helps inform the explanation of the PAPRIKA method below.

### An example application of a points system

An example application of a points system is ranking candidates applying for a job.
Imagine that 'Maartje', 'Michelle' and 'Paulien' are three job candidates to be ranked using the value model in Table 1 below. Suppose they are assessed on the five criteria (see Table 1) like this:
* Maartje's education is excellent, she has > 5 years of experience, and her references, social skills and enthusiasm are all poor.
* Michelle's education is poor, she has 2–5 years of experience, and her references, social skills and enthusiasm are all good.
* Paulien's education is good, she has < 2 years of experience, and her references, social skills and enthusiasm are all good.
Table 1: Example of a value model (points system) for ranking job candidates
| Criterion | Category | Points |
| Education | poor | 0 |
| | good | 8 |
| | very good | 20 |
| | excellent | 40 |
| Experience | < 2 years | 0 |
| | 2–5 years | 3 |
| | > 5 years | 10 |
| References | poor | 0 |
| | good | 27 |
| Social skills | poor | 0 |
| | good | 10 |
| Enthusiasm | poor | 0 |
| | good | 13 |
Summing the point values in Table 1 corresponding to the descriptions for Maartje, Michelle and Paulien gives their total scores:
* Maartje's total score = 40 + 10 + 0 + 0 + 0 = 50 points
* Michelle's total score = 0 + 3 + 27 + 10 + 13 = 53 points
* Paulien's total score = 8 + 0 + 27 + 10 + 13 = 58 points
Clearly, Paulien has the highest total score. Therefore, according to the value model (and how Maartje, Michelle and Paulien were assessed) Paulien is the best candidate for the job. (Though, clearly, relative to other candidates who could potentially have applied, Paulien is not as good as the best hypothetically-possible candidate – who would score a 'perfect' 40 + 10 + 27 + 10 + 13 = 100 points.)
In general terms, having specified the criteria and categories for a given value model, the challenge is to derive point values that accurately reflect the relative importance of the criteria and categories to the decision-maker. Deriving valid and reliable point values is arguably the most difficult task when creating a value model. The PAPRIKA method does this based on decision-makers' preferences as expressed using pairwise rankings of alternatives.

## Overview of the PAPRIKA method

As mentioned at the start of the article, PAPRIKA is a (partial) acronym for 'Potentially All Pairwise RanKings of all possible Alternatives'. The following explanation should make clear this name's derivation.
The PAPRIKA method pertains to value models for ranking particular alternatives that are known to decision-makers (e.g. as in the job candidates example above) and also to models for ranking potentially all hypothetically possible alternatives in a pool that is changing over time (e.g. patients presenting for medical care). The following explanation is centered on this second type of application because it is more general.
PAPRIKA is based on the fundamental principle that an overall ranking of all possible alternatives representable by a given value model – i.e. all possible combinations of the categories on the criteria – is defined when all pairwise rankings of the alternatives vis-à-vis each other are known (and provided the rankings are consistent).
(As an analogy, suppose you wanted to rank everyone living in a given city from the youngest to the oldest. If you knew how each person was pairwise ranked relative to everyone else with respect to their ages – i.e. for each possible pair of individuals, you identified who is the younger of the two individuals or that they're the same age – then you could produce an overall ranking of the city's population from the youngest to the oldest.)
However, depending on the number of criteria and categories included in the value model, the number of pairwise rankings of all possible alternatives is potentially in the millions or even billions. Of course, though, many of these pairwise rankings are automatically resolved due to one alternative in the pair having a higher category for at least one criterion and none lower for the other criteria than for the other alternative – known as 'dominated pairs'.
But this still leaves potentially millions or billions of 'undominated pairs' – pairs of alternatives where one has a higher ranked category for at least one criterion and a lower ranked category for at least one other criterion than the other alternative – and hence a judgment is required for the alternatives to be pairwise ranked. With reference to the example of ranking job candidates in the previous section, an example of an undominated pair (of candidates) would be where one person in the pair is, say, highly educated but inexperienced whereas the other person is uneducated but highly experienced, and so a judgement is required to pairwise rank this (undominated) pair.
For n possible alternatives, there are n(n−1)/2 pairwise rankings. For example, for a value model with eight criteria and four categories within each criterion, and hence 4$^8$ = 65,536 possible alternatives, there are 65,536 x 65,535 / 2 = 2,147,450,880 pairwise rankings. Even after eliminating the 99,934,464 dominated pairs, there are still 2,047,516,416 undominated pairs to be ranked. Clearly, performing anywhere near this number of pairwise rankings – more than two billion! – is humanly impossible without a special method.
The PAPRIKA method resolves this 'impossibility' problem by ensuring that the number of pairwise rankings that decision-makers need to perform is kept to a minimum – i.e. only a small fraction of the potentially millions or billions of undominated pairs – so that the burden on decision-makers is minimized and the method is practicable. PAPRIKA keeps the number of pairwise rankings performed by decision-makers to a minimum by, for each undominated pair explicitly ranked by decision-makers, identifying (and eliminating) all undominated pairs implicitly ranked as corollaries of this and other explicitly ranked pairs. Fundamental to the efficiency of the method is application of the transitivity property of additive value models, as illustrated in the simple demonstration later below.
The PAPRIKA method begins with the decision-maker pairwise ranking undominated pairs defined on just two criteria at-a-time (where, in effect, all other criteria's categories are pairwise identical). Again with reference to the example of ranking job candidates, an example of such a pairwise-ranking question is: "Who would you prefer to hire, someone whose education is poor but he or she has 5 years or more experience or another person whose education is excellent but he or she has less than 2 years experience, all else being equal?" (see Figure 1).
Figure 1: Example of a pairwise-ranking question (a screenshot from 1000minds)
Each time the decision-maker ranks a pair (such as the example above), all undominated pairs implicitly ranked as corollaries are identified and discarded. After having completed ranking undominated pairs defined on just two criteria at-a-time, this is followed, if the decision-maker chooses to continue (she can stop at any time), by pairs with successively more criteria (i.e. three criteria, then four, then five, etc.), until potentially all undominated pairs are ranked.
Thus, Potentially All Pairwise RanKings of all possible Alternatives (hence the PAPRIKA acronym) are identified as either: (1) dominated pairs (given), or (2) undominated pairs explicitly ranked by the decision-maker, or (3) undominated pairs implicitly ranked as corollaries. From the explicitly ranked pairs, point values (weights) are obtained via linear programming; although multiple solutions to the linear program are possible, the resulting point values all reproduce the same overall ranking of alternatives.
Simulations of PAPRIKA's use reveal that if the decision-maker stops after having ranked undominated pairs defined on just two criteria at-a-time, the resulting overall ranking of all possible alternatives is very highly correlated with the decision-maker's 'true' overall ranking obtained if all undominated pairs (involving more than two criteria) were ranked.
Therefore, for most practical purposes decision-makers are unlikely to need to rank pairs defined on more than two criteria, thereby reducing the burden on decision-makers. For example, approximately 95 explicit pairwise rankings are required for the value model referred to above with eight criteria and four categories each (and 2,047,516,416 undominated pairs to be ranked); 25 pairwise rankings for a model with five criteria and three categories each; and so on. The real-world applications of PAPRIKA referred to earlier suggest that decision-makers are able to rank comfortably more than 50 and up to at least 100 pairs, and relatively quickly, and that this is sufficient for most applications.

## Theoretical antecedents

The PAPRIKA method's closest theoretical antecedent is Pairwise Trade-off Analysis, a precursor to Adaptive Conjoint Analysis in marketing research. Like the PAPRIKA method, Pairwise Trade-off Analysis is based on the idea that undominated pairs that are explicitly ranked by the decision-maker can be used to implicitly rank other undominated pairs. Pairwise Trade-off Analysis was abandoned in the late 1970s, however, because it lacked a method for systematically identifying implicitly ranked pairs.
The ZAPROS method (from Russian for 'Closed Procedure Near References Situations') was also proposed; however, with respect to pairwise ranking all undominated pairs defined on two criteria "it is not efficient to try to obtain full information". As explained in the present article, the PAPRIKA method overcomes this efficiency problem.

## A simple demonstration of the PAPRIKA method

The PAPRIKA method can be easily demonstrated via the simple example of determining the point values (weights) on the criteria for a value model with just three criteria – denoted by 'a', 'b' and 'c' – and two categories within each criterion – '1' and '2', where 2 is the higher ranked category.
This value model's six-point values (two for each criterion) can be represented by the variables a1, a2, b1, b2, c1, c2 (a2 > a1, b2 > b1, c2 > c1), and the eight possible alternatives (2$^3$ = 8) as ordered triples of the categories on the criteria (abc): 222, 221, 212, 122, 211, 121, 112, 111. These eight alternatives and their total score equations – derived by simply adding up the variables corresponding to the point values (which are as yet unknown: to be determined by the method being demonstrated here) – are listed in Table 2.
Undominated pairs are represented as '221 vs (versus) 212' or, in terms of the total score equations, as 'a2 + b2 + c1 vs a2 + b1 + c2', etc. [Recall, as explained earlier, an 'undominated pair' is a pair of alternatives where one is characterized by a higher ranked category for at least one criterion and a lower ranked category for at least one other criterion than the other alternative, and hence a judgement is required for the alternatives to be pairwise ranked. Conversely, the alternatives in a 'dominated pair' (e.g. 121 vs 111 – corresponding to a1 + b2 + c1 vs a1 + b1 + c1) are inherently pairwise ranked due to one having a higher category for at least one criterion and none lower for the other criteria (and no matter what the point values are, given a2 > a1, b2 > b1 and c2 > c1, the pairwise ranking will always be the same).]
'Scoring' this model involves determining the values of the six-point value variables (a1, a2, b1, b2, c1, c2) so that the decision-maker's preferred ranking of the eight alternatives is realized.
For many readers, this simple value model can perhaps be made more concrete by considering an example to which most people can probably relate: a model for ranking job candidates consisting of the three criteria (for example) (a) education, (b) experience, and (c) references, each with two 'performance' categories, (1) poor or (2) good. (This is a simplified version of the illustrative value model in Table 1 earlier in the article.)
Accordingly, each of this model's eight possible alternatives can be thought of as being a 'type' (or profile) of candidate who might ever, hypothetically, apply. For example, '222' denotes a candidate who is good on all three criteria; '221' is a candidate who is good on education and experience but poor on references; '212' a third who is good on education, poor on experience, and good on references; etc.
Finally, with respect to undominated pairs, 221 vs 212, for example, represents candidate 221 who has good experience and poor references whereas 212 has the opposite characteristics (and they both have good education). Thus, which is the better candidate ultimately depends on the decision-maker's preferences with respect to the relative importance of experience vis-à-vis references.
Table 2: The eight possible alternatives and their total-score equations
| Alternative | Total-score equation |
| 222 | a2 + b2 + c2 |
| 221 | a2 + b2 + c1 |
| 212 | a2 + b1 + c2 |
| 122 | a1 + b2 + c2 |
| 211 | a2 + b1 + c1 |
| 121 | a1 + b2 + c1 |
| 112 | a1 + b1 + c2 |
| 111 | a1 + b1 + c1 |

### Identifying undominated pairs

The PAPRIKA method's first step is to identify the undominated pairs. With just eight alternatives this can be done by pairwise comparing all of them vis-à-vis each other and discarding dominated pairs.
This simple approach can be represented by the matrix in Figure 2, where the eight possible alternatives (in bold) are listed down the left-hand side and also along the top. Each alternative on the left-hand side is pairwise compared with each alternative along the top with respect to which of the two alternatives is higher ranked (i.e. in the present example, which candidate is more desirable for the job). The cells with hats (^) denote dominated pairs (where no judgement is required) and the empty cells are either the central diagonal (each alternative pairwise ranked against itself) or the inverse of the non-empty cells containing the undominated pairs (where a judgement is required).
Figure 2: Undominated pairs identified by pairwise comparing the eight possible alternatives (bolded)
| vs | 221 | 212 | 122 | 112 | 121 | 211 | 111 |
| 222 | ^ | ^ | ^ | ^ | ^ | ^ | ^ |
| 221 | | (i) b2 + c1 vs b1 + c2 | (ii) a2 + c1 vs a1 + c2 | (iv) a2 + b2 + c1 vs a1 + b1 + c2 | ^ | ^ | ^ |
| 212 | | | (iii) a2 + b1 vs a1 + b2 | ^ | (v) a2 + b1 + c2 vs a1 + b2 + c1 | ^ | ^ |
| 122 | | | | ^ | ^ | (vi) a1 + b2 + c2 vs a2 + b1 + c1 | ^ |
| 112 | | | | | (*i) b1 + c2 vs b2 + c1 | (*ii) a1 + c2 vs a2 + c1 | ^ |
| 121 | | | | | | (*iii) a1 + b2 vs a2 + b1 | ^ |
| 211 | | | | | | | ^ |
| 111 | | | | | | | |
Figure 2 notes: ^ denotes dominated pairs. The undominated pairs are labelled with Roman numerals; the three with asterisks are duplicates of pairs (i)-(iii).
As summarized in Figure 2, there are nine undominated pairs (labelled with Roman numerals). However, three pairs are duplicates after any variables common to a pair are 'cancelled' (e.g. pair *i is a duplicate of pair i, etc.). Thus, there are six unique undominated pairs (without asterisks in Figure 2, and listed later below).
The cancellation of variables common to undominated pairs can be illustrated as follows. When comparing alternatives 121 and 112, for example, a1 can be subtracted from both sides of a1 + b2 + c1 vs a1 + b1 + c2. Similarly, when comparing 221 and 212, a2 can be subtracted from both sides of a2 + b2 + c1 vs a2 + b1 + c2. For both pairs this leaves the same 'cancelled' form: b2 + c1 vs b1 + c2.
Formally, these subtractions reflect the 'joint-factor' independence property of additive value models: the ranking of undominated pairs (in uncancelled form) is independent of their tied rankings on one or more criteria. Notationally, undominated pairs in their cancelled forms, like b2 + c1 vs b1 + c2, are also representable as _21 vs _12 – i.e. where '_' signifies identical categories for the identified criterion.
In summary, here are the six undominated pairs for the value model:
    (i) b2 + c1 vs b1 + c2
    (ii) a2 + c1 vs a1 + c2
    (iii) a2 + b1 vs a1 + b2
    (iv) a2 + b2 + c1 vs a1 + b1 + c2
    (v) a2 + b1 + c2 vs a1 + b2 + c1
    (vi) a1 + b2 + c2 vs a2 + b1 + c1
The task is to pairwise rank these six undominated pairs, with the objective that the decision-maker is required to perform the fewest pairwise rankings possible (thereby minimizing the burden on the decision-maker).

### Ranking undominated pairs and identifying implicitly ranked pairs

Undominated pairs with just two criteria are intrinsically the least cognitively difficult for the decision-maker to pairwise rank relative to pairs with more criteria. Thus, arbitrarily beginning here with pair (i) b2 + c1 vs b1 + c2, the decision-maker is asked: "Which alternative do you prefer, _21 or _12 (i.e. given they're identical on criterion a), or are you indifferent between them?" This choice, in other words, is between a candidate with good experience and poor references and another with poor experience and good references, all else the same.
Suppose the decision-maker answers: "I prefer _21 to _12" (i.e. good experience and poor references is preferred to poor experience and good references). This preference can be represented by '_21 ≻_12', which corresponds, in terms of total score equations, to b2 + c1 > b1 + c2 [where ≻ and '~' (used later) denote strict preference and indifference respectively, corresponding to the usual relations '>' and '=' for the total score equations].
Central to the PAPRIKA method is the identification of all undominated pairs implicitly ranked as corollaries of the explicitly ranked pairs. Thus, given a2 > a1 (i.e. good education ≻ poor education), it is clear that (i) b2 + c1 > b1 + c2 (as above) implies pair (iv) (see Figure 2) is ranked as a2 + b2 + c1 > a1 + b1 + c2. This result reflects the transitivity property of (additive) value models. Specifically, 221≻121 (by dominance) and 121≻112 (i.e. pair i _21≻_12, as above) implies (iv) 221≻112; equivalently, 212≻112 and 221≻212 implies 221≻112.
Next, corresponding to pair (ii) a2 + c1 vs a1 + c2, suppose the decision-maker is asked: "Which alternative do you prefer, 1_2 or 2_1 (given they're identical on criterion b), or are you indifferent between them?" This choice, in other words, is between a candidate with poor education and good references and another with good education and poor references, all else the same.
Suppose the decision-maker answers: "I prefer 1_2 to 2_1" (i.e. poor education and good references is preferred to good education and poor references). This preference corresponds to a1 + c2 > a2 + c1. Also, given b2 > b1 (good experience ≻ poor experience), this preference/inequality implies pair (vi) is ranked as a1 + b2 + c2 > a2 + b1 + c1.
Furthermore, the two explicitly ranked pairs (i) b2 + c1 > b1 + c2 and (ii) a1 + c2 > a2 + c1 imply pair (iii) is ranked as a1 + b2 > a2 + b1. This result can easily be seen by adding the corresponding sides of the inequalities for pairs (i) and (ii) and cancelling common variables. Again, this result reflects the transitivity property: (i) 121≻112 and (ii) 112≻211 implies (iii) 121≻211; equivalently, 122≻221 and 221≻212 implies 122≻212.
As a result of two explicit pairwise comparisons – i.e. explicitly performed by the decision-maker – five of the six undominated pairs have been ranked. The decision-maker may cease ranking whenever she likes (before all undominated pairs are ranked), but let's suppose she continues and ranks the remaining pair (v) as a2 + b1 + c2 > a1 + b2 + c1 (i.e. in response to an analogous question to the two spelled out above).
Thus, all six undominated pairs have been ranked as a result of the decision-maker explicitly ranking just three:
    (i) b2 + c1 > b1 + c2
    (ii) a1 + c2 > a2 + c1
    (v) a2 + b1 + c2 > a1 + b2 + c1

### The overall ranking of alternatives and point values

Because the three pairwise rankings above are consistent – and all n (n−1)/2 = 28 pairwise rankings (n = 8) for this simple value model are known – a complete overall ranking of all eight possible alternatives is defined (1st to 8th): 222, 122, 221, 212, 121, 112, 211, 111.
Simultaneously solving the three inequalities above (i, ii, v), subject to a2 > a1, b2 > b1 and c2 > c1, gives the point values (i.e. the 'points system'), reflecting the relative importance of the criteria to the decision-maker. For example, one solution is: a1 = 0, a2 = 2, b1 = 0, b2 = 4, c1 = 0 and c2 = 3 (or normalized so the 'best' alternative, 222, scores 100 points: a1 = 0, a2 = 22.2, b1 = 0, b2 = 44.4, c1 = 0 and c2 = 33.3).
Thus, in the context of the example of a value model for ranking job candidates, the most important criterion is revealed to be (good) experience (b, 4 points) followed by references (c, 3 points) and, least important, education (a, 2 points). Although multiple solutions to the three inequalities are possible, the resulting point values all reproduce the same overall ranking of alternatives as listed above and reproduced here with their total scores:
    1st 222: 2 + 4 + 3 = 9 points (or 22.2 + 44.4 + 33.3 = 100 points normalized) – i.e. total score from adding the point values above.
    2nd 122: 0 + 4 + 3 = 7 points (or 0 + 44.4 + 33.3 = 77.8 points normalized)
    3rd 221: 2 + 4 + 0 = 6 points (or 22.2 + 44.4 + 0 = 66.7 points normalized)
    4th 212: 2 + 0 + 3 = 5 points (or 22.2 + 0 + 33.3 = 55.6 points normalized)
    5th 121: 0 + 4 + 0 = 4 points (or 0 + 44.4 + 0 = 44.4 points normalized)
    6th 112: 0 + 0 + 3 = 3 points (or 0 + 0 + 33.3 = 33.3 points normalized)
    7th 211: 2 + 0 + 0 = 2 points (or 22.2 + 0 + 0 = 22.2 points normalized)
    8th 111: 0 + 0 + 0 = 0 points (or 0 + 0 + 0 = 0 points normalized)

### Additional considerations

First, the decision-maker may decline to explicitly rank any given undominated pair (thereby excluding it) on the grounds that at least one of the alternatives considered corresponds to an impossible combination of the categories on the criteria. Also, if the decision-maker cannot decide how to explicitly rank a given pair, she may skip it – and the pair may eventually be implicitly ranked as a corollary of other explicitly ranked pairs (via transitivity).
Second, in order for all undominated pairs to be ranked, the decision-maker will usually be required to perform fewer pairwise rankings if some indicate indifference rather than strict preference. For example, if the decision-maker had ranked pair (i) above as _21~_12 (i.e. indifference) instead of _21≻_12 (as above), then she would have needed to rank only one more pair rather than two (i.e. just two explicitly ranked pairs in total). On the whole, indifferently ranked pairs generate more corollaries with respect to implicitly ranked pairs than pairs that are strictly ranked.
Finally, the order in which the decision-maker ranks the undominated pairs affects the number of rankings required. For example, if the decision-maker had ranked pair (iii) before pairs (i) and (ii) then it is easy to show that all three would have had to be explicitly ranked, as well as pair (v) (i.e. four explicitly ranked pairs in total). However, determining the optimal order is problematical as it depends on the rankings themselves, which are unknown beforehand.

### Applying PAPRIKA to 'larger' value models

Of course, most real-world value models have more criteria and categories than the simple example above, which means they have many more undominated pairs. For example, the value model referred to earlier with eight criteria and four categories within each criterion (and 4$^8$ = 65,536 possible alternatives) has 2,047,516,416 undominated pairs in total (analogous to the nine identified in Figure 2), of which, excluding replicas, 402,100,560 are unique (analogous to the six in the example above). (As mentioned earlier, for a model of this size the decision-maker is required to explicitly rank approximately 95 pairs defined on two criteria at-a-time, which most decision-makers are likely to be comfortable with.)
For such real-world value models, the simple pairwise-comparisons approach to identifying undominated pairs used in the previous sub-section (represented in Figure 2) is highly impractical. Likewise, identifying all pairs implicitly ranked as corollaries of the explicitly ranked pairs becomes increasingly intractable as the numbers of criteria and categories increase. The PAPRIKA method, therefore, relies on computationally efficient processes for identifying unique undominated pairs and implicitly ranked pairs respectively. The details of these processes are beyond the scope of this article, but are available elsewhere and, as mentioned earlier, the PAPRIKA method is implemented by decision-making software products 1000minds and MeenyMo.