41 research outputs found

    Stable Secretaries

    Full text link
    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

    Hunter, Cauchy Rabbit, and Optimal Kakeya Sets

    Get PDF
    A planar set that contains a unit segment in every direction is called a Kakeya set. We relate these sets to a game of pursuit on a cycle â„€_n. A hunter and a rabbit move on the nodes of â„€_n without seeing each other. At each step, the hunter moves to a neighbouring vertex or stays in place, while the rabbit is free to jump to any node. Adler et al. (2003) provide strategies for hunter and rabbit that are optimal up to constant factors and achieve probability of capture in the first n steps of order 1/ log n. We show these strategies yield a Kakeya set consisting of 4n triangles with minimal area (up to constant), namely Θ(1/ log n). As far as we know, this is the first non-iterative construction of a boundary-optimal Kakeya set. Considering the continuum analog of the game yields a construction of a random Kakeya set from two independent standard Brownian motions {B(s) : s ≄ 0} and {W(s) : s ≄ 0}. Let τ_t := min{s ≄ 0 : B(s) = t}. Then X_t = W(τ_t) is a Cauchy process and K := {(ɑ,X_t + ɑt) : ɑ, t ∈ [0, 1]} is a Kakeya set of zero area. The area of the Δ-neighbourhood of K is as small as possible, i.e., almost surely of order Θ(1/| log Δ|)

    Hunter, Cauchy Rabbit, and Optimal Kakeya Sets

    Get PDF
    A planar set that contains a unit segment in every direction is called a Kakeya set. We relate these sets to a game of pursuit on a cycle Zn\Z_n. A hunter and a rabbit move on the nodes of Zn\Z_n without seeing each other. At each step, the hunter moves to a neighbouring vertex or stays in place, while the rabbit is free to jump to any node. Adler et al (2003) provide strategies for hunter and rabbit that are optimal up to constant factors and achieve probability of capture in the first nn steps of order 1/log⁥n1/\log n. We show these strategies yield a Kakeya set consisting of 4n4n triangles with minimal area, (up to constant), namely Θ(1/log⁥n)\Theta(1/\log n). As far as we know, this is the first non-iterative construction of a boundary-optimal Kakeya set. Considering the continuum analog of the game yields a construction of a random Kakeya set from two independent standard Brownian motions {B(s):s≄0}\{B(s): s \ge 0\} and {W(s):s≄0}\{W(s): s \ge 0\}. Let τt:=min⁥{s≄0:B(s)=t}\tau_t:=\min\{s \ge 0: B(s)=t\}. Then Xt=W(τt)X_t=W(\tau_t) is a Cauchy process, and K:={(a,Xt+at):a,t∈[0,1]}K:=\{(a,X_t+at) : a,t \in [0,1]\} is a Kakeya set of zero area. The area of the Ï”\epsilon-neighborhood of KK is as small as possible, i.e., almost surely of order Θ(1/∣logâĄÏ”âˆŁ)\Theta(1/|\log \epsilon|)

    Hunter, Cauchy rabbit, and optimal Kakeya sets

    Full text link

    A Universal Expression/Silencing Vector in Plants[C][OA]

    No full text
    A universal vector (IL-60 and auxiliary constructs), expressing or silencing genes in every plant tested to date, is described. Plants that have been successfully manipulated by the IL-60 system include hard-to-manipulate species such as wheat (Triticum duram), pepper (Capsicum annuum), grapevine (Vitis vinifera), citrus, and olive (Olea europaea). Expression or silencing develops within a few days in tomato (Solanum lycopersicum), wheat, and most herbaceous plants and in up to 3 weeks in woody trees. Expression, as tested in tomato, is durable and persists throughout the life span of the plant. The vector is, in fact, a disarmed form of Tomato yellow leaf curl virus, which is applied as a double-stranded DNA and replicates as such. However, the disarmed virus does not support rolling-circle replication, and therefore viral progeny single-stranded DNA is not produced. IL-60 does not integrate into the plant's genome, and the construct, including the expressed gene, is not heritable. IL-60 is not transmitted by the Tomato yellow leaf curl virus's natural insect vector. In addition, artificial satellites were constructed that require a helper virus for replication, movement, and expression. With IL-60 as the disarmed helper “virus,” transactivation occurs, resulting in an inducible expressing/silencing system. The system's potential is demonstrated by IL-60-derived suppression of a viral-silencing suppressor of Grapevine virus A, resulting in Grapevine virus A-resistant/tolerant plants
    corecore