# WITH WHAT PROBABILITY REGULAR MINIMALITY CAN BE SATISFIED BY CHANCE?

### Abstract

A matrix of discrimination measures (e.g., probabilities) satisfies Regular Minimality (RM) if every row and every column of the matrix contains a single minimal entry, and an entry minimal in its row is minimal in its column. The probability with which a randomly chosen matrix complies with RM depends on how one defines â€œrandomly chosen.â€ In this work we view all possible permutations of entries of a matrix without ties as equiprobable, and derive a closed- form expression for the probability with which a permutation yields a matrix satisfying RM.

Issue

Section

Full Articles