Abstract
AbstractThis paper incorporates fairness constraints into the classic single-unit reduced-form implementation problem (Border in Econometrica, 59(4):1175–1187, 1991, Econ Theory 31(1):167–181, 2007; Che et al. in Econometrica 81(6): 2487–2520, 2013; Manelli and Vincent in Econometrica, 78(6):1905–1938, 2010) with two agents. To do so, I use a new approach that utilizes the results from Kellerer (Math Ann 144(4):323–344, 1961) and Gutmann et al. (Ann Prob 19(4):1781–1797, 1991). Under realistic assumptions on the constraints, the conditions are transparent and can be verified in polynomial time.
Publisher
Springer Science and Business Media LLC
Reference28 articles.
1. Benedetto, J.J., Czaja, W.: Integration and Modern Analysis. Springer Science & Business Media, Birkhäuser Boston (2010)
2. Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295–328 (2001)
3. Border, K.C.: Implementation of reduced form auctions: a geometric approach. Econometrica 59(4), 1175–1187 (1991)
4. Border, K.C.: Reduced form auctions revisited. Econ. Theory 31(1), 167–181 (2007)
5. Börgers, T., Krahmer, D.: An Introduction to the Theory of Mechanism Design. Oxford University Press, USA, New York (2015)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献