Building a Good Team: Secretary Problems and the Supermodular Degree
暂无分享,去创建一个
[1] Morteza Zadimoghaddam,et al. Submodular secretary problem and extensions , 2013, TALG.
[2] Moran Feldman,et al. The Submodular Secretary Problem Goes Linear , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[3] C. Greg Plaxton,et al. Competitive Weighted Matching in Transversal Matroids , 2008, ICALP.
[4] Boaz Patt-Shamir,et al. Online Set Packing , 2012, SIAM J. Comput..
[5] Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.
[6] Yajun Wang,et al. Secretary problems: laminar matroid and interval scheduling , 2011, SODA '11.
[7] Uriel Feige,et al. Welfare maximization and the supermodular degree , 2013, ITCS '13.
[8] Oded Schwartz,et al. On the complexity of approximating k-set packing , 2006, computational complexity.
[9] Nicole Immorlica,et al. A Unifying Hierarchy of Valuations with Complements and Substitutes , 2014, AAAI.
[10] Tengyu Ma,et al. The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems , 2013, STACS.
[11] Patrick Jaillet,et al. Advances on Matroid Secretary Problems: Free Order Model and Laminar Case , 2012, IPCO.
[12] Nicole Immorlica,et al. A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.
[13] Jan Vondrák,et al. On Variants of the Matroid Secretary Problem , 2011, ESA.
[14] Oded Lachish,et al. O(log log Rank) Competitive Ratio for the Matroid Secretary Problem , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[15] Nicole Immorlica,et al. Matroids, secretary problems, and online mechanisms , 2007, SODA '07.
[16] Martin Pál,et al. Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.
[17] Moran Feldman,et al. Constrained Monotone Function Maximization and the Supermodular Degree , 2014, APPROX-RANDOM.
[18] Nicole Immorlica,et al. Online auctions and generalized secretary problems , 2008, SECO.
[19] D. Meyer,et al. Supporting Online Material Materials and Methods Som Text Figs. S1 to S6 References Evidence for a Collective Intelligence Factor in the Performance of Human Groups , 2022 .
[20] Roy Schwartz,et al. Improved competitive ratios for submodular secretary problems , 2011 .
[21] Sourav Chakraborty,et al. Improved competitive ratio for the matroid secretary problem , 2012, SODA.
[22] Aaron Roth,et al. Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms , 2010, WINE.
[23] Ola Svensson,et al. A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem , 2014, ArXiv.
[24] José A. Soto,et al. Matroid secretary problem in the random assignment model , 2010, SODA '11.
[25] Noam Nisan,et al. On the Computational Power of Demand Queries , 2009, SIAM J. Comput..
[26] Tim Roughgarden,et al. Combinatorial auctions with restricted complements , 2012, EC '12.
[27] S. Matthew Weinberg,et al. Prophet Inequalities with Limited Information , 2013, SODA.