2 citations · 3 across the 6 of their papers we have counts for
6 papers
A combinatorial proof for the secretary problem with multiple choices
Xujun Liu, Olgica Milenkovic, George V. Moustakides
The Secretary problem is a classical sequential decision-making question that can be succinctly described as follows: a set of rank-ordered applicants are interviewed sequentially…
Balanced and Swap-Robust Trades for Dynamical Distributed Storage
Chao Pan, Ryan Gabrys, Xujun Liu +2
Trades, introduced by Hedayat, are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their con…
Optimal Stopping Methodology for the Secretary Problem with Random Queries
George V. Moustakides, Xujun Liu, Olgica Milenkovic
Candidates arrive sequentially for an interview process which results in them being ranked relative to their predecessors. Based on the ranks available at each time, one must devel…
Query-Based Selection of Optimal Candidates under the Mallows Model
Xujun Liu, Olgica Milenkovic, George V. Moustakides
We study the secretary problem in which rank-ordered lists are generated by the Mallows model and the goal is to identify the highest-ranked candidate through a sequential intervie…
Finding the Second-Best Candidate under the Mallows Model
Xujun Liu, Olgica Milenkovic
The well-known secretary problem in sequential analysis and optimal stopping theory asks one to maximize the probability of finding the optimal candidate in a sequentially examined…
Directed Intersection Representations and the Information Content of Digraphs
Xujun Liu, Roberto Machado, Olgica Milenkovic
Consider a directed graph (digraph) in which vertices are assigned color sets, and two vertices are connected if and only if they share at least one color and the tail vertex has a…