Public projects, Boolean functions and the borders of Border's theorem
ACM Transactions on Economics and Computation(2015)
摘要
Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known generalizations of Border's theorem either restrict attention to relatively simple settings, or resort to approximation. This paper identifies a complexity-theoretic barrier that indicates, assuming standard complexity class separations, that Border's theorem cannot be extended significantly beyond the state-of-the-art. We also identify a surprisingly tight connection between Myerson's optimal auction theory, when applied to public project settings, and some fundamental results in the analysis of Boolean functions.
更多查看译文
关键词
Auctions,Border's theorem,revenue-maximization,interdependence,correlated values,optimal auctions,Myerson theory,prior-independence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络