Cheeger Inequalities for General Edge-Weighted Directed Graphs. - T.-H. Hubert Chan; Zhihao Gavin Tang; Chenzi Zhang (COCOON, 2015)

Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs. - T.-H. Hubert Chan; Zhihao Gavin Tang; Chenzi Zhang (CoRR, 2015)

On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. - T.-H. Hubert Chan; Zhihao Gavin Tang; Xiaowei Wu 001 (ISAAC, 2016)

Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids. - T.-H. Hubert Chan; Zhiyi Huang 002; Shaofeng H.-C. Jiang; Ning Kang 001; Zhihao Gavin Tang (CoRR, 2016)

Online Submodular Maximization Problem with Vector Packing Constraint. - T.-H. Hubert Chan; Shaofeng H.-C. Jiang; Zhihao Gavin Tang; Xiaowei Wu 001 (ESA, 2017)

Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. - Chenzi Zhang; Shuguang Hu; Zhihao Gavin Tang; T.-H. Hubert Chan (ICML, 2017)

Graph Edge Partitioning via Neighborhood Heuristic. - Chenzi Zhang; Fan Wei; Qin Liu 009; Zhihao Gavin Tang; Zhenguo Li (KDD, 2017)

Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids. - T.-H. Hubert Chan; Zhiyi Huang 002; Shaofeng H.-C. Jiang; Ning Kang 001; Zhihao Gavin Tang (SODA, 2017)

Online Makespan Minimization: The Power of Restart. - Zhiyi Huang 002; Ning Kang 001; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (APPROX-RANDOM, 2018)

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. - Zhiyi Huang 002; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (ICALP, 2018)

The Value of Information Concealment. - Hu Fu 001; Christopher Liaw; Pinyan Lu; Zhihao Gavin Tang (SODA, 2018)

How to match when all vertices arrive online. - Zhiyi Huang 002; Ning Kang 001; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001; Xue Zhu (STOC, 2018)

On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. - T.-H. Hubert Chan; Zhihao Gavin Tang; Xiaowei Wu 001 (Algorithmica, 2018)

Monopoly pricing with buyer search. - Nick Gravin; Zhihao Gavin Tang (CoRR, 2018)

Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. - T.-H. Hubert Chan; Anand Louis; Zhihao Gavin Tang; Chenzi Zhang (J. ACM, 2018)

Online Submodular Maximization with Free Disposal. - T.-H. Hubert Chan; Zhiyi Huang 002; Shaofeng H.-C. Jiang; Ning Kang 001; Zhihao Gavin Tang (ACM Trans. Algorithms, 2018)

Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. - Zhiyi Huang 002; Binghui Peng; Zhihao Gavin Tang; Runzhou Tao; Xiaowei Wu 001; Yuhao Zhang 001 (SODA, 2019)

Correlation-Robust Analysis of Single Item Auction. - Xiaohui Bei; Nick Gravin; Pinyan Lu; Zhihao Gavin Tang (SODA, 2019)

Tight approximation ratio of anonymous pricing. - Yaonan Jin; Pinyan Lu; Qi Qi 003; Zhihao Gavin Tang; Tao Xiao (STOC, 2019)

Perturbed Greedy on Oblivious Matching Problems. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (CoRR, 2019)

Tight revenue gaps among simple and optimal mechanisms. - Yaonan Jin; Pinyan Lu; Qi Qi 003; Zhihao Gavin Tang; Tao Xiao (SIGecom Exch., 2019)

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. - Zhiyi Huang 002; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (ACM Trans. Algorithms, 2019)

Diffusion operator and spectral analysis for directed hypergraph Laplacian. - T.-H. Hubert Chan; Zhihao Gavin Tang; Xiaowei Wu 001; Chenzi Zhang (Theor. Comput. Sci., 2019)

Fully Online Matching II: Beating Ranking and Water-filling. - Zhiyi Huang 002; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (FOCS, 2020)

Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (EC, 2020)

Towards a better understanding of randomized greedy matching. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (STOC, 2020)

A Simple 1-1/e Approximation for Oblivious Bipartite Matching. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (CoRR, 2020)

Secretary Matching with General Arrivals. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (CoRR, 2020)

Fully Online Matching. - Zhiyi Huang 002; Ning Kang 001; Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001; Xue Zhu (J. ACM, 2020)

Tight Revenue Gaps Among Simple Mechanisms. - Yaonan Jin; Pinyan Lu; Zhihao Gavin Tang; Tao Xiao (SIAM J. Comput., 2020)

Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass. - Chenzi Zhang; Shuguang Hu; Zhihao Gavin Tang; T.-H. Hubert Chan (IEEE Trans. Knowl. Data Eng., 2020)

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. - Chenghao Guo; Zhiyi Huang 002; Zhihao Gavin Tang; Xinzhi Zhang 002 (COLT, 2021)

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. - Hu Fu 001; Zhihao Gavin Tang; Hongxun Wu; Jinzhao Wu; Qianfan Zhang 002 (ICALP, 2021)

Online Stochastic Matching with Edge Arrivals. - Nick Gravin; Zhihao Gavin Tang; Kangning Wang 001 (ICALP, 2021)

Online Selection Problems against Constrained Adversary. - Zhihao Jiang; Pinyan Lu; Zhihao Gavin Tang; Yuhao Zhang 001 (ICML, 2021)

Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. - Bo Peng; Zhihao Gavin Tang (FOCS, 2022)

Online Facility Location with Predictions. - Shaofeng H.-C. Jiang; Erzhi Liu; You Lyu; Zhihao Gavin Tang; Yubo Zhang (ICLR, 2022)

Lookahead Auctions with Pooling. - Michal Feldman; Nick Gravin; Zhihao Gavin Tang; Almog Wald (SAGT, 2022)

General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (EC, 2022)

Oblivious Online Contention Resolution Schemes. - Hu Fu 001; Pinyan Lu; Zhihao Gavin Tang; Abner Turkieltaub; Hongxun Wu; Jinzhao Wu; Qianfan Zhang 002 (SOSA, 2022)

(Fractional) online stochastic matching via fine-grained offline statistics. - Zhihao Gavin Tang; Jinzhao Wu; Hongxun Wu (STOC, 2022)

Optimal Prophet Inequality with Less than One Sample. - Nick Gravin; Hao Li 107; Zhihao Gavin Tang (WINE, 2022)

On the Significance of Knowing the Arrival Order in Prophet Inequality. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (CoRR, 2022)

The Cardinal Complexity of Comparison-based Online Algorithms. - Nick Gravin; Enze Sun 001; Zhihao Gavin Tang (CoRR, 2022)

Prophet Matching with General Arrivals. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (Math. Oper. Res., 2022)

The online food delivery problem on stars. - Xiangyu Guo; Kelin Luo; Zhihao Gavin Tang; Yuhao Zhang 001 (Theor. Comput. Sci., 2022)

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. - Jingxun Liang; Zhihao Gavin Tang; Yixuan Even Xu; Yuhao Zhang 001; Renfei Zhou (ESA, 2023)

Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. - Nick Gravin; Enze Sun 001; Zhihao Gavin Tang (FOCS, 2023)

Bidder Subset Selection Problem in Auction Design. - Xiaohui Bei; Nick Gravin; Pinyan Lu; Zhihao Gavin Tang (SODA, 2023)

"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings. - Tomer Ezra; Michal Feldman; Nick Gravin; Zhihao Gavin Tang (SODA, 2023)

Online resource allocation in Markov Chains. - Jianhao Jia; Hao Li 107; Kai Liu; Ziqi Liu; Jun Zhou 011; Nikolai Gravin; Zhihao Gavin Tang (WWW, 2023)

Toward a Better Understanding of Randomized Greedy Matching. - Zhihao Gavin Tang; Xiaowei Wu 001; Yuhao Zhang 001 (J. ACM, 2023)

Incentives for Early Arrival in Cooperative Games. - Yaoxin Ge; Yao Zhang; Dengji Zhao; Zhihao Gavin Tang; Hu Fu 001; Pinyan Lu (AAMAS, 2024)

Sample-Based Matroid Prophet Inequalities. - Hu Fu 001; Pinyan Lu; Zhihao Gavin Tang; Hongxun Wu; Jinzhao Wu; Qianfan Zhang 002 (EC, 2024)

Setting Targets is All You Need: Improved Order Competitive Ratio for Online Selection. - Liyan Chen; Nuozhou Sun; Zhihao Gavin Tang (EC, 2024)

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms. - Tomer Ezra; Michal Feldman; Zhihao Gavin Tang (EC, 2024)

Optimal Robust Contract Design. - Bo Peng; Zhihao Gavin Tang (EC, 2024)

Improved Bounds for Fractional Online Matching Problems. - Zhihao Gavin Tang; Yuhao Zhang 001 (EC, 2024)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection. - Liyan Chen; Nuozhou Sun; Zhihao Gavin Tang (CoRR, 2024)

Online Matching: A Brief Survey. - Zhiyi Huang 002; Zhihao Gavin Tang; David Wajc (SIGecom Exch., 2024)

Max-min greedy matching problem: Hardness for the adversary and fractional variant. - T.-H. Hubert Chan; Zhihao Gavin Tang; Quan Xue (Theor. Comput. Sci., 2024)

Incentives for Early Arrival in Cost Sharing. - Junyu Zhang; Yao Zhang; Yaoxin Ge; Dengji Zhao; Hu Fu 001; Zhihao Gavin Tang; Pinyan Lu (AAMAS, 2025)

Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis. - Bo Peng; Zhihao Gavin Tang (EC, 2025)

Prophet Secretary and Matching: the Significance of the Largest Item. - Ziyun Chen; Zhiyi Huang 002; Dongchen Li; Zhihao Gavin Tang (SODA, 2025)

Online Stochastic Matching with Unknown Arrival Order: Beating 0.5 against the Online Optimum. - Enze Sun 001; Zhihao Gavin Tang; Yifan Wang (STOC, 2025)