Pith. sign in

REVIEW

The Secretary Recommendation Problem

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1907.04252 v2 pith:W4B37PZM submitted 2019-07-09 cs.GT

The Secretary Recommendation Problem

classification cs.GT
keywords problemsendersecretaryagentdecisionresultsconditionshiring
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.