scientific article

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Auctions, bargaining, bidding and selling, and other market models (91B26) Online algorithms; streaming algorithms (68W27)

Related Items

Prophet Secretary ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ The simulated greedy algorithm for several submodular matroid secretary problems ⋮ Optimal algorithms for \(k\)-search with application in option pricing ⋮ Secretary Markets with Local Information ⋮ Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints ⋮ Prophet Secretary ⋮ The Temp Secretary Problem ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ Online network design with outliers ⋮ The secretary recommendation problem ⋮ Model Predictive Control for Dynamic Resource Allocation ⋮ Finding the second-best candidate under the Mallows model ⋮ A Dynamic Near-Optimal Algorithm for Online Linear Programming ⋮ New results for the \(k\)-secretary problem ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Analysis of the ``hiring above the median selection strategy for the hiring problem ⋮ A note on the online interval scheduling secretary problem ⋮ Machine covering in the random-order model ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Unnamed Item ⋮ Competitive weighted matching in transversal matroids ⋮ Knapsack secretary through boosting ⋮ Generalized Sequential Stochastic Assignment Problem ⋮ Uniformly Bounded Regret in the Multisecretary Problem ⋮ The secretary problem with reservation costs ⋮ Know when to persist: deriving value from a stream buffer ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ Analysis of the strategy ``hiring above the \(m\)-th best candidate ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints ⋮ The Submodular Secretary Problem Goes Linear ⋮ Scheduling In the random-order model ⋮ Online \((J, K)\)-search problem and its competitive analysis ⋮ Buyback Problem - Approximate Matroid Intersection with Cancellation Costs ⋮ Online random sampling for budgeted settings ⋮ Secretary markets with local information ⋮ On variants of the matroid secretary problem ⋮ Unnamed Item ⋮ Prior independent mechanisms via prophet inequalities with limited information ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ Iterative computation of security strategies of matrix games with growing action set ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Know When to Persist: Deriving Value from a Stream Buffer ⋮ Online k-max Search Algorithms with Applications to the Secretary Problem ⋮ Secretary problem: graphs, matroids and greedoids ⋮ How the Experts Algorithm Can Help Solve LPs Online ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Online Resource Allocation Under Partially Predictable Demand ⋮ Online algorithms for the maximum \(k\)-interval coverage problem ⋮ Unnamed Item