MR-Sort (Majority Rule Sorting) is a multiple criteria sorting method which assigns an alternative a to category C h when a is better than the lower limit of C h on a weighted majority of criteria, and this is not true with the upper limit of C h. We enrich the descriptive ability of MR-Sort by the addition of coalitional vetoes which operate in a symmetric way as compared to the MR-Sort rule w.r.t. to category limits, using specific veto profiles and veto weights. We describe a heuristic algorithm to learn such an MR-Sort model enriched with coalitional veto from a set of assignment examples, and show how it performs on real datasets. 2 Considering Vetoes in MR-Sort 2.1 MR-Sort Model MR-Sort is a method for assigning objects to ordered categories. It is a simplified version of ELECTRE TRI, another MCDA method [10, 11]. The MR-Sort rule works as follows. Formally, let X be a set of objects evaluated on n ordered attributes (or criteria), F = {1, ..., n}. We assume that X is the Cartesian product of the criteria scales, X = n j=1 X j , each scale X j being completely ordered by the relation ≥ j. An object a ∈ X is a vector (a 1 ,. .. , a j ,. .. , a n), where a j ∈ X j for all j. The ordered categories which