Matroid Bayesian online selection

DOI10.1007/978-3-031-71033-9_23MaRDI QIDQ7034796zbMATH OpenFDO

Authors Ian DeHaan, Kanstantsin Pashkovich

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71033-9_23

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• ``Who is next in line? On the significance of knowing the arrival order in Bayesian online settings
• A PTAS for a class of stochastic dynamic programs
• Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
• Beating \(1-\frac{1}{e}\) for ordered prophets
• Beyond matroids: secretary problem and prophet inequality with general constraints
• Combinatorial prophet inequalities
• Comparison of threshold stop rules and maximum for independent nonnegative random variables
• Comparisons of stop rule and supremum expectations of i.i.d. random variables
• scientific article; zbMATH DE number 67295 (Why is no real title available?)
• scientific article; zbMATH DE number 7788508 (Why is no real title available?)
• Matroid prophet inequalities
• Online contention resolution schemes
• Prophet Inequalities with Limited Information
• Prophet secretary
• Prophet secretary for combinatorial auctions and matroids
• Prophet secretary through blind strategies
• Semiamarts and finite values
• The importance of knowing the arrival order in combinatorial Bayesian settings

This page was built for publication: Matroid Bayesian online selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034796)