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 14 of 14 for “"Secretary Problem"”.
-
A NEURAL NETWORK PERSPECTIVE ON THE MULTI-SECRETARY PROBLEM
… value of targets destroyed during a mission. The problem is modeled as a multi-secretary problem whereby, given a number of missiles, the goal is to fire at the highest-value targets in a limited amount of time, with the following restrictions: each target is present for one time period and they …
-
THE MULTI-SECRETARY PROBLEM WITH RANDOM LIFETIME: APPLICATIONS IN UAV TARGET SELECTION
… become increasingly important. We examine the problem of an unmanned aerial vehicle (UAV) that encounters targets at a regular rate. Each target carries a value according to a known probability distribution. The UAV operator must determine how best to allocate a finite store of munitions to …
-
Sequential Search With Ordinal Ranks and Cardinal Values: An Infinite Discounted Secretary Problem
We consider an extension of the classical secretary problem where a decision maker observes only the relative ranks of a sequence of up to N applicants, whose true values are i.i.d. U[0,1] random variables. Applicants arrive according to a homogeneous Poisson Process, and the decision maker seeks …
-
Hiring under uncertainty and competition : a work on various extensions of the secretary problem
… dissertation, we study different online hiring problems related to the Secretary Problem. In the Secretary Problem, an employer sees a sequence of candidates. Each time a new candidate arrives, the employer makes an irrevocable choice on whether to hire based only on the relative ranking of the …
-
Sequential observation and selection with relative ranks: An empirical investigation of the Secretary Problem.
… theoretical results, common assumptions of the Secretary Problem (SP), as well as the number of applicants, were systematically varied across three experiments. Experiment 1 investigated the standard version of the SP, where all of the usual assumptions were met. Experiment 2 relaxed the …
-
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 …
-
Optimal Strategies for Stopping Near the Top of a Sequence
In Chapter 1 the classical secretary problem is introduced. Chapters 2 and 3 are variations of this problem. Chapter 2, discusses the problem of maximizing the probability of stopping with one of the two highest values in a Bernoulli random walk with arbitrary parameter p and finite time horizon n. …
-
Two Analytic Issues Arising from Models in Probability and Materials Science
… algorithm designed to address the score-based secretary problem, a classic challenge in probability theory. This problem involves making immediate decisions to select the best candidate from a sequence of interviews. The algorithm aims to maximize the probability of selecting the optimal …
-
Online Learning with a View toward Fairness
… Modeling the screening process as a $k$-secretary problem with partial ordinal information, I prove tight lower and upper bounds on the competitive ratio (i.e., the worst-case expected performance ratio). The second line of inquiry revolves around achieving comparative fairness (i.e., …
-
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 …
-
A Random Walk Version of Robbins' Problem
Robbins' problem is an optimal stopping problem where one seeks to minimize the expected rank of their observations among all observations. We examine random walk analogs to Robbins' problem in both discrete and continuous time. In discrete time, we consider full information and relative ranks …
-
Προσαρμοστική επιδημική διάδοση σε ασύρματα αδόμητα δίκτυα
… the assessmentof an optimal solution to the problem and also the achievement of optimal performancein the aforementioned areas with high quality inforamation.Adaptive epidemic dissemination (AED) in ad hoc networks in a noisy environment isa problem with many parameters.Using cross-layering …