Pages that link to "Item:Q2849348"

The following pages link to An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions (Q2849348):

Displayed 15 items.

• Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) ‎ (← links)
• On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) ‎ (← links)
• Buyback problem with discrete concave valuation functions (Q1751249) ‎ (← links)
• Stable secretaries (Q1999964) ‎ (← links)
• Online stochastic matching: new algorithms and bounds (Q2006938) ‎ (← links)
• Secretary markets with local information (Q2010597) ‎ (← links)
• An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) ‎ (← links)
• Prior independent mechanisms via prophet inequalities with limited information (Q2278945) ‎ (← links)
• Secretary Markets with Local Information (Q3449504) ‎ (← links)
• The Temp Secretary Problem (Q3452826) ‎ (← links)
• Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) ‎ (← links)
• Online Vertex-Weighted Bipartite Matching (Q4972684) ‎ (← links)
• Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios (Q5144796) ‎ (← links)
• The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) ‎ (← links)
• A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) ‎ (← links)