Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
Abstract We address the mechanism design issue for the sequencing problem. We identify the just sequencing rule that serves the agents in the non-increasing order of their waiting costs and prove that it is a Rawlsian rule and that it weakly lexi-max cost dominates the outcome efficient sequencing rule. We identify all ICJ mechanisms that implement the just sequencing rule. The other properties of the just sequencing rule that we identify are the following. It can be implemented with budget-balanced ICJ mechanisms. When waiting cost and processing time are private information, we identify all generalized ICJ mechanisms that ex-post implement the just sequencing rule. Finally, we identify all budget-balanced generalized ICJ mechanisms.