Robust Online Selection with Uncertain Offer Acceptance

12/01/2021
by   Sebastian Perez-Salazar, et al.
0

Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click on displayed ads, while the platform's algorithm may miss the users most disposed to do so. This mismatch decreases the platform's revenue and the advertiser's chances to reach the right customers. With this motivation, we propose a secretary problem where a candidate may or may not accept an offer according to a known probability p. Because we do not know the top candidate willing to accept an offer, the goal is to maximize a robust objective defined as the minimum over integers k of the probability of choosing one of the top k candidates, given that one of these candidates will accept an offer. Using Markov decision process theory, we derive a linear program for this max-min objective whose solution encodes an optimal policy. The derivation may be of independent interest, as it is generalizable and can be used to obtain linear programs for many online selection models. We further relax this linear program into an infinite counterpart, which we use to provide bounds for the objective and closed-form policies. For p ≥ p^* ≈ 0.6, an optimal policy is a simple threshold rule that observes the first p^1/(1-p) fraction of candidates and subsequently makes offers to the best candidate observed so far.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2019

How to Hire Secretaries with Stochastic Departures

We study a generalization of the secretary problem, where decisions do n...
research
05/07/2019

Hiring Under Uncertainty

In this paper we introduce the hiring under uncertainty problem to model...
research
11/19/2020

Online Model Selection for Reinforcement Learning with Function Approximation

Deep reinforcement learning has achieved impressive successes yet often ...
research
05/18/2022

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy

Motivated by applications in the gig economy, we study approximation alg...
research
03/16/2023

Addressing bias in online selection with limited budget of comparisons

Consider a hiring process with candidates coming from different universi...
research
09/16/2019

An Asymptotic Analysis on Generalized Secretary Problem

As a famous result, the “37% Law” for Secretary Problem has widely influ...
research
08/24/2023

A Greedy Approach for Offering to Telecom Subscribers

Customer retention or churn prevention is a challenging task of a teleco...

Please sign up or login with your details

Forgot password? Click here to reset