  A majority coloring of a directed graph is a vertex coloring in which each
vertex has the same color as at most half of its out-neighbors. In this note we
simplify some proof techniques and generalize previously known results on
various generalizations of majority coloring. In particular, our unified and
simplified approach works for paintability - an on-line analog of the list
coloring.
