منابع مشابه
Matroid Secretary Problems
In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented with n positive values, one by one. After each value, the algorithm must either accept or reject the value, where all decisions are final. The algorithm can only pick one value, and the goal is to pick the maximum value in the sequence. The name for this problem arises from a situation where n candi...
متن کاملOn Generalized Secretary Problems
This paper is composed of two related parts. In the first, we present a dynamic programming procedure for finding optimal policies for a class of sequential search problems that includes the well-known “secretary problem.” In the second, we propose a stochastic model of choice behavior for this class of problems and test the model with two extant data sets. We conclude that the previously repor...
متن کاملSecretary Problems with Convex Costs
We consider online resource allocation problems where given a set of requests our goal is to select a subset that maximizes a value minus cost type of objective function. Requests are presented online in random order, and each request possesses an adversarial value and an adversarial size. The online algorithm must make an irrevocable accept/reject decision as soon as it sees each request. The ...
متن کاملSecretary Problems with Competing Employers
In many decentralized labor markets, job candidates are offered positions at very early stages in the hiring process. It has been argued that these early offers are an effect of the competition between employers for the best candidate. This work studies the timing of offers in a theoretical model based on the classical secretary problem. We consider a secretary problem with multiple employers a...
متن کاملSecretary Problems via Linear Programming
In the classical secretary problem an employer would like to choose the best candidate among n competing candidates that arrive in a random order. This basic concept of n elements arriving in a random order and irrevocable decisions made by an algorithm have been explored extensively over the years, and used for modeling the behavior of many processes. Our main contribution is a new linear prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1980
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-6-1-257-266