| Document Date: 2014-10-29 22:53:28
Open Document File Size: 509,80 KBShare Result on Facebook
City Kesselheim / / Company K LP / Most Optimal LP / Continuous LP / payoff LP / / / Facility University of Hong / / IndustryTerm by-product / infinite algorithms / infinite algorithm / threshold algorithms satfiltering threshold algorithm / online bipartite matching alDefinition / online 1item auction / Online K-Item Auction / classical secretary algorithm / online auction / online bipartite matching problem / similar algorithm / conventional algorithms / monotone algorithm / online node / monotone secretary algorithm / randomness algorithm / online packing / recursive algorithm / threshold algorithms / Online Bipartite K-Matching / online nodes / feasible solution / deterministic algorithm / secretary algorithm / threshold algorithm / α-filtering threshold algorithm / dual feasible solution / primal solution / / Organization University of Hong / Department of Computer Science / / Person Ai / H. Hubert Chan∗ Fei Chen / / Position model for any n / General / secretary / Generalized Secretary / / Technology same threshold algorithm / filtering algorithm / randomized algorithm / 2 2 algorithm / secretary algorithm / infinite algorithm / Threshold Algorithm / α-Filtering Threshold Algorithm / corresponding threshold algorithm / randomness algorithm / threshold algorithms / recursive algorithm / alternative rounding-based algorithm / classical secretary algorithm / An algorithm / threshold algorithms satfiltering threshold algorithm / monotone algorithm / deterministic algorithm / similar algorithm / monotone secretary algorithm / 2.2 Analyzing Monotone Algorithms / /
SocialTag |
Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order T-H. Hubert Chan∗ Fei Chen∗