Zhiyi Huang

According to our database1, Zhiyi Huang authored at least 58 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Fully Online Matching.
J. ACM, 2020

Fully Online Matching II: Beating Ranking and Water-filling.
CoRR, 2020

Edge-Weighted Online Bipartite Matching.
CoRR, 2020

Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Algorithmic Price Discrimination.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals.
ACM Trans. Algorithms, 2019

Sample complexity of single-parameter revenue maximization.
SIGecom Exch., 2019

Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing.
J. Mach. Learn. Res., 2019

Welfare maximization with production costs: A primal dual approach.
Games Econ. Behav., 2019

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem.
CoRR, 2019

Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Weighted Case.
CoRR, 2019

Understanding Zadimoghaddam's Edge-weighted Online Matching Algorithm: Unweighted Case.
CoRR, 2019

Settling the sample complexity of single-parameter revenue maximization.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Scalable and Jointly Differentially Private Packing.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Learning Resource Allocation and Pricing for Cloud Profit Maximization.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms.
ACM Trans. Algorithms, 2018

Online Submodular Maximization with Free Disposal.
ACM Trans. Algorithms, 2018

Making the Most of Your Samples.
SIAM J. Comput., 2018

How to match when all vertices arrive online.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Near Optimal Jointly Private Packing Algorithms via Dual Multiplicative Weight Update.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Optimal Differentially Private Algorithms for k-Means Clustering.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Learning Optimal Reserve Price against Non-myopic Bidders.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Occupation-Oblivious Pricing of Cloud Jobs via Online Learning.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Online Makespan Minimization: The Power of Restart.
Proceedings of the Approximation, 2018

2017
An Efficient Cloud Market Mechanism for Computing Jobs With Soft Deadlines.
IEEE/ACM Trans. Netw., 2017

Online Auctions in IaaS Clouds: Welfare and Profit Maximization With Server Costs.
IEEE/ACM Trans. Netw., 2017

Online Stochastic Buy-Sell Mechanism for VNF Chains in the NFV Market.
IEEE J. Sel. Areas Commun., 2017

Minimum Area All-flush Triangles Circumscribing a Convex Polygon.
CoRR, 2017

Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Online Auctions and Multi-scale Online Learning.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Privacy Preserving Auction.
Encyclopedia of Algorithms, 2016

Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders.
ACM Trans. Economics and Comput., 2016

Private Matchings and Allocations.
SIAM J. Comput., 2016

Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids.
CoRR, 2016

The sample complexity of auctions with side information.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Jointly Private Convex Programming.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Recognizing Coverage Functions.
SIAM J. Discret. Math., 2015

Online Convex Covering and Packing Problems.
CoRR, 2015

Budget Constraints in Prediction Markets.
Proceedings of the Thirty-First Conference on Uncertainty in Artificial Intelligence, 2015

Speed Scaling in the Non-clairvoyant Model.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014
SIGACT News Online Algorithms Column 25: Online Primal Dual: Beyond Linear Programs.
SIGACT News, 2014

Exploiting Metric Structure for Efficient Private Query Release.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization.
SIAM J. Comput., 2013

Simple and Nearly Optimal Multi-Item Auctions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
Sequential Auctions of Identical Items with Budget-Constrained Bidders
CoRR, 2012

Testing Coverage Functions.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Bayesian Incentive Compatibility via Fractional Assignments.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Algorithms for the Generalized Sorting Problem.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Black-Box Reductions in Mechanism Design.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

On Sampling from Multivariate Distributions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Towards Optimal Bayesian Algorithmic Mechanism Design
CoRR, 2010

2009
Reconstructing Numbers from Pairwise Function Values.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Dynamic and Non-uniform Pricing Strategies for Revenue Maximization.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009


  Loading...