Pages that link to "Item:Q5384062"

The following pages link to Prophet Inequalities with Limited Information (Q5384062):

Displaying 19 items.

• Online network design with outliers (Q334928) (← links)
• Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
• Prophet inequalities vs. approximating optimum online (Q2190412) (← links)
• Prophet secretary through blind strategies (Q2235156) (← links)
• From pricing to prophets, and back! (Q2294260) (← links)
• Performance bounds for optimal sales mechanisms beyond the monotone hazard rate condition (Q2425155) (← links)
• Bayesian auctions with efficient queries (Q2667811) (← links)
• Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs (Q3304731) (← links)
• Robust Auctions for Revenue via Enhanced Competition (Q3387955) (← links)
• The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
• On Policies for Single-Leg Revenue Management with Limited Demand Information (Q4994151) (← links)
• Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
• Prophet Matching with General Arrivals (Q5085120) (← links)
• Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution (Q5085141) (← links)
• A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
• A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)
• Prophet Secretary (Q5348218) (← links)
• Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online (Q5868957) (← links)
• Secretary and online matching problems with machine learned advice (Q6108930) (← links)