This paper incorporates fairness constraints into the classic single-unit reduced-form implementation problem (Border, 1991, 2007; Che, Kim & Mierendorff, 2013; Manelli & Vicent, 2010) with two agents. To do so, I use a new approach that utilizes the results from Kellerer (1961) and Gutmann, Kemperman, and Shepp (1991). Under realistic assumptions on the constraints, the conditions are transparent and can be verified in polynomial time.
Download paper