MECE rule

from Wikipedia, the free encyclopedia

MECE (English for mutually exclusive and collectively exhaustive in German about mutually exclusive and exhaustive in total ) is a technical term for the property of sub-elements related to a super-element to map or identify this completely and without overlapping ( disjointset theory ). In this respect, it describes a rule for the clear (and therefore functional) creation of logical trees in structured problem solving. Accordingly, criteria must be able to be clearly assigned or be assigned. This means that there must be neither double assignments nor characteristics that do not fit into any of the categories.

Examples

If a group of people were categorized according to their birthdays, this would be an example of a categorization that complies with the MECE rule, assuming that all birth dates are known, since every person has one (and only one) birthday. However, a categorization according to the criterion of nationality would not conform to the MECE rules, as there are people who have no or several citizenships.

Areas of application

The MECE rule is a fundamental approach to decision making and is used universally.

It is currently used by McKinsey , among others, for problem structuring .

criticism

Critics of the MECE rule mention that the rule does not conform in itself. As a collection of grouping rules, disjointness can be guaranteed, but simultaneous exhaustion is virtually impossible, since z. B. vertical and horizontal parallels cannot be mapped.

See also

Footnotes

  1. ^ A. Ang, W. Tang: Probability Concepts in Engineering Planning and Design - Volume II Decision, Risk and Reliability. John Wiley & Sons, 1984.
  2. Rolf Hichert: Presenting successfully. Instructions for preparing, structuring and conducting business presentations. PDF; 512 kB.
  3. Rasiel: The McKinsey Way. Pp. 6-8. McGraw Hill, 1999.