Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We study path-independent choice rules applied to a matching context. We use a classic representation of these choice rules to introduce a powerful technique for matching theory. Using this technique, we provide a deferred acceptance algorithm for many-to-many matching markets with contracts and study its properties. Next, we obtain a compelling comparative static result: if one agent's choice expands, the remaining agents on her side of the market are made worse off, while agents on the other side of the market are made better off. Finally, we establish several results related to path-independent choice rules.