scientific article

Nicole Immorlica, Moshe Babaioff, Robert D. Kleinberg

Publication date: 18 December 2014

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

Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Combinatorial aspects of matroids and geometric lattices (05B35) Online algorithms; streaming algorithms (68W27)

Related Items (55)

Prophet Secretary ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ The simulated greedy algorithm for several submodular matroid secretary problems ⋮ Streaming Algorithms for Submodular Function Maximization ⋮ Secretary Markets with Local Information ⋮ Polymatroid Prophet Inequalities ⋮ Prophet Secretary ⋮ The Temp Secretary Problem ⋮ Online Appointment Scheduling in the Random Order Model ⋮ Sequential Posted Price Mechanisms with Correlated Valuations ⋮ Formal barriers to simple algorithms for the matroid secretary problem ⋮ Online network design with outliers ⋮ New results for the \(k\)-secretary problem ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ A note on the online interval scheduling secretary problem ⋮ Near optimal algorithms for online weighted bipartite matching in adversary model ⋮ Query-based selection of optimal candidates under the Mallows model ⋮ Constant-competitiveness for random assignment matroid secretary without knowing the matroid ⋮ Packing returning secretaries ⋮ Generalized laminar matroids ⋮ A new look at the returning secretary problem ⋮ The best-or-worst and the postdoc problems with random number of candidates ⋮ Matroid-constrained vertex cover ⋮ Competitive weighted matching in transversal matroids ⋮ Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays ⋮ Know when to persist: deriving value from a stream buffer ⋮ Tight Revenue Gaps Among Simple Mechanisms ⋮ Matroid prophet inequalities and applications to multi-dimensional mechanism design ⋮ The Submodular Secretary Problem Goes Linear ⋮ Online \((J, K)\)-search problem and its competitive analysis ⋮ The best-or-worst and the postdoc problems ⋮ On the on-line maintenance scheduling problem ⋮ Buyback Problem - Approximate Matroid Intersection with Cancellation Costs ⋮ Laminar matroids ⋮ Stable secretaries ⋮ Online ascending auctions for gradually expiring items ⋮ 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 ⋮ Optimal composition ordering problems for piecewise linear functions ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ From pricing to prophets, and back! ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Worst-Case Mechanism Design via Bayesian Analysis ⋮ Know When to Persist: Deriving Value from a Stream Buffer ⋮ Online k-max Search Algorithms with Applications to the Secretary Problem ⋮ How the Experts Algorithm Can Help Solve LPs Online ⋮ Matroidal Choice Functions ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Online Contention Resolution Schemes with Applications to Bayesian Selection Problems ⋮ Unnamed Item ⋮ Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property

This page was built for publication: