default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhihao Gavin Tang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]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: 114329 (2024)- [c35]Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu:
Incentives for Early Arrival in Cooperative Games. AAMAS 2024: 651-659 - [i36]Tomer Ezra, Michal Feldman, Zhihao Gavin Tang:
Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms. CoRR abs/2402.17160 (2024) - [i35]Bo Peng, Zhihao Gavin Tang:
Optimal Robust Contract Design. CoRR abs/2406.11528 (2024) - [i34]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Sample-Based Matroid Prophet Inequalities. CoRR abs/2406.12799 (2024) - [i33]Liyan Chen, Nuozhou Sun, Zhihao Gavin Tang:
Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection. CoRR abs/2406.15192 (2024) - [i32]Zhiyi Huang, Zhihao Gavin Tang, David Wajc:
Online Matching: A Brief Survey. CoRR abs/2407.05381 (2024) - 2023
- [j12]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Toward a Better Understanding of Randomized Greedy Matching. J. ACM 70(6): 39:1-39:32 (2023) - [c34]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: 80:1-80:15 - [c33]T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue:
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant. IJTCS-FAW 2023: 85-104 - [c32]Nick Gravin, Enze Sun, Zhihao Gavin Tang:
Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity. FOCS 2023: 1863-1876 - [c31]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: 3759-3776 - [c30]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. SODA 2023: 3788-3801 - [c29]Jianhao Jia, Hao Li, Kai Liu, Ziqi Liu, Jun Zhou, Nikolai Gravin, Zhihao Gavin Tang:
Online resource allocation in Markov Chains. WWW 2023: 3498-3507 - 2022
- [j11]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Prophet Matching with General Arrivals. Math. Oper. Res. 47(2): 878-898 (2022) - [j10]Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang:
The online food delivery problem on stars. Theor. Comput. Sci. 928: 13-26 (2022) - [c28]Bo Peng, Zhihao Gavin Tang:
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. FOCS 2022: 171-178 - [c27]Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang:
Online Facility Location with Predictions. ICLR 2022 - [c26]Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald:
Lookahead Auctions with Pooling. SAGT 2022: 60-77 - [c25]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. EC 2022: 1148-1177 - [c24]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Oblivious Online Contention Resolution Schemes. SOSA 2022: 268-278 - [c23]Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu:
(Fractional) online stochastic matching via fine-grained offline statistics. STOC 2022: 77-90 - [c22]Nick Gravin, Hao Li, Zhihao Gavin Tang:
Optimal Prophet Inequality with Less than One Sample. WINE 2022: 115-131 - [i31]Zhihao Gavin Tang, Yuhao Zhang:
Improved Bounds for Fractional Online Matching Problems. CoRR abs/2202.02948 (2022) - [i30]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
On the Significance of Knowing the Arrival Order in Prophet Inequality. CoRR abs/2202.09215 (2022) - [i29]Nick Gravin, Enze Sun, Zhihao Gavin Tang:
The Cardinal Complexity of Comparison-based Online Algorithms. CoRR abs/2204.01418 (2022) - [i28]Bo Peng, Zhihao Gavin Tang:
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. CoRR abs/2204.01425 (2022) - [i27]Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu:
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics. CoRR abs/2204.06851 (2022) - [i26]Almog Wald, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Lookahead Auctions with Pooling. CoRR abs/2209.12934 (2022) - [i25]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. CoRR abs/2210.10370 (2022) - [i24]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. CoRR abs/2211.10969 (2022) - 2021
- [c21]Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang:
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. COLT 2021: 2248-2288 - [c20]Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications. ICALP 2021: 68:1-68:20 - [c19]Nick Gravin, Zhihao Gavin Tang, Kangning Wang:
Online Stochastic Matching with Edge Arrivals. ICALP 2021: 74:1-74:20 - [c18]Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang:
Online Selection Problems against Constrained Adversary. ICML 2021: 5002-5012 - [i23]Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang:
Online Facility Location with Predictions. CoRR abs/2110.08840 (2021) - [i22]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Oblivious Online Contention Resolution Schemes. CoRR abs/2111.10607 (2021) - 2020
- [j9]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
Fully Online Matching. J. ACM 67(3): 17:1-17:25 (2020) - [j8]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps Among Simple Mechanisms. SIAM J. Comput. 49(5): 927-958 (2020) - [j7]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): 506-518 (2020) - [c17]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Fully Online Matching II: Beating Ranking and Water-filling. FOCS 2020: 1380-1391 - [c16]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. EC 2020: 769-787 - [c15]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Towards a better understanding of randomized greedy matching. STOC 2020: 1097-1110 - [i21]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
A Simple 1-1/e Approximation for Oblivious Bipartite Matching. CoRR abs/2002.06037 (2020) - [i20]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models. CoRR abs/2002.09807 (2020) - [i19]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Fully Online Matching II: Beating Ranking and Water-filling. CoRR abs/2005.06311 (2020) - [i18]Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang:
Secretary Matching with General Arrivals. CoRR abs/2011.01559 (2020)
2010 – 2019
- 2019
- [j6]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight revenue gaps among simple and optimal mechanisms. SIGecom Exch. 17(2): 54-61 (2019) - [j5]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ACM Trans. Algorithms 15(3): 38:1-38:15 (2019) - [j4]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang:
Diffusion operator and spectral analysis for directed hypergraph Laplacian. Theor. Comput. Sci. 784: 46-64 (2019) - [c14]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Correlation-Robust Analysis of Single Item Auction. SODA 2019: 193-208 - [c13]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps among Simple Mechanisms. SODA 2019: 209-228 - [c12]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: 2875-2886 - [c11]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight approximation ratio of anonymous pricing. STOC 2019: 674-685 - [i17]Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Perturbed Greedy on Oblivious Matching Problems. CoRR abs/1907.05135 (2019) - [i16]Nick Gravin, Zhihao Gavin Tang, Kangning Wang:
Online Stochastic Matching with Edge Arrivals. CoRR abs/1911.04686 (2019) - [i15]Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang:
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem. CoRR abs/1911.11936 (2019) - 2018
- [j3]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On (1,ϵ)-Restricted Max-Min Fair Allocation Problem. Algorithmica 80(7): 2181-2200 (2018) - [j2]T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang:
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. J. ACM 65(3): 15:1-15:48 (2018) - [j1]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): 56:1-56:29 (2018) - [c10]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Makespan Minimization: The Power of Restart. APPROX-RANDOM 2018: 14:1-14:19 - [c9]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. ICALP 2018: 79:1-79:14 - [c8]Hu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang:
The Value of Information Concealment. SODA 2018: 2533-2544 - [c7]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
How to match when all vertices arrive online. STOC 2018: 17-29 - [i14]Nick Gravin, Zhihao Gavin Tang:
Monopoly pricing with buyer search. CoRR abs/1802.02751 (2018) - [i13]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
How to Match when All Vertices Arrive Online. CoRR abs/1802.03905 (2018) - [i12]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps among Simple Mechanisms. CoRR abs/1804.00480 (2018) - [i11]Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. CoRR abs/1804.07458 (2018) - [i10]Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Makespan Minimization: The Power of Restart. CoRR abs/1806.02207 (2018) - [i9]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 abs/1810.07903 (2018) - [i8]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight Approximation Ratio of Anonymous Pricing. CoRR abs/1811.00763 (2018) - 2017
- [c6]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. ESA 2017: 24:1-24:14 - [c5]Chenzi Zhang, Shuguang Hu, Zhihao Gavin Tang, T.-H. Hubert Chan:
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method. ICML 2017: 4026-4034 - [c4]Chenzi Zhang, Fan Wei, Qin Liu, Zhihao Gavin Tang, Zhenguo Li:
Graph Edge Partitioning via Neighborhood Heuristic. KDD 2017: 605-614 - [c3]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: 1204-1223 - [i7]T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu:
Online Submodular Maximization Problem with Vector Packing Constraint. CoRR abs/1706.06922 (2017) - [i6]Hu Fu, Chris Liaw, Pinyan Lu, Zhihao Gavin Tang:
The Value of Information Concealment. CoRR abs/1707.05875 (2017) - [i5]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu, Chenzi Zhang:
Diffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian. CoRR abs/1711.01560 (2017) - 2016
- [c2]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On (1, epsilon)-Restricted Max-Min Fair Allocation Problem. ISAAC 2016: 23:1-23:13 - [i4]T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang:
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. CoRR abs/1605.01483 (2016) - [i3]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 abs/1610.07770 (2016) - [i2]T.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu:
On ($1$, $ε$)-Restricted Max-Min Fair Allocation Problem. CoRR abs/1611.08060 (2016) - 2015
- [c1]T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang:
Cheeger Inequalities for General Edge-Weighted Directed Graphs. COCOON 2015: 30-41 - [i1]T.-H. Hubert Chan, Zhihao Gavin Tang, Chenzi Zhang:
Spectral Properties of Laplacian and Stochastic Diffusion Process for Edge Expansion in Hypergraphs. CoRR abs/1510.01520 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
