ICALP 2009: Automata, Languages and Programming pp 508-520 | Cite as
Algorithms for Secretary Problems on Graphs and Hypergraphs
Abstract
We examine online matching problems with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G(L ∪ R, E). We develop an 8-competitive algorithm for the following secretary problem: Initially given R, and the size of L, the algorithm receives the vertices of L 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 immediately either match l to an available vertex of R, or decide that l will remain unmatched.
In [5], the authors show a 16-competitive algorithm for the transversal matroid secretary problem, which is the special case with weights on vertices, not edges. (Equivalently, one may assume that for each l ∈ L, the weights on all edges incident to l are identical.) We use a very similar algorithm, but simplify and improve the analysis to obtain a better competitive ratio for the more general problem. Our analysis is easily extended to obtain competitive algorithms for a class of similar problems, such as to find disjoint sets of edges in hypergraphs where edges arrive online. We also introduce secretary problems with adversarially chosen groups.
Finally, we give a 2e-competitive algorithm for the secretary problem on graphic matroids, where, with edges appearing online, the goal is to find a maximum-weight acyclic subgraph of a given graph.
Keywords
Bipartite Graph Competitive Ratio Edge Incident Random Permutation Online AlgorithmPreview
Unable to display preview. Download preview PDF.
References
- 1.Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary Problems: Weights and Discounts. In: Proc. of ACM-SIAM SODA, pp. 1245–1254 (2009)Google Scholar
- 2.Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, Secretary Problems, and Online Mechanisms. In: Proc. of ACM-SIAM SODA, pp. 434–443 (2007)Google Scholar
- 3.Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: A Knapsack Secretary Problem with Applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX 2007. LNCS, vol. 4627, pp. 16–28. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 4.Constantin, F., Feldman, J., Muthukrishnan, S., Pál, M.: Online Ad Slotting with Cancellations. In: Proc. of ACM-SIAM SODA, pp. 1265–1274 (2009)Google Scholar
- 5.Dimitrov, N.B., Plaxton, C.G.: Competitive Weighted Matching in Transversal Matroids. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 397–408. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 6.Ferguson, T.S.: Who Solved the Secretary Problem? J. Stat. Sci. 4, 282–289 (1989)MathSciNetCrossRefMATHGoogle Scholar
- 7.Gardner, M.: Mathematical Games column. Scientific Amer. 35 (February/March 1960)Google Scholar
- 8.Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: Proc. 5th ACM Conf. on Electronic commerce, pp. 71–80 (2004)Google Scholar
- 9.Jenkyns, T.A.: The efficiency of the “greedy” algorithm. In: Proc. of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing, pp. 341–350 (1976)Google Scholar
- 10.Kleinberg, R.: A multiple-choice secretary problem with applications to online auctions. In: Proc. of ACM-SIAM SODA, pp. 630–631 (2005)Google Scholar
- 11.Mestre, J.: Greedy in Approximation Algorithms. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 528–539. Springer, Heidelberg (2006)CrossRefGoogle Scholar