Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
暂无分享,去创建一个
Aravind Srinivasan | John P. Dickerson | Pan Xu | Karthik Abinav Sankararaman | A. Srinivasan | Pan Xu
[1] Chandra Chekuri,et al. Submodular function maximization via the multilinear relaxation and contention resolution schemes , 2011, STOC '11.
[2] Aravind Srinivasan,et al. Allocation Problems in Ride-sharing Platforms , 2017, AAAI.
[3] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[4] Sreenivas Gollapudi,et al. Diversifying search results , 2009, WSDM '09.
[5] T.-H. Hubert Chan,et al. Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids , 2017, SODA.
[6] Aravind Srinivasan,et al. New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching , 2016, ESA.
[7] Laurence A. Wolsey,et al. Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..
[8] Yaron Singer,et al. Pricing mechanisms for crowdsourcing markets , 2013, WWW.
[9] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..
[10] Andreas Krause,et al. Distributed Submodular Maximization , 2014, J. Mach. Learn. Res..
[11] Roy Schwartz,et al. Online Submodular Maximization with Preemption , 2015, SODA.
[12] Baruch Schieber,et al. Constrained Submodular Maximization via Greedy Local Search , 2017, Oper. Res. Lett..
[13] Chien-Ju Ho,et al. Online Task Assignment in Crowdsourcing Markets , 2012, AAAI.
[14] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[15] Jieping Ye,et al. Flexible Online Task Assignment in Real-Time Spatial Data , 2017, Proc. VLDB Endow..
[16] Sepehr Assadi,et al. Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets , 2015, HCOMP.
[17] Mark Fuge,et al. Diverse Weighted Bipartite b-Matching , 2017, IJCAI.
[18] Maxim Sviridenko,et al. Submodular Stochastic Probing on Matroids , 2016, Math. Oper. Res..
[19] Xiang-Yang Li,et al. How to crowdsource tasks truthfully without sacrificing utility: Online incentive mechanisms with budget constraint , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.
[20] Aranyak Mehta,et al. Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..
[21] Andreas Krause,et al. Stochastic Submodular Maximization: The Case of Coverage Functions , 2017, NIPS.
[22] Baharan Mirzasoleiman,et al. Fast Constrained Submodular Maximization: Personalized Data Summarization , 2016, ICML.
[23] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[24] Robert J. Vanderbei. The Optimal Choice of a Subset of a Population , 1980, Math. Oper. Res..
[25] Morteza Zadimoghaddam,et al. Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.
[26] Andreas Krause,et al. Streaming submodular maximization: massive data summarization on the fly , 2014, KDD.
[27] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[28] Jan Vondrák,et al. Online Submodular Welfare Maximization: Greedy is Optimal , 2012, SODA.
[29] Rishabh K. Iyer,et al. Learning Mixtures of Submodular Functions for Image Collection Summarization , 2014, NIPS.
[30] Rishabh K. Iyer,et al. Submodularity in Data Subset Selection and Active Learning , 2015, ICML.
[31] Gediminas Adomavicius,et al. Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques , 2012, IEEE Transactions on Knowledge and Data Engineering.
[32] Nikhil R. Devanur,et al. Fast Algorithms for Online Stochastic Convex Programming , 2014, SODA.
[33] Lei Chen,et al. Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis , 2016, Proc. VLDB Endow..
[34] F. Maxwell Harper,et al. The MovieLens Datasets: History and Context , 2016, TIIS.
[35] Lei Chen,et al. Online mobile Micro-Task Allocation in spatial crowdsourcing , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).
[36] Morteza Zadimoghaddam,et al. Probabilistic Submodular Maximization in Sub-Linear Time , 2017, ICML.
[37] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[38] A. Subramanian,et al. Online incentive mechanism design for smartphone crowd-sourcing , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).
[39] Andreas Krause,et al. Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly , 2017, AAAI.
[40] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[41] Andreas Krause,et al. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms , 2013, WWW.
[42] Jan Vondrák,et al. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2010, Math. Oper. Res..
[43] Tao Li,et al. iHR: an online recruiting system for Xiamen Talent Service Center , 2013, KDD.