This web service allows to compute the affectations of some alternatives in predefined categories, bounded with predefined profiles. It takes a stability relation, which inform on the dependency of the outranking statements to the preorder. Basically, a statement is said to be stable if it is only dependent on the preorder of the weights, not the precise fixation of them. A positive value (resp. negative one) means that the outranking statement is warranted (resp. is not warranted). A +1 or -1 value on a statement means that it is unstable: in that case, at it may be warranted or not, it can modify the affectation of the alternatives. We then consider here to give the list of contiguous categories such that the alternatives can be affected to every ones by modifying the weights without changing the preorder.
(For outputs, see below)
A list of alternatives. Alternatives can be activated or deactivated via the <active> tag (true or false). By default (no <active> tag), alternatives are considered as active. Alternatives can be also considered as fictive or not (using the tag <type>) and will not be affected in the categories. This is useful as the profiles have to be defined here. By default (no <type> tag), alternatives are considered as real.
A list of categories. They have to be ranked (using the tag rank).
<categories> <category id=[...]> <rank><integer>[...]</integer></rank> </category> [...] </categories>
A list of categoriesProfiles. They allow to know which profiles bound which categories. The profiles are defined under the tag alternatives.
<categoriesProfiles> <categoryProfile> <alternativeID>[...]</alternativeID> <!-- ID of the profile --> <limits> <lowerCategory><categoryID>[...]</categoryID></lowerCategory> <upperCategory><categoryID>[...]</categoryID></upperCategory> </limits> </categoryProfile> [...] </categoriesProfiles>
The complete stability relation (at least, the relation that compare the alternatives and the profiles, not necessary the alternatives together). The value associated to each ordered pair (a,b) must be an integer between 3 and -3.
The type of sorting to use (optimistic or pessimistic).
<methodParameters> <parameter name="sortingMode"> <value> <label>%1</label> </value> </parameter> </methodParameters>
The affectations of the alternatives.
A list of messages generated by the algorithm.
For further technical details on the web service underlying this program, have a look at its documentation here.