Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
By T-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang. 2015
25 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Management Science and Operations Research, Game & Decision Theory, Algorithms & Complexity
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Leon Ladewig
- Susanne Albers
- Renato Paes Leme
- Sergei Vassilvitskii
- Silvio Lattanzi
- Paul Dütting
- Arindam Khan
- Andrea Vattani
In Computer Networks and Communications
- Leon Ladewig
- Susanne Albers
- Renato Paes Leme
- Sergei Vassilvitskii
- Silvio Lattanzi
- Paul Dütting
- Arindam Khan
In Management Science and Operations Research
In Game & Decision Theory
In Algorithms & Complexity
- Leon Ladewig
- Susanne Albers
- Sergei Vassilvitskii
- Silvio Lattanzi
- Arindam Khan
- Melanie Schmidt
- Alan L. Yuille
- Andreas Krause
Citations in the corpus
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (2020, methodology): “l-known example is the secretary problem [16,32]. Nowadays, the matroid secretary problem [8,19] is considered as one of the most central problems in this eld. Further multiple-choice generalizations [13,30] are part of active research as well. The model has also been successfully applied to other p”
- Secretaries with Advice (2020, background): “The second one is [8], which extends this formulation to the ( j, k)-secretary problem.”