REVIEW 1 cited by
Prophet Secretary and Matching: the Significance of the Largest Item
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
The prophet secretary problem is a combination of the prophet inequality and the secretary problem, where elements are drawn from known independent distributions and arrive in uniformly random order. In this work, we design 1) a $0.688$-competitive algorithm, that breaks the $0.675$ barrier of blind strategies (Correa, Saona, Ziliotto, 2021), and 2) a $0.641$-competitive algorithm for the prophet secretary matching problem, that breaks the $1-1/e\approx 0.632$ barrier for the first time. Our second result also applies to the query-commit model of weighted stochastic matching and improves the state-of-the-art ratio (Derakhshan and Farhadi, 2023).
Forward citations
Cited by 1 Pith paper
-
The Competition Complexity of Prophet Secretary
The (1-epsilon)-competition complexity of prophet secretary is Theta(ln(1/epsilon)) for single-threshold algorithms, Theta(ln(1/epsilon)/ln ln(1/epsilon)) for time-based and activation-based algorithms, and Theta(sqrt...
Discussion (0). Continue with ORCID to comment.