๐ค AI Summary
ๆฌๆ็ ็ฉถไบๅบไบ่ฏๆฎ็ๅ้
ไธญๅฆไฝ็กฎๅฎไผๅ
็บง๏ผๆๅบไบไธ็งๅจ้จๅ่ฏๆฎไธ้่ฟ้พ่งๅๅไฟ็่งๅๆฅ่ฎค่ฏไผๅ
ๆ็ๆนๆณใ
๐ Abstract
Many allocation rules give priority to applicants satisfying favored conditions, including disability, homelessness, and veteran status. Because these conditions are not directly observed, a rule ranking applicants by characteristics must first determine what submitted certificates prove. This paper studies allocation with hard but partial evidence: a disability document may prove disability without proving the absence of a disqualifying tenancy record. A claim is certifiable exactly when every intended claimant has a feasible certificate excluding all outsiders. Chain rules---scores, lexicographic orders, and scalar rankings---require certification of every priority cutoff, whereas reserve rules require certification of each eligibility class. Allocation rules thus select the claim family to be certified. When certification fails, canonical repairs demote unsupported chain priorities and delete unsupported reserve labels. Nonempty reserve eligibility classes can be represented as upper contours of a single chain if and only if they are nested. A housing application illustrates the consequences.