The Returning Secretary
نویسنده
چکیده
In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the algorithm is expected to make a decision regarding each request only upon its last arrival. We focus primarily on the case when k = 2, which can also be interpreted as each request arriving at, and departing from the system, at a random time. We examine the secretary problem: the problem of selecting the best secretary when the secretaries are presented online according to a random permutation. We show that when each secretary arrives twice, we can achieve a competitive ratio of 0.767974 . . . (compared to 1/e in the classical secretary problem), and that it is optimal. We also show that without any knowledge about the number of secretaries or their arrival times, we can still hire the best secretary with probability at least 2/3, in contrast to the impossibility of achieving a constant success probability in the classical setting. We extend our results to the matroid secretary problem, introduced by Babaioff et al. [3], and show a simple algorithm that achieves a 2-approximation to the maximal weighted basis in the new model (for k = 2). We show that this approximation factor can be improved in special cases of the matroid secretary problem; in particular, we give a 16/9-competitive algorithm for the returning edge-weighted bipartite matching problem. 1998 ACM Subject Classification F.1.2 Online computation
منابع مشابه
The secretary returns
In the online random-arrival model, an algorithm receives a sequence of n requests that arrive in a random order. The algorithm is expected to make an irrevocable decision with regard to each request based only on the observed history. We consider the following natural extension of this model: each request arrives k times, and the arrival order is a random permutation of the kn arrivals; the al...
متن کاملReturn migration and reintegration challenges: lived experience of expert returnees via Iranian universities
With the expansion and diversification of the process of international displacement as a factor affecting the national development of countries, the arena of migration studies needs to be reconsidered. The rising trend of external migration in recent years has been identified as one of the challenges in the policy area and requires comprehensive pathology. This study was conducted to understand...
متن کاملپیش بینی احتمال روی آوری مجدد به مصرف مواد مخدر براساس تاب آوری و الگوهای ارتباطی همسران افراد معتاد
Objective: The purpose of this study was to predict the probability of returning to substance abuse based on resiliency and communication patterns in addicts' spouses. Method: A descriptive-correlational research method was employed for the conduct of this study. The statistical population of this research consisted of the addicts in the eighth municipal district of Tehran who had returned to d...
متن کاملA Framework for the Secretary Problem on the Intersection of Matroids
The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximumweight subset of elements subject to given constraints, where elements arrive one-by-one in random order, revealing a weight upon arrival. The decision whether to select an element has to be taken immediately after its arriv...
متن کامل