Budget Feasible Mechanisms for Experimental Design

Lecture Notes in Computer Science(2014)

引用 38|浏览14
暂无评分
摘要
We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant (approximate to 12.98) factor approximation for the Experimental Design Problem (EDP). By applying previous work on budget feasible mechanisms with a submodular objective, one could only have derived either an exponential time deterministic mechanism or a randomized polynomial time mechanism. We also establish that no truthful, budget-feasible mechanism is possible within a factor 2 approximation, and show how to generalize our approach to a wide class of learning problems, beyond linear regression.
更多
查看译文
关键词
Convex Optimization Problem, Combinatorial Auction, Convex Relaxation, Submodular Function, Barrier Method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要