π
π
The Cartographer
The Secretary Problem with Distributions
December 04, 2020 Β· Declared Dead Β· π Conference on Integer Programming and Combinatorial Optimization
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Pranav Nuti
arXiv ID
2012.02888
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM,
math.PR
Citations
6
Venue
Conference on Integer Programming and Combinatorial Optimization
Last Checked
4 months ago
Abstract
We study a variant of the secretary problem where candidates come from independent, not necessarily identical distributions known to us, and show that we can do at least as well as in the IID setting. This resolves a conjecture of Esfandiari et al.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted