Zhihao Gavin Tang

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 82

Top Topics

Laplace Beltrami

Bipartite Matching

Online Algorithms

Top Venues

Publications

T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
Max-min greedy matching problem: Hardness for the adversary and fractional variant. Theor. Comput. Sci. 986 (2024)
Tomer Ezra, Michal Feldman, Zhihao Gavin Tang
Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms. CoRR (2024)
Zhiyi Huang, Zhihao Gavin Tang, David Wajc
Online Matching: A Brief Survey. CoRR (2024)
Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu
Incentives for Early Arrival in Cooperative Games. AAMAS (2024)
Liyan Chen, Nuozhou Sun, Zhihao Gavin Tang
Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection. CoRR (2024)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Sample-Based Matroid Prophet Inequalities. CoRR (2024)
Bo Peng, Zhihao Gavin Tang
Optimal Robust Contract Design. CoRR (2024)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Toward a Better Understanding of Randomized Greedy Matching. J. ACM 70 (6) (2023)
Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. ESA (2023)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. SODA (2023)
T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant. IJTCS-FAW (2023)
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
Bidder Subset Selection Problem in Auction Design. SODA (2023)
Nick Gravin, Enze Sun, Zhihao Gavin Tang
Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. FOCS (2023)
Jianhao Jia, Hao Li, Kai Liu, Ziqi Liu, Jun Zhou, Nikolai Gravin, Zhihao Gavin Tang
Online resource allocation in Markov Chains. WWW (2023)
Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu
(Fractional) online stochastic matching via fine-grained offline statistics. STOC (2022)
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
Bidder Subset Selection Problem in Auction Design. CoRR (2022)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. EC (2022)
Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang
Online Facility Location with Predictions. ICLR (2022)
Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics. CoRR (2022)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
On the Significance of Knowing the Arrival Order in Prophet Inequality. CoRR (2022)
Nick Gravin, Enze Sun, Zhihao Gavin Tang
The Cardinal Complexity of Comparison-based Online Algorithms. CoRR (2022)
Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald
Lookahead Auctions with Pooling. SAGT (2022)
Zhihao Gavin Tang, Yuhao Zhang
Improved Bounds for Fractional Online Matching Problems. CoRR (2022)
Nick Gravin, Hao Li, Zhihao Gavin Tang
Optimal Prophet Inequality with Less than One Sample. WINE (2022)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Oblivious Online Contention Resolution Schemes. SOSA (2022)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Prophet Matching with General Arrivals. Math. Oper. Res. 47 (2) (2022)
Bo Peng, Zhihao Gavin Tang
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. FOCS (2022)
Almog Wald, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Lookahead Auctions with Pooling. CoRR (2022)
Bo Peng, Zhihao Gavin Tang
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. CoRR (2022)
Jingxun Liang, Zhihao Gavin Tang, Yixuan Xu, Yuhao Zhang, Renfei Zhou
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. CoRR (2022)
Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang
The online food delivery problem on stars. Theor. Comput. Sci. 928 (2022)
Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. ICALP (2021)
Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang
Online Facility Location with Predictions. CoRR (2021)
Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. COLT (2021)
Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang
Online Selection Problems against Constrained Adversary. ICML (2021)
Nick Gravin, Zhihao Gavin Tang, Kangning Wang
Online Stochastic Matching with Edge Arrivals. ICALP (2021)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Oblivious Online Contention Resolution Schemes. CoRR (2021)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Secretary Matching with General Arrivals. CoRR (2020)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. EC (2020)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Towards a better understanding of randomized greedy matching. STOC (2020)
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models. CoRR (2020)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
A Simple 1-1/e Approximation for Oblivious Bipartite Matching. CoRR (2020)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Fully Online Matching II: Beating Ranking and Water-filling. CoRR (2020)
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao
Tight Revenue Gaps Among Simple Mechanisms. SIAM J. Comput. 49 (5) (2020)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Fully Online Matching II: Beating Ranking and Water-filling. FOCS (2020)
Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan
Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass. IEEE Trans. Knowl. Data Eng. 32 (3) (2020)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
Fully Online Matching. J. ACM 67 (3) (2020)
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao
Tight Revenue Gaps among Simple Mechanisms. SODA (2019)
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
Correlation-Robust Analysis of Single Item Auction. SODA (2019)
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao
Tight revenue gaps among simple and optimal mechanisms. SIGecom Exch. 17 (2) (2019)
Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. CoRR (2019)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
with Random Arrivals. ACM Trans. Algorithms 15 (3) (2019)
Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. SODA (2019)
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Perturbed Greedy on Oblivious Matching Problems. CoRR (2019)
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao
Tight approximation ratio of anonymous pricing. STOC (2019)
Nick Gravin, Zhihao Gavin Tang, Kangning Wang
Online Stochastic Matching with Edge Arrivals. CoRR (2019)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
Diffusion operator and spectral analysis for directed hypergraph Laplacian. Theor. Comput. Sci. 784 (2019)
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao
Tight Revenue Gaps among Simple Mechanisms. CoRR (2018)
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao
Tight Approximation Ratio of Anonymous Pricing. CoRR (2018)
Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. CoRR (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Makespan Minimization: The Power of Restart. CoRR (2018)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. CoRR (2018)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. Algorithmica 80 (7) (2018)
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
Online Submodular Maximization with Free Disposal. ACM Trans. Algorithms 14 (4) (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Makespan Minimization: The Power of Restart. APPROX-RANDOM (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
How to match when all vertices arrive online. STOC (2018)
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. J. ACM 65 (3) (2018)
Nick Gravin, Zhihao Gavin Tang
Monopoly pricing with buyer search. CoRR (2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu
How to Match when All Vertices Arrive Online. CoRR (2018)
Hu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang
The Value of Information Concealment. SODA (2018)
Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ICALP (2018)
Hu Fu, Chris Liaw, Pinyan Lu, Zhihao Gavin Tang
The Value of Information Concealment. CoRR (2017)
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
Online Submodular Maximization Problem with Vector Packing Constraint. ESA (2017)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang
Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian. CoRR (2017)
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. SODA (2017)
Chenzi Zhang, Fan Wei, Qin Liu, Zhihao Gavin Tang, Zhenguo Li
Graph Edge Partitioning via Neighborhood Heuristic. KDD (2017)
T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu
Online Submodular Maximization Problem with Vector Packing Constraint. CoRR (2017)
Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. ICML (2017)
T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. CoRR (2016)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. ISAAC (2016)
T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang
Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids. CoRR (2016)
T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem. CoRR (2016)
T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang
Cheeger Inequalities for General Edge-Weighted Directed Graphs. COCOON (2015)
T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang
Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs. CoRR (2015)