Pages that link to "Item:Q2849348"
From MaRDI portal
The following pages link to An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions (Q2849348):
Displaying 32 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)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- The secretary recommendation problem (Q2155898) (← 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)
- A note on the online interval scheduling secretary problem (Q2670476) (← 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)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
- (Q5002758) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- (Q5091060) (← 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)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- Approximation algorithms for stochastic online matching with reusable resources (Q6046972) (← links)
- Packing returning secretaries (Q6087124) (← links)
- Secretary and online matching problems with machine learned advice (Q6108930) (← links)
- Truthful Matching with Online Items and Offline Agents (Q6492090) (← links)
