Algorithms for Secretary Problems on Graphs and Hypergraphs

  title={Algorithms for Secretary Problems on Graphs and Hypergraphs},
  author={Nitish Korula and Martin P{\'a}l},
We examine several online matching problems, with applicat ions to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite setsL, R. We develop an8-competitive algorithm for the following secretary problem: Initially g iven R, and the size of L, the algorithm receives the vertices ofL sequentially, in a random order. When a vertex l ∈ L is seen, all edges incident to l are revealed, together with their weights. The algorithm must i mmediately either… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 111 citations. REVIEW CITATIONS
73 Citations
7 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 73 extracted citations

111 Citations

Citations per Year
Semantic Scholar estimates that this publication has 111 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-7 of 7 references


  • M. Babaioff, N. Immorlica, R. Kleinberg
  • Se cr tary Problems, and Online Mechanisms. Proc…
  • 2007
Highly Influential
5 Excerpts

Who Solved the Secretary Problem? J

  • T. S. Ferguson
  • Statist. Sci. vol. 4, 282–289
  • 1989
2 Excerpts

Mathematical Games column

  • M. Gardner
  • Scientific AmericanFeb., Mar., 35
  • 1960
1 Excerpt

Similar Papers

Loading similar papers…