This problem is a generalization of the classical secretary problem in which numbers arrive on-line in random order and the goal is to select a number as large as possible. In the matroid secretary problem, there is a matroid with ground set E and independent sets I, and a weight function assigning a weight w(i) to each element i ∈ E. We wish to design an algorithm which the matroid (E, I) is g...

SEAB has approved the report of the Task Force on CO2 Utilization at its public meeting of December 12, 2016 and is hereby transmitting it to you. Your charge to the Task Force was to describe a framework for a DOE RD&D program on CO2 utilization technologies that has the potential to reduce CO2 emissions and/or introduce negative emissions at the gigatonne scale. The Task Force, under the lead...

Only recently progress has been made in obtaining o(log(rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish (2012) presented a O( √ log(rank))-competitive procedure, and Lachish (2014) later presented a O(log log(rank))competitive algorithm. Both these algorithms and their analyses are very involved, which is also reflected in the extremely h...

We treat a version of the multiple-choice secretary problem called the multiplechoice duration problem, in which the objective is to maximize the time of possession of relatively best objects. It is shown that, for the m–choice duration problem, there exists a sequence (s1, s2, . . . , sm) of critical numbers such that, whenever there remain k choices yet to be made, then the optimal strategy i...

In the classical secretary problem, n objects from an ordered set arrive in random order, and one has to accept k of them so that the nal decision about each object is made only on the basis of its rank relative to the ones already seen. Variants of the problem depend on the goal: either maximize the probability of accepting the best k objects, or minimize the expectation of the sum of the rank...

The classical secretary problem has been generalized over the years into several directions. In this paper we confine our interest to those generalizations which have to do with the more general problem of stopping on a last observation of a specific kind. We follow Dendievel [10], [11], (where a bibliography can be found) who studies several types of such problems, mainly initiated by Bruss [3...

The menu-dependent nature of regret-minimization creates subtleties in applying regret-minimization to dynamic decision problems. Firstly, it is not clear whether forgone opportunities should be included in the menu. We explain commonly observed behavioral patterns as minimizing regret when forgone opportunities are present, and also show how the treatment of forgone opportunities affects behav...

The classical secretary problem investigates the question of how to hire the best secretary from n candidates who come in a uniformly random order. In this work we investigate a parallel generalizations of this problem introduced by Feldman and Tennenholtz [14]. We call it shared Q-queue J-choice K-best secretary problem. In this problem, n candidates are evenly distributed into Q queues, and i...

In the Prophet Secretary problem, samples from a known set of probability distributions arrive one by one in a uniformly random order, and an algorithm must irrevocably pick one of the samples as soon as it arrives. The goal is to maximize the expected value of the sample picked relative to the expected maximum of the distributions. This is one of the most simple and fundamental problems in onl...

The J-choice K-best secretary problem, also known as the (J, K)-secretary problem, is a generalization of the classical secretary problem. An algorithm for the (J, K)-secretary problem is allowed to make J choices and the payoff to be maximized is the expected number of items chosen among the K best items. Previous works analyzed the case when the total number n of items is finite, and consider...