A note on some negative dependence notions

A random vector X = (X ₁,…,X _n ) is negatively associated if and only if for every pair of partitions X ₁ = (X _π(1),…,X _π(k)), X ₂ = (X _π(k+1),…,X _π(n)) of X , P( X ₁ ? A, X ₂ ? B) ≤ P( X ₁ ? A)P( X ₂ ? B) whenever A and B are open upper sets and π is any permutation of {1,…,n}. In this paper, we develop some of concepts of negative dependence, which are weaker than negative association but stronger than negative orthant dependence by requiring the above inequality to hold only for some upper sets A and B and applying the arguments in Shaked.