Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Online weighted matching with a sample
We study the greedy-based online algorithm for edge-weighted matching with (one-sided)
vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was …
vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was …
Ordinal approximation for social choice, matching, and facility location problems given candidate positions
In this work, we consider general facility location and social choice problems, in which sets
of agents A and facilities F are located in a metric space, and our goal is to assign agents to …
of agents A and facilities F are located in a metric space, and our goal is to assign agents to …
Strong algorithms for the ordinal matroid secretary problem
In the ordinal matroid secretary problem (MSP), candidates do not reveal numerical weights,
but the decision maker can still discern if a candidate is better than another. An algorithm α …
but the decision maker can still discern if a candidate is better than another. An algorithm α …
General graphs are easier than bipartite graphs: Tight bounds for secretary matching
Online algorithms for secretary matching in bipartite weighted graphs have been studied
extensively in recent years. We generalize this study to secretary matching in general …
extensively in recent years. We generalize this study to secretary matching in general …
Matroid secretary is equivalent to contention resolution
We show that the matroid secretary problem is equivalent to correlated contention resolution
in the online random-order model. Specifically, the matroid secretary conjecture is true if and …
in the online random-order model. Specifically, the matroid secretary conjecture is true if and …
[HTML][HTML] New results for the k-secretary problem
Suppose that n items arrive online in random order and the goal is to select k of them such
that the expected sum of the selected items is maximized. The decision for any item is …
that the expected sum of the selected items is maximized. The decision for any item is …
Online dependent task assignment in preference aware spatial crowdsourcing
Spatial crowdsourcing platforms have become increasingly popular in people's daily life. A
fundamental problem in spatial crowdsourcing is task assignment, which assigns spatial …
fundamental problem in spatial crowdsourcing is task assignment, which assigns spatial …
Prophet inequalities via the expected competitive ratio
We consider prophet inequalities under downward-closed constraints. In this problem, a
decision-maker makes immediate and irrevocable choices on arriving elements, subject to …
decision-maker makes immediate and irrevocable choices on arriving elements, subject to …
The secretary recommendation problem
We revisit the basic variant of the classical secretary problem. We propose a new approach
in which we separate between an agent (the sender) that evaluates the secretary …
in which we separate between an agent (the sender) that evaluates the secretary …
Tight Bounds for Secretary Matching in General Graphs
Online algorithms for secretary matching in bipartite weighted graphs have been studied
extensively in recent years. We generalize this study to secretary matching in general …
extensively in recent years. We generalize this study to secretary matching in general …