7 research outputs found
Stable Secretaries
We define and study a new variant of the secretary problem. Whereas in the
classic setting multiple secretaries compete for a single position, we study
the case where the secretaries arrive one at a time and are assigned, in an
on-line fashion, to one of multiple positions. Secretaries are ranked according
to talent, as in the original formulation, and in addition positions are ranked
according to attractiveness. To evaluate an online matching mechanism, we use
the notion of blocking pairs from stable matching theory: our goal is to
maximize the number of positions (or secretaries) that do not take part in a
blocking pair. This is compared with a stable matching in which no blocking
pair exists. We consider the case where secretaries arrive randomly, as well as
that of an adversarial arrival order, and provide corresponding upper and lower
bounds.Comment: Accepted for presentation at the 18th ACM conference on Economics and
Computation (EC 2017
Packing Returning Secretaries
We study online secretary problems with returns in combinatorial packing
domains with candidates that arrive sequentially over time in random order.
The goal is to accept a feasible packing of candidates of maximum total value.
In the first variant, each candidate arrives exactly twice. All arrivals
occur in random order. We propose a simple 0.5-competitive algorithm that can
be combined with arbitrary approximation algorithms for the packing domain,
even when the total value of candidates is a subadditive function. For
bipartite matching, we obtain an algorithm with competitive ratio at least
for growing , and an algorithm with ratio at least
for all . We extend all algorithms and ratios to arrivals
per candidate.
In the second variant, there is a pool of undecided candidates. In each
round, a random candidate from the pool arrives. Upon arrival a candidate can
be either decided (accept/reject) or postponed (returned into the pool). We
mainly focus on minimizing the expected number of postponements when computing
an optimal solution. An expected number of is always
sufficient. For matroids, we show that the expected number can be reduced to
, where is the minimum of the ranks of matroid and
dual matroid. For bipartite matching, we show a bound of , where
is the size of the optimum matching. For general packing, we show a lower
bound of , even when the size of the optimum is .Comment: 23 pages, 5 figure
Incentives in dynamic markets
In this thesis, we consider a variety of combinatorial optimization problems within a common theme of uncertainty and selfish behavior. In our first scenario, the input is collected from selfish players. Here, we study extensions of the so-called smoothness framework for mechanisms, a very useful technique for bounding the inefficiency of equilibria, to the cases of varying mechanism availability and participation of risk-averse players. In both of these cases, our main results are general theorems for the class of (lambda,mu)-smooth mechanisms. We show that these mechanisms guarantee at most a (small) constant factor performance loss in the extended settings. In our second scenario, we do not have access to the exact numerical input. Within this context, we explore combinatorial extensions of the well-known secretary problem under the assumption that the incoming elements only reveal their ordinal position within the set of previously arrived elements. We first observe that many existing algorithms for special matroid structures maintain their competitive ratio in the ordinal model. In contrast, we provide a lower bound for algorithms that are oblivious to the matroid structure. Finally, we design new algorithms that obtain constant competitive ratios for a variety of combinatorial problems
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
In this thesis, we prove upper and lower bounds on the complexity of sequence similarity measures, the approximability of geometric problems on realistic inputs, and the performance of randomized broadcasting protocols.
The first part approaches the question why a number of fundamental polynomial-time problems - specifically, Dynamic Time Warping, Longest Common Subsequence (LCS), and the Levenshtein distance - resists decades-long attempts to obtain polynomial improvements over their simple dynamic programming solutions. We prove that any (strongly) subquadratic algorithm for these and related sequence similarity measures would refute the Strong Exponential Time Hypothesis (SETH). Focusing particularly on LCS, we determine a tight running time bound (up to lower order factors and conditional on SETH) when the running time is expressed in terms of all input parameters that have been previously exploited in the extensive literature.
In the second part, we investigate the approximation performance of the popular 2-Opt heuristic for the Traveling Salesperson Problem using the smoothed analysis paradigm. For the Fréchet distance, we design an improved approximation algorithm for the natural input class of c-packed curves, matching a conditional lower bound.
Finally, in the third part we prove tighter performance bounds for processes that disseminate a piece of information, either as quickly as possible (rumor spreading) or as anonymously as possible (cryptogenography).Die vorliegende Dissertation beweist obere und untere Schranken an die Komplexität von Sequenzähnlichkeitsmaßen, an die Approximierbarkeit geometrischer Probleme auf realistischen Eingaben und an die Effektivität randomisierter Kommunikationsprotokolle.
Der erste Teil befasst sich mit der Frage, warum für eine Vielzahl fundamentaler Probleme im Polynomialzeitbereich - insbesondere für das Dynamic-Time-Warping, die längste gemeinsame Teilfolge (LCS) und die Levenshtein-Distanz - seit Jahrzehnten keine Algorithmen gefunden werden konnten, die polynomiell schneller sind als ihre einfachen Lösungen mittels dynamischer Programmierung. Wir zeigen, dass ein (im strengen Sinne) subquadratischer Algorithmus für diese und verwandte Ähnlichkeitsmaße die starke Exponentialzeithypothese (SETH) widerlegen würde. Für LCS zeigen wir eine scharfe Schranke an die optimale Laufzeit (unter der SETH und bis auf Faktoren niedrigerer Ordnung) in Abhängigkeit aller bisher untersuchten Eingabeparameter.
Im zweiten Teil untersuchen wir die Approximationsgüte der klassischen 2-Opt-Heuristik für das Problem des Handlungsreisenden anhand des Smoothed-Analysis-Paradigmas. Weiterhin entwickeln wir einen verbesserten Approximationsalgorithmus für die Fréchet-Distanz auf einer Klasse natürlicher Eingaben.
Der letzte Teil beweist neue Schranken für die Effektivität von Prozessen, die Informationen entweder so schnell wie möglich (Rumor-Spreading) oder so anonym wie möglich (Kryptogenografie) verbreiten