An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 589-600
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching2013
- Improved Competitive Ratio for the Matroid Secretary Problem2012
- Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations2011
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)2011
- Competitive Weighted Matching in Transversal MatroidsAlgorithmica, 2010
- Secretary Problems via Linear ProgrammingLecture Notes in Computer Science, 2010
- The adwords problem2009
- On-line bipartite matching made simpleACM SIGACT News, 2008
- Combinatorial Algorithms for the Unsplittable Flow ProblemAlgorithmica, 2005
- Who Solved the Secretary Problem?Statistical Science, 1989