13 research outputs found
Partially ordered secretaries
The elements of a finite nonempty partially ordered set are exposed at
independent uniform times in to a selector who, at any given time, can
see the structure of the induced partial order on the exposed elements. The
selector's task is to choose online a maximal element. This generalizes the
classical linear order secretary problem, for which it is known that the
selector can succeed with probability and that this is best possible. We
describe a strategy for the general problem that achieves success probability
for an arbitrary partial order.Comment: 5 page
The Best-or-Worst and the Postdoc problems
We consider two variants of the secretary problem, the\emph{ Best-or-Worst}
and the \emph{Postdoc} problems, which are closely related. First, we prove
that both variants, in their standard form with binary payoff 1 or 0, share the
same optimal stopping rule. We also consider additional cost/perquisites
depending on the number of interviewed candidates. In these situations the
optimal strategies are very different. Finally, we also focus on the
Best-or-Worst variant with different payments depending on whether the selected
candidate is the best or the worst
Topics in algorithmic, enumerative and geometric combinatorics
This thesis presents five papers, studying enumerative and
extremal problems on combinatorial structures.
The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the S_2xS_{n-2}-homotopy type of the complex of non-connected graphs on n nodes. In the introduction, connections are drawn between the first paper and the evasiveness conjecture for monotone graph properties.
In the second paper, we investigate Hansen polytopes of split graphs. By applying a partitioning
technique, the number of nonempty faces is counted, and in particular we confirm
Kalai's 3^d-conjecture for such polytopes. Furthermore, a characterization of
exactly which Hansen polytopes are also Hanner polytopes is given. We end by
constructing an interesting class of Hansen polytopes having very few faces and
yet not being Hanner.
The third paper studies the problem of packing a pattern as densely as possible into compositions. We are able to find the
packing density for some classes of generalized patterns, including all the three letter patterns.
In the fourth paper, we present combinatorial proofs of the enumeration of derangements with descents in prescribed positions. To this end, we
consider fixed point lambda-coloured permutations, which are easily
enumerated. Several formulae regarding these numbers are given, as
well as a generalisation of Euler's difference tables. We also prove that except in a trivial special case, the event that pi has descents in a set S of positions is positively correlated with the event that pi is a derangement, if pi is chosen uniformly in S_n.
The fifth paper solves a partially ordered generalization of the famous secretary problem. The elements of a finite nonempty partially ordered set are exposed in uniform random order to a selector who, at any given time, can see the relative order of the exposed elements. The selector's task is to choose online a maximal element. We describe a strategy for the general problem that achieves success probability at least 1/e for an arbitrary partial order, thus proving that the linearly ordered set is at least as difficult as any other instance of the problem. To this end, we define a probability measure on the maximal elements of an arbitrary partially ordered set, that may be interesting in its own right
Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
The classical secretary problem investigates the question of how to hire the
best secretary from 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 -queue -choice
-best secretary problem. In this problem, candidates are evenly
distributed into queues, and instead of hiring the best one, the employer
wants to hire candidates among the best persons. The quotas are
shared by all queues. This problem is a generalized version of -choice
-best problem which has been extensively studied and it has more practical
value as it characterizes the parallel situation.
Although a few of works have been done about this generalization, to the best
of our knowledge, no optimal deterministic protocol was known with general
queues. In this paper, we provide an optimal deterministic protocol for this
problem. The protocol is in the same style of the -solution for the
classical secretary problem, but with multiple phases and adaptive criteria.
Our protocol is very simple and efficient, and we show that several
generalizations, such as the fractional -choice -best secretary problem
and exclusive -queue -choice -best secretary problem, can be solved
optimally by this protocol with slight modification and the latter one solves
an open problem of Feldman and Tennenholtz [14].
In addition, we provide theoretical analysis for two typical cases, including
the 1-queue 1-choice -best problem and the shared 2-queue 2-choice 2-best
problem. For the former, we prove a lower bound of
the competitive ratio. For the latter, we show the optimal competitive ratio is
while previously the best known result is 0.356 [14].Comment: This work is accepted by ISAAC 201