Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Secretary problem"”.
-
A multiple secretary problem with switch costs
… to determine the optimal selection rule for the secretary problem with switch costs, in which a known number of applicants appear sequentially in a random order, and the objective is to maximize the sum of the qualities of all hired secretaries over all time. It is assumed that the quality of …
-
Scheduling to minimize power consumption using submodular functions
… in a simple setting with one processor, the problem is Set-Cover hard.) If not all jobs can be scheduled and each job has a specified value, then our algorithm finds a schedule of value at least (1 - c)Z and power usage within an O(log(1/E)) factor of the optimal schedule of value at least Z, …
-
Contributions on secretary problems, independent sets of rectangles and related problems
We study three problems arising from different areas of combinatorial optimization. We first study the matroid secretary problem, which is a generalization proposed by Babaioff, Immorlica and Kleinberg of the classical secretary problem. In this problem, the elements of a given matroid are revealed …
-
Problems of optimal choice on posets and generalizations of acyclic colourings
… prove some results concerning variants of the `secretary problem'. In Part 2, I shall bound several generalizations of the acyclic chromatic number of a graph as functions of its maximum degree. I shall begin Chapter 1 by describing the classical secretary problem, in which the aim is to select …
-
Experimental tests of fundamental economic theories
… of n candidates in what has been called the "Secretary Problem." The novelty of this design is that the optimal search rule is invariant to agents' risk attitudes. This is made possible by implementing a binary payout schedule in which stopping at the best candidate pays a positive amount and …
-
Online allocation algorithms with applications in computational advertising
… of my research. I will also touch on the classic secretary problem with submodular utility functions, and show that how it is related to advertiser's optimization problem in computational advertising applications. In all these practical situations, we should focus on solving the allocation …
-
Generalized sequential assignment problem
The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks with stochastic parameters to workers with fixed success rates. The reward of each assignment is the product of the worker's success rate and the task value assigned to the worker. The objective is …
-
Optimization problems with incomplete information
… of algorithms for new variants of optimization problems where the problem instance is not completely known. Specifically, we consider two online problems where the problem instance is revealed over time, and one distributed problem involving many computational units, each of which can access …
-
Efficient Optimal and Approximate Algorithms in Optimization Under Uncertainty
… What orders should we accept?). These problems can be solved naively by reformulating the problem as a deterministic problem, but this can dramatically increase the size of the problem making the naive reformulation to be computationally expensive to solve. We aim to develop efficient …