Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We characterize the structure of the set of core matchings of an assignment game (a two-sided market with transfers). Such a set satisfies a property we call consistency. Consistency of a set of matchings states that, for any matching v, if, for each agent i there exists a matching ? in the set for which ?(i) = v(i), then v is in the set. A set of matchings satisfies consistency if and only if there is an assignment game for which all elements of the set maximize the surplus. (JEL C78)