Pages that link to "Item:Q2921721"
From MaRDI portal
The following pages link to A multiple-choice secretary algorithm with applications to online auctions (Q2921721):
Displaying 10 items.
- Prophet Secretary (Q5348218) (← links)
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order (Q5363004) (← links)
- (Q5743511) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Online random sampling for budgeted settings (Q5919606) (← links)
- Machine covering in the random-order model (Q6103518) (← links)
- Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)
- A truthful near-optimal mechanism for online linear packing-covering problem in the random order model (Q6543267) (← links)
- Algorithms for maximum social welfare of online random trading (Q6558686) (← links)
- Prophet secretary for combinatorial auctions and matroids (Q6640585) (← links)