### Citations

181 | An optimal algorithm for online bipartite matching.
- Karp, Vazirani, et al.
- 1990
(Show Context)
Citation Context ...offline performance, OPT, is bounded by α. In other words, ALG(I) OPT (I) ≥ α for any instance of the problem I. Karp et. al. describe an optimal randomized algorithm for online bipartite matching in =-=[4]-=-. The input is represented as adjacency matrix B for G(U,V,E), a bipartite graph on 2n vertices that contains a perfect matching. We can let the rows represent the nodes in U, the boys, and the column... |

149 | Adwords and generalized online matching.
- Mehta, Saberi, et al.
- 2007
(Show Context)
Citation Context ... their algorithm in the general case when there is no prior knowledge about the input queries. The primary assumption of the algorithm is that bids are small compared to an advertiser’s daily budget. =-=[5]-=- Together with Gagan Goel, Mehta explored the Adwords problem when assumptions can be made about the distribution of search queries. They showed that a simple greedy algorithm achieves the same compet... |

68 | Online budgeted matching in random input models with applications to Adwords. In
- Goel, Mehta
- 2008
(Show Context)
Citation Context ... that a simple greedy algorithm achieves the same competitive ratio as the more complex algorithm of Mehta et. al. in the random input model, as wall as in i.i.d. input models. This factor is 1− 1e . =-=[1]-=- 2 Online Bipartite Matching The online bipartite matching problem is classically described with the following problem. A matchmaker and n boys are gathered in a room. n girls appear, one at a time. E... |

56 | On-line weighted matching.
- Kalyanasundaram, Pruhs
- 1991
(Show Context)
Citation Context ..., i.e., servers that can fulfill the request, are divulged. Each server can service a single request. The task is to find a minimum weight matching of requests to servers online as each node arrives. =-=[3]-=- The effectiveness of an online algorithm is measured by competitive analysis. We say an algorithm ALG is α-competitive if the ratio between its performance and the optimal offline performance, OPT, i... |

41 | An optimal deterministic algorithm for online b -matching.
- Kalyanasundaram, Pruhs
- 2000
(Show Context)
Citation Context ...rithm matches ads as they arrive with a competitive factor of 1− 1e . 3 Online b-matching The work of Karp, Vazirani, and Vazirani was extended to b-matching by Bala Kalyanasundaram and Kirk Pruhs in =-=[2]-=-. In a b-matching prolem, each server can be matched to several requests within a predetermined service limit. This is unlike the assignment problem in which a server vertex is matched only once. A b-... |

1 |
Computer scientists optimize innovative ad auction
- Robinson
- 2005
(Show Context)
Citation Context ...arp proved a solution to it in 1990, the researchers saw online matching as a beautiful research problem. Umesh Vazirani says. “At the time, we had no idea it would turn out to have practical value.” =-=[7]-=- Based on previous algorithms for online allocation, Mehta et. al. devised an innovative deterministic algorithm. They prove the optimality of their algorithm in the general case when there is no prio... |