| Year | Title | Author | Venue |
|---|---|---|---|
| 2026 | Incentives for early arrival in online cooperative games. | Dengji Zhao, Yaoxin Ge, Yao Zhang, Zhihao Gavin Tang, Hu Fu, Pinyan Lu | Artif. Intell. 355: 104523 (2026) |
| 2026 | Local Search for Clustering in Almost-linear Time | Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, and Pinyan Lu | SODA 2026: 5960-5977 |
| 2026 | Error Slice Discovery via Manifold Compactness | Han Yu, Hao Zou, Jiashuo Liu, Renzhe Xu, Yue He, Xingxuan Zhang, Peng Cui | AAAI 2026: 27925-27933 |
| 2026 | Partial Fairness Awareness: Belief-Guided Strategic Mechanism for Strategic Agents | Xinpeng Lv, Chunyuan Zheng, Yunxin Mao, Renzhe Xu, Hao Zou, Shanzhi Gu, Liyang Xu, Huan Chen, Yuanlong Chen, Wenjing Yang, Haotian Wang: | AAAI 2026: 24207-24215 |
| 2026 | Pricing with a Hidden Sample | share record Bluesky Reddit BibSonomy LinkedIn persistent URL: https://dblp.org/rec/journals/corr/abs-2602-18038 Zhihao Gavin Tang, Yixin Tao, Shixin Wang: | CoRR abs/2602.18038 (2026) |
| 2026 | Mode Connectivity in Auction Design | Christoph Hertrich, Yixin Tao, László A. Végh: | Math. Oper. Res. 51(1): 456-475 (2026) |
| 2026 | Robust Mechanism Design with Anonymous Information | Zhihao Gavin Tang, Shixin Wang | CoRR abs/2602.20429 (2026) |
| 2026 | Optimal Competitive Ratio of Two-sided Online Bipartite Matching | Zhihao Gavin Tang | CoRR abs/2602.18049 (2026) |
| 2026 | Pricing with a Hidden Sample | Zhihao Gavin Tang, Yixin Tao, Shixin Wang: | CoRR abs/2602.18038 (2026) |
| 2026 | Combinatorial Philosopher Inequalities | Enze Sun, Zhihao Gavin Tang, Yifan Wang: | SODA 2026: 3872-3904 |
| 2026 | Order-Competitive Ratio | Liyan Chen, Tomer Ezra, Michal Feldman, Nick Gravin, Nuozhou Sun, Zhihao Gavin Tang | SIAM J. Comput. 55(2): 332-361 (2026) |
| 2026 | Budget-Constrained Agentic Large Language Models: Intention-Based Planning for Costly Tool Use | Hanbing Liu, Chunhao Tian, Nan An, Ziyuan Wang, Pinyan Lu, Changyuan Yu, Qi Qi: | CoRR abs/2602.11541 (2026 |
| 2026 | Muon in Associative Memory Learning: Training Dynamics and Scaling Laws | Binghui Li, Kaifei Wang, Han Zhong, Pinyan Lu, Liwei Wang: | CoRR abs/2602.05725 (2026) |
| 2026 | BAPS: A Fine-Grained Low-Precision Scheme for Softmax in Attention via Block-Aware Precision reScaling | Zisheng Ye, Xiaoyu He, Maoyuan Song, Guoliang Qiu, Chao Liao, Chen Wu, Yonggang Sun, Zhichun Li, Xiaoru Xie, Yuanyong Luo, Hu Liu, Pinyan Lu, Heng Liao: | CoRR abs/2602.02071 (2026) |
| 2026 | A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention. | Xiaowei Ye, Xiaoyu He, Chao Liao, Chen Wu, Pinyan Lu | CoRR abs/2602.01763 (2026 |
| 2026 | Local Search for Clustering in Almost-linear Time | Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, Pinyan Lu: | SODA 2026: 5960-5977 |
| 2026 | Dichotomy for Holant* problems with one ternary function on domain size 3 | Jin-Yi Cai, Pinyan Lu, Mingji Xia | Inf. Comput. 309: 105421 (2026) |
| 2026 | Strategyproof mechanism for two heterogeneous facilities with constant approximation ratio | Minming Li, Pinyan Lu, Xingchen Sha, Yuhao Yao, Jialin Zhang: | Games Econ. Behav. 157: 125-137 (2026) |
| 2026 | Order-Competitive Ratio | Liyan Chen, Tomer Ezra, Michal Feldman, Nick Gravin, Nuozhou Sun, Zhihao Gavin Tang | SIAM J. Comput. 55(2): 332-361 (2026) |
| 2025 | Pay for The Second-Best Service: A Game-Theoretic Approach Against Dishonest LLM Providers | Yuhan Cao, Yu Wang, Sitong Liu, Miao Li, Yixin Tao, Tianxing He | CoRR abs/2511.00847 (2025) |
| 2025 | Tight Efficiency Bounds for the Probabilistic Serial Mechanism under Cardinal Preferences | Jugal Garg, Yixin Tao, László A. Végh: | CoRR abs/2507.03359 (2025 |
| 2025 | Approximating Competitive Equilibrium by Nash Welfare | Jugal Garg, Yixin Tao, László A. Végh: | SODA 2025: 2538-2559 |
| 2025 | Proportional Response Dynamics in Gross Substitutes Markets | Yun Kuen Cheung, Richard Cole, Yixin Tao: | EC 2025: 389 |
| 2025 | Tight Bounds for Secretary Matching in General Graphs | Tomer Ezra, Michal Feldman, Nikolai Gravin, Zhihao Gavin Tang: | Math. Oper. Res. 50(4): 3039-3054 (2025) |
| 2025 | On the Ability of LLMs to Handle Character-Level Perturbations: How Well and How? | Anyuan Zhuo, Xuefei Ning, Ningyuan Li, Yu Wang, Pinyan Lu | CoRR abs/2510.14365 (2025) |
| 2025 | Competition Erases Simplicity: Tight Regret Bounds for Uniform Pricing with Multiple Buyers. | Houshuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang: | CoRR abs/2507.12733 (2025) |
| 2025 | Local Search for Clustering in Almost-linear Time | Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, Pinyan Lu: | CoRR abs/2504.03513 (2025) |
| 2025 | Frontiers of Algorithmics - 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 - July 2, 2025, Proceedings | Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu | Lecture Notes in Computer Science 15828, Springer 2025, ISBN 978-981-96-8311-6 |
| 2025 | Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds | Lingxiao Huang, Jian Li, Pinyan Lu, Xuan Wu | SODA 2025: 4732-4782 |
| 2025 | Incentives for Early Arrival in Cooperative Games (Extended Abstract). | Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu | IJCAI 2025: 10891-10895 |
| 2025 | Incentives for Early Arrival in Cost Sharing | Junyu Zhang, Yao Zhang, Yaoxin Ge, Dengji Zhao, Hu Fu, Zhihao Gavin Tang, Pinyan Lu | AAMAS 2025: 2327-2335 |
| 2025 | Bandit Learning in Matching Markets with Indifference | Fang Kong, Jingqi Tang, Mingzhu Li, Pinyan Lu, John C. S. Lui, Shuai Li | ICLR 2025 |
| 2025 | Optimal Auction Design for Mixed Bidders | Xiaohui Bei, Pinyan Lu, Zhiqi Wang, Tao Xiao, Xiang Yan | AAAI 2025: 13614-13621 |
| 2025 | Efficient Training of Multi-task Neural Solver for Combinatorial Optimization | Chenguang Wang, Zhang-Hua Fu, Pinyan Lu, Tianshu Yu: | Trans. Mach. Learn. Res. 2025 (2025) |
| 2025 | Two-state spin systems with negative interactions. | Yumou Fei, Leslie Ann Goldberg, Pinyan Lu: | Inf. Comput. 307: 105340 (2025 |
| 2025 | On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time | Tsz Chiu Kwok, Zhewei Wei, Mingji Yang: | CoRR abs/2509.13891 (2025) |
| 2025 | Cheeger's Inequalities for Vertex Expansion and Reweighted Eigenvalues. | Tsz Chiu Kwok, Lap Chi Lau, Kam Chuen Tung: | SIAM J. Comput. 54(6): 1568-1625 (2025) |
| 2025 | On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time | Tsz Chiu Kwok, Zhewei Wei, Mingji Yang: | ITCS 2026: 89:1-89:25 |
| 2025 | Non-Asymptotic Analysis of Efficiency in Conformalized Regression. | Yunzhen Yao, Lie He, Michael Gastpar: | CoRR abs/2510.07093 (2025) |
| 2025 | Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective. | Yunzhen Yao, Lie He, Michael Gastpar: | ICML 2025 |
| 2025 | Approximation Guarantees of Median Mechanism in ℝᵈ | Nikolai Gravin, Jianhao Jia: | STOC 2025: 495-506 |
| 2025 | On the Satisfiability of Random 3-SAT Formulas with k-Wise Independent Clauses | Ioannis Caragiannis, Nick Gravin, Zhile Jiang | ESA 2025: 103:1-103:17 |
| 2025 | Integrality Gap of Nash Welfare Maximization with Money | Yuriy Dementiev, Nick Gravin, Artur Ignatiev: | ECAI 2025: 4734-4741 |
| 2025 | Tight Bounds for Secretary Matching in General Graphs. | Tomer Ezra, Michal Feldman, Nikolai Gravin, Zhihao Gavin Tang | Math. Oper. Res. 50(4): 3039-3054 (2025) |
| 2025 | Bayesian and Randomized Clock Auctions. | Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin | Oper. Res. 73(4): 1965-1982 (2025) |
| 2025 | Incentives for Early Arrival in Cost Sharing | Junyu Zhang, Yao Zhang, Yaoxin Ge, Dengji Zhao, Hu Fu, Zhihao Gavin Tang, Pinyan Lu | AAMAS 2025: 2327-2335 |
| 2025 | Incentives for Early Arrival in Cooperative Games (Extended Abstract) | Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu | IJCAI 2025: 10891-10895 |
| 2025 | Combinatorial Philosopher Inequalities | Enze Sun, Zhihao Gavin Tang, Yifan Wang: | CoRR abs/2510.10039 (2025) |
| 2025 | Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management | Yi Feng, Xiao Wang, Tian Xie | AAAI 2025 |
| 2025 | Approximating Competitive Equilibrium by Nash Welfare. | Jugal Garg, Yixin Tao, László A. Végh | SODA 2025 |
| 2025 | Prophet Secretary and Matching: the Significance of the Largest Item | Ziyun Chen, Zhiyi Huang, Dongchen Li, Zhihao Gavin Tang | SODA 2025 |
| 2025 | Optimal Auction Design for Mixed Bidders. | Xiaohui Bei, Pinyan Lu, Zhiqi Wang, Tao Xiao, Xiang Yan | AAAI 2025 |
| 2025 | Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds. | Lingxiao Huang, Jian Li, Pinyan Lu, Xuan Wu | SODA 2025 |
| 2025 | Price Stability and Improved Buyer Utility with Presentation Design: A Theoretical Study of the Amazon Buy Box. | Ophir Friedler, Hu Fu, Anna R. Karlin, Ariana Tang | WWW 2025 |
| 2025 | A Bicriterion Concentration Inequality and Prophet Inequalities for k-Fold Matroid Unions. | Noga Alon, Nick Gravin, Tristan Pollner, Aviad Rubinstein, Hongao Wang, S. Matthew Weinberg, Qianfan Zhang | ITCS 2025 |
| 2025 | Fisher Meets Lindahl: A Unified Duality Framework for Market Equilibrium. | Yixin Tao, Weiqiang Zheng | CoRR abs/2511.04572 (2025) |
| 2025 | Online Stochastic Matching with Unknown Arrival Order: Beating 0.5 against the Online Optimum | Enze Sun, Zhihao Gavin Tang, Yifan Wang | STOC 2025: 1430-1441 |
| 2025 | Prophet Secretary and Matching: the Significance of the Largest Item | Ziyun Chen, Zhiyi Huang, Dongchen Li, Zhihao Gavin Tang | SODA 2025: 1371-1401 |
| 2025 | Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis | Bo Peng, Zhihao Gavin Tang | EC 2025: 820-835 |
| 2025 | Incentives for Early Arrival in Cooperative Games (Extended Abstract) | Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu: | IJCAI 2025: 10891-10895 |
| 2025 | Incentives for Early Arrival in Cost Sharing | Junyu Zhang, Yao Zhang, Yaoxin Ge, Dengji Zhao, Hu Fu, Zhihao Gavin Tang, Pinyan Lu | AAMAS 2025: 2327-2335 |
| 2025 | Multi-Layer Feature Fusion for Detecting AI-Generated Code in Programming Education | Siqi Guo, Zhihao Gavin Tang | IEEE Big Data 2025: 3631-3639 |
| 2025 | Tight Regret Bounds for Fixed-Price Bilateral Trade | Houshuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang: | CoRR abs/2504.04349 (2025) |
| 2024 | Pay to (Not) Play: Monetizing Impatience in Mobile Games | Taylor Lundy, Narun Raman, Hu Fu, Kevin Leyton-Brown | AAAI 2024 |
| 2024 | Max-min greedy matching problem: Hardness for the adversary and fractional variant | T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue | Theoretical Computer Science 2024 |
| 2024 | Two-State Spin Systems with Negative Interactions | Yumou Fei, Leslie Ann Goldberg, Pinyan Lu | Innovations in Theoretical Computer Science Conference, ITCS 2024 |
| 2023 | Toward a Better Understanding of Randomized Greedy Matching | Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang | Journal of the ACM 2023 |
| 2023 | Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity | Nick Gravin, Enze Sun, Zhihao Gavin Tang | FOCS 2023 |
| 2023 | First Price Auction is 1-1/e2 Efficient | Yaonan Jin, Pinyan Lu | Journal of the 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 | International Conference on Learning Representations, 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 | Innovations in Theoretical Computer Science Conference, 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 |
