The Secretary Recommendation Problem

EC '20: The 21st ACM Conference on Economics and Computation Virtual Event Hungary July, 2020(2020)

引用 10|浏览29
暂无评分
摘要
In this paper we revisit the basic variant of the classical secretary problem. We propose a new approach in which we separate between an agent that evaluates the secretary performance and one that has to make the hiring decision. The evaluating agent (the sender) signals the quality of the candidate to the hiring agent (the receiver) who must make a decision. Whenever the two agents' interests are not fully aligned, this induces an information transmission (signaling) challenge for the sender. We study the sender's optimization problem subject to persuasiveness constraints of the receiver for several variants of the problem. Our results quantify the loss in performance for the sender due to online arrival. We provide optimal and near-optimal persuasive mechanisms that recover at least a constant fraction of a natural utility benchmark for the sender. The separation of evaluation and decision making can have a substantial impact on the approximation results. While in some scenarios, techniques and results closely mirror the conditions in the standard secretary problem, we also explore conditions that lead to very different characteristics.
更多
查看译文
关键词
Bayesian persuasion,Secretary problem,Online algorithms,Approximation algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要