0
喜欢
0
书签
声明论文
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions   
摘  要:   We consider the following setting: a decision maker must make a decision based on reported data points with binary labels. Subsets of data points are controlled by different self- ish agents, which might misreport the labels in order to sway the decision in their favor. We design mechanisms (both de- terministic and randomized) that reach an approximately op- timal decision and are strategyproof, i.e., agents are best off when they tell the truth. We then recast our results into a classical machine learning classification framework, where the decision maker must make a decision (choose between the constant positive hypothesis and the constant negative hypothesis) based only on a sampled subset of the agents' points.
发  表:   National Conference on Artificial Intelligence  2008

论文统计图
共享有11个版本
 [展开全部版本] 

Bibtex
创新指数 
阅读指数 
重现指数 
论文点评
还没有人点评哦

Feedback
Feedback
Feedback
我想反馈:
排行榜