Year |
Title |
Author |
Venue |
2024 |
Toward a Better Understanding of Randomized Greedy Matching |
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang |
Journal of the ACM 2023 |
2024 |
Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity |
Nick Gravin, Enze Sun, Zhihao Gavin Tang |
FOCS 2023 |
2024 |
First Price Auction is 1-1/e2 Efficient |
Yaonan Jin, Pinyan Lu |
ACM 2023 |
2023 |
Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees |
Ioannis Panageas, Stratis Skoulakis, Luca Viano, Xiao Wang, Volkan Cevher |
ICML 2023 |
2023 |
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching |
Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou |
ESA 2023 |
2023 |
Max-Min Greedy Matching Problem: Hardness for the Adversary and Fractional Variant |
T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue |
IJTCS-FAW 2023 |
2023 |
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs |
Logan Grout, Joseph Cheriyan, Bundit Laekhanukit |
Operations Research Letters |
2023 |
Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation Scheme |
Hu Fu, Jiawei Li, Daogao Liu |
STOC 2023 |
2023 |
Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive |
Nick Gravin, Hongao Wang |
Mathematics of Operations Research |
2023 |
Online resource allocation in Markov Chains |
Jianhao Jia, Hao Li, Kai Liu, Ziqi Liu, Jun Zhou, Nikolai Gravin, Zhihao Gavin Tang |
WWW 2023 |
2023 |
Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching |
Chang Liu, Zetian Jiang, Runzhong Wang, Lingxiao Huang, Pinyan Lu, Junchi Yan |
ICLR 2023 |
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 |
2023 |
Bidder Subset Selection Problem in Auction Design |
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang |
SODA 2023 |
2023 |
The Price of Stability for First Price Auction |
Yaonan Jin, Pinyan Lu |
SODA 2023 |
2023 |
Learning Reserve Prices in Second-Price Auctions |
Yaonan Jin, Pinyan Lu, Tao Xiao |
ITCS 2023 |
2022 |
Optimal Prophet Inequality with Less than One Sample |
Nick Gravin, Hao Li, Zhihao Gavin Tang |
WINE 2022 |
2022 |
Lookahead Auctions with Pooling |
Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald |
SAGT 2022 |
2022 |
Online Facility Location with Predictions |
Shaofeng H.-C. Jiang, Erzhi Liu, You Lyu, Zhihao Gavin Tang, Yubo Zhang |
ICLR 2022 |
2022 |
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design |
Bo Peng, Zhihao Gavin Tang |
FOCS 2022 |
2022 |
The online food delivery problem on stars |
Xiangyu Guo, Kelin Luo, Zhihao Gavin Tang, Yuhao Zhang |
Theoretical Computer Science |
2022 |
Prophet Matching with General Arrivals |
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
Mathematics of Operations Research |
2022 |
Survivable Network Design Revisited: Group-Connectivity |
Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang |
FOCS 2022 |
2022 |
Better Approximation for Interdependent SOS Valuations |
Pinyan Lu, Enze Sun, Chenghan Zhou |
WINE 2022 |
2022 |
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem |
Yuming Du, Qingyun Zhang, Junzhou Xu, Shungen Zhang, Chao Liao, Zhihuai Chen, Zhibo Sun, Zhouxing Su, Junwen Ding, Chen Wu, Pinyan Lu, Zhi-Peng Lv |
IPEC 2022 |
2022 |
Bayesian Auctions with Efficient Queries (Extended Abstract) |
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu |
IJCAI 2022 |
2022 |
First Price Auction is 1 - 1 /e2 Efficient |
Yaonan Jin, Pinyan Lu |
FOCS 2022 |
2022 |
Tight Revenue Gaps among Multiunit Mechanisms |
Yaonan Jin, Shunhua Jiang, Pinyan Lu, and Hengjie Zhang |
SIAM Journal on Computing 2022 |
2022 |
Stability of Decentralized Queueing Networks Beyond Complete Bipartite Cases |
Hu Fu, Qun Hu, Jia nan Lin |
WINE 2022 |
2022 |
M-Mix: Generating Hard Negatives via Multi-sample Mixing for Contrastive Learning |
Shaofeng Zhang, Meng Liu, Junchi Yan, Hengrui Zhang, Lingxiao Huang, Xiaokang Yang, Pinyan Lu |
KDD 2022 |
2022 |
Bayesian auctions with efficient queries |
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu |
Artificial Intelligence |
2022 |
An FPTAS for the hardcore model on random regular bipartite graphs |
Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao |
Theoretical Computer Science |
2022 |
Transparency and Control in Platforms for Networked Markets |
John Z. F. Pang, Weixuan Lin, Hu Fu, Jack Kleeman, Eilyan Bitar, Adam Wierman |
Operations Research |
2022 |
On Approximating Degree-Bounded Network Design Problems |
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian |
Algorithmica |
2022 |
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity |
Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang |
ICALP 2022 |
2022 |
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree |
Shi Li, Bundit Laekhanukit |
SODA 2022 |
2022 |
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods |
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz |
SWAT 2022 |
2022 |
Mechanism Design with Predictions |
Chenyang Xu, Pinyan Lu |
IJCAI 2022 |
2022 |
General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching |
Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang |
EC 2022 |
2022 |
Bayesian and Randomized Clock Auctions |
Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin |
EC 2022 |
2022 |
(Fractional) online stochastic matching via fine-grained offline statistics |
Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu |
STOC 2022 |
2022 |
Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues |
Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung |
FOCS 2022 |
2022 |
Oblivious Online Contention Resolution Schemes |
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang |
SOSA 2022 |
2021 |
Online Stochastic Matching with Edge Arrivals |
Nick Gravin, Zhihao Gavin Tang, Kangning Wang |
ICALP 2021 |
2021 |
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications |
Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang |
ICALP 2021 |
2021 |
Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem |
Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang |
COLT 2021 |
2021 |
Tight Revenue Gaps among Multi-Unit Mechanisms |
Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang |
EC 2021 |
2021 |
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores |
Xin Huang, Pinyan Lu |
EC 2021 |
2021 |
Online Selection Problems against Constrained Adversary |
Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang |
ICML 2021 |
2021 |
Zeros of Holant Problems: Locations and Algorithms |
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang |
ACM Trans. Algorithms |
2021 |
Vertex Sparsification for Edge Connectivity |
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
SODA 2021 |