Results 1  10
of
122
Submodular Secretary Problem and Extensions
"... Online auction is the essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future information. Optimal stopping theory, especially the c ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
consider a very general setting of the latter problem called the submodular secretary problem, in which the goal is to select k secretaries so as to maximize the expectation of a (not necessarily monotone) submodular function which defines efficiency of the selected secretarial group based
Submodular Secretary Problem and Extensions
, 2010
"... Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future information. Optimal stopping theory, especially the cl ..."
Abstract
 Add to MetaCart
consider a very general setting of the latter problem called the submodular secretary problem, in which the goal is to select k secretaries so as to maximize the expectation of a (not necessarily monotone) submodular function which defines efficiency of the selected secretarial group based
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
, 2011
"... The Classical Secretary Problem was introduced during the 60’s of the 20 th century, nobody is sure exactly when. Since its introduction, many variants of the problem have been proposed and researched. In the classical secretary problem, and many of its variant, the input (which is a set of secret ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
problem, all of which have the same objective of maximizing the value of the chosen set of secretaries given a monotone submodular function f. In the first variant we are allowed to hire a set of secretaries only if it is an independent set of a given partition matroid. The second variant allows us
Active Learning and Submodular Functions
, 2012
"... Active learning is a machine learning setting where the learning algorithm decides what data is labeled. Submodular functions are a class of set functions for which many optimization problems have efficient exact or approximate algorithms. We examine their connections. • We propose a new class of in ..."
Abstract
 Add to MetaCart
Active learning is a machine learning setting where the learning algorithm decides what data is labeled. Submodular functions are a class of set functions for which many optimization problems have efficient exact or approximate algorithms. We examine their connections. • We propose a new class
Maximization of NonMonotone Submodular Functions
"... A litany of questions from a wide variety of scientific disciplines can be cast as nonmonotone submodular maximization problems. Since this class of problems includes maxcut, it is NPhard. Thus, generalpurpose algorithms for the class tend to be approximation algorithms. For unconstrained probl ..."
Abstract
 Add to MetaCart
A litany of questions from a wide variety of scientific disciplines can be cast as nonmonotone submodular maximization problems. Since this class of problems includes maxcut, it is NPhard. Thus, generalpurpose algorithms for the class tend to be approximation algorithms. For unconstrained
The simulated greedy algorithm for several submodular matroid secretary problems. arXiv preprint arXiv:1107.2188
, 2011
"... We study the matroid secretary problems with submodular valuation functions. In these problems, the elements arrive in random order. When one element arrives, we have to make an immediate and irrevocable decision on whether to accept it or not. The set of accepted elements must form an independent ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study the matroid secretary problems with submodular valuation functions. In these problems, the elements arrive in random order. When one element arrives, we have to make an immediate and irrevocable decision on whether to accept it or not. The set of accepted elements must form an independent
Streaming Algorithms for Submodular Function Maximization
, 2015
"... We consider the problem of maximizing a nonnegative submodular set function f: 2N → R+ subject to a pmatchoid constraint in the singlepass streaming setting. Previous work in this context has considered streaming algorithms for modular functions and monotone submodular functions. The main result i ..."
Abstract
 Add to MetaCart
We consider the problem of maximizing a nonnegative submodular set function f: 2N → R+ subject to a pmatchoid constraint in the singlepass streaming setting. Previous work in this context has considered streaming algorithms for modular functions and monotone submodular functions. The main result
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 onlin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
to the submodular secretary problem. Unlike previous work on secretary problems, one of the main challenges we face is that the objective function can be positive or negative and we must guard against accepting requests that look good early on but cause the solution to have an arbitrarily large cost as more
Matroid Secretary Problems
"... In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented ..."
Abstract
 Add to MetaCart
In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented
Prophet Secretary
, 2015
"... Optimal stopping theory is a powerful tool for analyzing scenarios such as online auctions in which we generally require optimizing an objective function over the space of stopping rules for an allocation process under uncertainty. Perhaps the most classic problems of stopping theory are the prophet ..."
Abstract
 Add to MetaCart
are the prophet inequality problem and the secretary problem. The classical prophet inequality states that by choosing the same threshold OPT/2 for every step, one can achieve the tight competitive ratio of 0.5. On the other hand, for the basic secretary problem, the optimal strategy achieves the tight
Results 1  10
of
122