Job search is generally described by an intensive effort margin such as the number of applications sent or of hours devoted. Using rich online job board data and a novel network method to determine relevant sets of ads for each applicant, we also investigate the job search selective margin, i.e. why workers apply to or
We present the renegotiable acceptance mechanism in the context of the multi-unit assignment problem. This mechanism combines features of the immediate and deferred acceptance mechanisms and implements the set of stable matchings in both Nash and undominated Nash equilibria under substitutable priorities. In addition, we prove that under slot-specific priorities, the immediate acceptance mechanism also