Mechanisms for complement-free procurement.

EC '11: ACM Conference on Electronic Commerce San Jose California USA June, 2011(2011)

引用 36|浏览19
暂无评分
摘要
We study procurement auctions when the buyer has complement-free (subadditive) objectives in the budget feasibility model (Singer 2010). For general subadditive functions we give a randomized universally truthful mechanism which is an O(log2 n) approximation, and an O(log3 n) deterministic truthful approximation mechanism; both mechanisms are in the demand oracle model. For cut functions, an interesting case of nonincreasing objectives, we give both randomized and deterministic truthful and budget feasible approximation mechanisms that achieve a constant approximation factor.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要