Showing results 1 to 20 of 49
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Whole-page optimization and submodular welfare maximization with online bidders Proceeding/Conference:Proceedings of the ACM Conference on Electronic Commerce | 2013 | |||
Welfare maximization with production costs: a primal dual approach Proceeding/Conference:Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2015 | 75 | ||
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model Proceeding/Conference:Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019) | 2019 | 20 | ||
The sample complexity of auctions with side information Proceeding/Conference:Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016 | 2016 | |||
The power of multiple choices in online stochastic matching Proceeding/Conference:54th ACM Symposium on Theory of Computing (20/06/2022-24/06/2022, Rome) | 10-Jun-2022 | |||
Targeting Makes Sample Efficiency in Auction Design Proceeding/Conference:The 22nd ACM Conference on Economics and Computation (EC) 2021 | 2021 | 8 | ||
Strong revenue (non-)monotonicity of single-parameter auctions Proceeding/Conference:24th ACM Conference on Economics and Computation (09/07/2023-12/07/2023, London) | 9-Jul-2023 | |||
Speed scaling in the non-clairvoyant model Proceeding/Conference:SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures | 2015 | 48 | ||
Simple and nearly optimal multi-item auctions Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2013 | 64 | ||
Settling the sample complexity of single-parameter revenue maximization Proceeding/Conference:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019) | 2019 | 14 | ||
Scalable and Jointly Differentially Private Packing Proceeding/Conference:46th International Colloquium on Automata, Languages, and Programming (ICALP) | 2019 | 27 | ||
Revisiting the direct sum theorem and space lower bounds in random order streams Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | 44 | ||
Reconstructing numbers from pairwise function values Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2009 | 23 | ||
Private matchings and allocations Proceeding/Conference:ACM Symposium on the Theory of Computing Annual Proceedings | 2014 | 57 | ||
Primal dual gives almost optimal energy efficient online algorithms Proceeding/Conference:Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms | 2014 | |||
Optimal Differentially Private Algorithms for k-Means Clustering Proceeding/Conference:Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 2018 | 33 | ||
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals Proceeding/Conference:Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) | 2018 | |||
Online Submodular Maximization with Free Disposal: Randomization Beats ΒΌ for Partition Matroids Proceeding/Conference:Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017 | 83 | ||
Online stochastic matching, poisson arrivals, and the natural linear program Proceeding/Conference:The 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC) | 2021 | 8 | ||
Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue Proceeding/Conference:52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC) | 2020 |