  We study the problem of fairly allocating indivisible goods to agents with
weights corresponding to their entitlements. Previous work has shown that, when
agents have binary additive valuations, the maximum weighted Nash welfare rule
is resource-, population-, and weight-monotone, satisfies
group-strategyproofness, and can be implemented in polynomial time. We
generalize these results to the class of weighted additive welfarist rules with
concave functions and agents with matroid-rank (also known as binary
submodular) valuations.
