A bi-criteria multiple-choice secretary problem

Ge Yu, Sheldon Howard Jacobson, Negar Kiyavash

Research output: Contribution to journalArticle

Abstract

This article studies a Bi-criteria Multiple-choice Secretary Problem (BMSP) with full information. A sequence of candidates arrive one at a time, with a two-dimensional attribute vector revealed upon arrival. A decision maker needs to select a total number of η candidates to fill η job openings, based on the attribute vectors of candidates. The objective of the decision maker is to maximize the expected sum of attribute values of selected candidates for both dimensions of the attribute vector. An approach for generating Pareto-optimal policies for BMSP is proposed using the weighted sum method. Moreover, closed-form expressions for values of both objective functions under Pareto-optimal policies for BMSP are provided to help a decision maker in the policy planning stage. These analysis techniques can be applied directly to solve the more general class of multi-criteria multiple-choice Secretary Problems, provided the objective functions are in the form of accumulating a product-form reward for each selected candidate.

Original languageEnglish (US)
Pages (from-to)577-588
Number of pages12
JournalIISE Transactions
Volume51
Issue number6
DOIs
StatePublished - Jun 3 2019

Fingerprint

Planning

Keywords

  • multi-objective online optimization
  • Secretary Problem
  • sequential stochastic assignment

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

A bi-criteria multiple-choice secretary problem. / Yu, Ge; Jacobson, Sheldon Howard; Kiyavash, Negar.

In: IISE Transactions, Vol. 51, No. 6, 03.06.2019, p. 577-588.

Research output: Contribution to journalArticle

Yu, Ge ; Jacobson, Sheldon Howard ; Kiyavash, Negar. / A bi-criteria multiple-choice secretary problem. In: IISE Transactions. 2019 ; Vol. 51, No. 6. pp. 577-588.
@article{f5cda4c5a9bb4e09b85ca684a4e12d01,
title = "A bi-criteria multiple-choice secretary problem",
abstract = "This article studies a Bi-criteria Multiple-choice Secretary Problem (BMSP) with full information. A sequence of candidates arrive one at a time, with a two-dimensional attribute vector revealed upon arrival. A decision maker needs to select a total number of η candidates to fill η job openings, based on the attribute vectors of candidates. The objective of the decision maker is to maximize the expected sum of attribute values of selected candidates for both dimensions of the attribute vector. An approach for generating Pareto-optimal policies for BMSP is proposed using the weighted sum method. Moreover, closed-form expressions for values of both objective functions under Pareto-optimal policies for BMSP are provided to help a decision maker in the policy planning stage. These analysis techniques can be applied directly to solve the more general class of multi-criteria multiple-choice Secretary Problems, provided the objective functions are in the form of accumulating a product-form reward for each selected candidate.",
keywords = "multi-objective online optimization, Secretary Problem, sequential stochastic assignment",
author = "Ge Yu and Jacobson, {Sheldon Howard} and Negar Kiyavash",
year = "2019",
month = "6",
day = "3",
doi = "10.1080/24725854.2018.1516054",
language = "English (US)",
volume = "51",
pages = "577--588",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "6",

}

TY - JOUR

T1 - A bi-criteria multiple-choice secretary problem

AU - Yu, Ge

AU - Jacobson, Sheldon Howard

AU - Kiyavash, Negar

PY - 2019/6/3

Y1 - 2019/6/3

N2 - This article studies a Bi-criteria Multiple-choice Secretary Problem (BMSP) with full information. A sequence of candidates arrive one at a time, with a two-dimensional attribute vector revealed upon arrival. A decision maker needs to select a total number of η candidates to fill η job openings, based on the attribute vectors of candidates. The objective of the decision maker is to maximize the expected sum of attribute values of selected candidates for both dimensions of the attribute vector. An approach for generating Pareto-optimal policies for BMSP is proposed using the weighted sum method. Moreover, closed-form expressions for values of both objective functions under Pareto-optimal policies for BMSP are provided to help a decision maker in the policy planning stage. These analysis techniques can be applied directly to solve the more general class of multi-criteria multiple-choice Secretary Problems, provided the objective functions are in the form of accumulating a product-form reward for each selected candidate.

AB - This article studies a Bi-criteria Multiple-choice Secretary Problem (BMSP) with full information. A sequence of candidates arrive one at a time, with a two-dimensional attribute vector revealed upon arrival. A decision maker needs to select a total number of η candidates to fill η job openings, based on the attribute vectors of candidates. The objective of the decision maker is to maximize the expected sum of attribute values of selected candidates for both dimensions of the attribute vector. An approach for generating Pareto-optimal policies for BMSP is proposed using the weighted sum method. Moreover, closed-form expressions for values of both objective functions under Pareto-optimal policies for BMSP are provided to help a decision maker in the policy planning stage. These analysis techniques can be applied directly to solve the more general class of multi-criteria multiple-choice Secretary Problems, provided the objective functions are in the form of accumulating a product-form reward for each selected candidate.

KW - multi-objective online optimization

KW - Secretary Problem

KW - sequential stochastic assignment

UR - http://www.scopus.com/inward/record.url?scp=85060891457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85060891457&partnerID=8YFLogxK

U2 - 10.1080/24725854.2018.1516054

DO - 10.1080/24725854.2018.1516054

M3 - Article

VL - 51

SP - 577

EP - 588

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 6

ER -