An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Online Stochastic Matching: Beating 1-1/e
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved bounds for online stochastic matching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online vertex-weighted bipartite matching and single-bid budgeted allocations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic matching: online actions based on offline statistics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online algorithms with stochastic input
ACM SIGecom Exchanges
AdCell: ad allocation in cellular networks
ESA'11 Proceedings of the 19th European conference on Algorithms
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Online matching with concave returns
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Online prophet-inequality matching with applications to ad allocation
Proceedings of the 13th ACM Conference on Electronic Commerce
Asymptotically optimal algorithm for stochastic adwords
Proceedings of the 13th ACM Conference on Electronic Commerce
Flow-Based combinatorial chance constraints
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Stochastic matching with commitment
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Online Stochastic Matching: Online Actions Based on Offline Statistics
Mathematics of Operations Research
Catch them if you can: how to serve impatient users
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Whole-page optimization and submodular welfare maximization with online bidders
Proceedings of the fourteenth ACM conference on Electronic commerce
Efficient parking allocation as online bipartite matching with posted prices
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
We consider the online bipartite matching problem in the unknown distribution input model. We show that the Ranking algorithm of [KVV90] achieves a competitive ratio of at least 0.653. This is the first analysis to show an algorithm which breaks the natural 1 - 1/e -barrier' in the unknown distribution model (our analysis in fact works in the stricter, random order model) and answers an open question in [GM08]. We also describe a family of graphs on which Ranking does no better than 0.727 in the random order model. Finally, we show that for graphs which have k 1 disjoint perfect matchings, Ranking achieves a competitive ratio of at least 1 - √(1/k - 1/k2 + 1/n) -- in particular Ranking achieves a factor of 1 - o(1) for graphs with ω(1) disjoint perfect matchings.