Online Stochastic Matching: New Algorithms and Bounds
暂无分享,去创建一个
Aravind Srinivasan | Pan Xu | Brian Brubach | Karthik Abinav Sankararaman | A. Srinivasan | Brian Brubach | Pan Xu
[1] Yin Tat Lee,et al. Efficient Inverse Maintenance and Faster Algorithms for Linear Programming , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[2] Aravind Srinivasan,et al. Attenuate Locally, Win Globally: Attenuation-Based Frameworks for Online Stochastic Matching with Timeouts , 2017, Algorithmica.
[3] Nikhil R. Devanur,et al. Asymptotically optimal algorithm for stochastic adwords , 2012, EC '12.
[4] Jon Feldman,et al. Online Ad Assignment with Free Disposal , 2009, WINE.
[5] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[6] Thomas P. Hayes,et al. The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.
[7] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..
[8] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.
[9] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[10] Morteza Zadimoghaddam,et al. Online Stochastic Weighted Matching: Improved Approximation Algorithms , 2011, WINE.
[11] Mohammad Taghi Hajiaghayi,et al. The Online Stochastic Generalized Assignment Problem , 2013, APPROX-RANDOM.
[12] Berthold Vöcking,et al. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions , 2013, ESA.
[13] Mohammad Taghi Hajiaghayi,et al. Online prophet-inequality matching with applications to ad allocation , 2012, EC '12.
[14] Nikhil R. Devanur,et al. Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.
[15] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[16] Gagan Goel,et al. Online vertex-weighted bipartite matching and single-bid budgeted allocations , 2010, SODA '11.
[17] Aranyak Mehta,et al. Online Matching with Stochastic Rewards , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[18] Aranyak Mehta,et al. Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..
[19] Martin Pál,et al. Algorithms for Secretary Problems on Graphs and Hypergraphs , 2008, ICALP.
[20] Morteza Zadimoghaddam,et al. Online Stochastic Matching with Unequal Probabilities , 2014, SODA.
[21] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[22] Yang Li,et al. The Stochastic Matching Problem with (Very) Few Queries , 2016, EC.