Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol
暂无分享,去创建一个
[1] Moshe Tennenholtz,et al. Interviewing secretaries in parallel , 2012, EC '12.
[2] Michal Morayne,et al. On a universal best choice algorithm for partially ordered sets , 2008, Random Struct. Algorithms.
[3] Nicole Immorlica,et al. Matroids, secretary problems, and online mechanisms , 2007, SODA '07.
[4] Yajun Wang,et al. Secretary problems: laminar matroid and interval scheduling , 2011, SODA '11.
[5] Morteza Zadimoghaddam,et al. Submodular secretary problem and extensions , 2013, TALG.
[6] Mohit Singh,et al. Secretary Problems via Linear Programming , 2010, IPCO.
[7] Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.
[8] C. Greg Plaxton,et al. Competitive Weighted Matching in Transversal Matroids , 2008, ICALP.
[9] P. Freeman. The Secretary Problem and its Extensions: A Review , 1983 .
[10] Małgorzata Kuchta,et al. On a universal best choice algorithm for partially ordered sets , 2008 .
[11] Berthold Vöcking,et al. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions , 2013, ESA.
[12] Fei Chen,et al. A Primal-Dual Continuous LP Method on the Multi-choice Multi-best Secretary Problem , 2013, ArXiv.
[13] Jan Vondrák,et al. On Variants of the Matroid Secretary Problem , 2013, Algorithmica.
[14] Nicole Immorlica,et al. A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.
[15] Joseph Naor,et al. Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) , 2011, APPROX-RANDOM.
[16] Martin Pál,et al. Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.
[17] Mohammad Taghi Hajiaghayi,et al. Adaptive limited-supply online auctions , 2004, EC '04.
[18] Jorge Nuno Silva,et al. Mathematical Games , 1959, Nature.
[19] Silvio Lattanzi,et al. Hiring a secretary from a poset , 2011, EC '11.
[20] Nicole Immorlica,et al. Online auctions and generalized secretary problems , 2008, SECO.
[21] Noam Nisan,et al. Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.
[22] Sourav Chakraborty,et al. Improved competitive ratio for the matroid secretary problem , 2012, SODA.
[23] Aaron Roth,et al. Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.
[24] Elias Koutsoupias,et al. On the Competitive Ratio of Online Sampling Auctions , 2010, TEAC.
[25] Roy Schwartz,et al. Improved competitive ratios for submodular secretary problems , 2011 .
[26] C. Greg Plaxton,et al. Competitive Weighted Matching in Transversal Matroids , 2008, Algorithmica.
[27] Michael Dinitz,et al. Matroid Secretary for Regular and Decomposable Matroids , 2012, SIAM J. Comput..
[28] José A. Soto,et al. Matroid secretary problem in the random assignment model , 2010, SODA '11.
[29] Patrick Jaillet,et al. Advances on Matroid Secretary Problems: Free Order Model and Laminar Case , 2012, IPCO.
[30] Nimrod Megiddo,et al. Improved algorithms and analysis for secretary problems and generalizations , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[31] David Lindley,et al. Dynamic Programming and Decision Theory , 1961 .