| 年 | 论文标题 | 作者 | 期刊或会议 |
|---|---|---|---|
| 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 | 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 | Combinatorial Philosopher Inequalities | Enze Sun, Zhihao Gavin Tang, Yifan Wang | SODA 2026: 3872-3904 |
| 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 | 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 | 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 | 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 | 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 | 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 Cooperative Games (Extended Abstract) | Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu | IJCAI 2025: 10891-10895 |
| 2025 | Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis | Bo Peng, Zhihao Gavin Tang | EC 2025: 820-835 |
| 2025 | Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management | Yi Feng, Xiao Wang, Tian Xie | AAAI 2025 |
| 2025 | Prophet Secretary and Matching: the Significance of the Largest Item | Ziyun Chen, Zhiyi Huang, Dongchen Li, Zhihao Gavin Tang | 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 |
| 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 | 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 | 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 |
| 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 | 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 |
| 2021 | Concentration bounds for almost k-wise independence with applications to non-uniform security | Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu | SODA 2021 |
| 2021 | Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler | Zhengfeng Ji, Zhihan Jin, Pinyan Lu | SODA 2021 |
| 2021 | Generalized Sorting with Predictions | Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang | SODA 2021 |
| 2020 | Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass | Chenzi Zhang, Shuguang Hu, Zhihao Tang, T.-H. Hubert Chan: | IEEE Trans. Knowl. Data Eng. |
| 2020 | Tight Revenue Gaps Among Simple Mechanisms | Yaonan Jin, Pinyan Lu, Zhihao Tang, Tao Xiao | SIAM J. Comput. |
| 2020 | Fully Online Matching | Zhiyi Huang, Ning Kang, Zhihao Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu | J. ACM |
| 2020 | Optimal Budget-Feasible Mechanisms for Additive Valuations | Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang | ACM Trans. Economics and Comput. |
| 2020 | Dichotomy for Holant? Problems on the Boolean Domain. | Jin-Yi Cai, Pinyan Lu, Mingji Xia | Theory Comput. Syst. |
| 2020 | Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds | Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit | ACM Trans. Algorithms |
| 2020 | From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan | SIAM J. Comput |
| 2020 | Simultaneous auctions without complements are (almost) efficient | Michal Feldman, Hu Fu, Nick Gravin, Brendan Lucier | Games Econ. Behav |
| 2020 | Approximability of the Eight-Vertex Model | Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu | Computational Complexity Conference 2020 |
| 2020 | Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio | Minming Li, Pinyan Lu, Yuhao Yao, Jialin Zhang | IJCAI 2020 |
| 2020 | On Approximating Degree-Bounded Network Design Problems | Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian | APPROX/RANDOM 2020 |
| 2020 | Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs | Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang | APPROX/RANDOM 2020 |
| 2020 | Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting | Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb | GECCO Companion 2020 |
| 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 Transactions on Knowledge and Data Engineering |
| 2020 | Bounded Incentives in Manipulating the Probabilistic Serial Rule | Zihe Wang, Zhide Wei, Jie Zhang | AAAI 2020 |
| 2020 | Optimal Common Contract with Heterogeneous Agents | Pingzhong Tang, Xun Wang, Zihe Wang, Yadong Xu, Xiwang Yang | AAAI 2020 |
| 2020 | Optimized Cost per Mille in Feeds Advertising | Shenke Xiao, Zihe Wang, Mengjing Chen, Pingzhong Tang, Xiwang Yang | AAMAS 2020 |
| 2020 | Bayesian Nash Equilibrium in First-Price Auction with Discrete Value Distributions | Zihe Wang, Weiran Shen, Song Zuo | AAMAS 2020 |
| 2020 | Inference from Auction Prices | Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov, Zihe Wang | SODA 2020 |
| 2020 | Zeros of ferromagnetic two-spin systems | Heng Guo, Jingcheng Liu, Pinyan Lu | SODA 2020 |
| 2020 | Fully Online Matching | Zhiyi Huang, Ning Kang, Zhihao Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu | Journal of the ACM 2020 |
| 2020 | Towards a Better Understanding of Randomized Greedy Matching | Zhihao Tang, Xiaowei Wu and Yuhao Zhang | STOC 2020 |
| 2020 | Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models | Tomer Ezra, Michal Feldman, Nick Gravin and Zhihao Tang | EC 2020 |
| 2019 | Learning Plackett-Luce Mixtures from Partial Preferences | Ao Liu, Zhibing Zhao, Chao Liao, Pinyan Lu, Lirong Xia | AAAI 2019 |
| 2019 | Prophet Inequality for Bipartite Matching: Merits of Being Simple and Non Adaptive | Nick Gravin, Hongao Wang | EC 2019 |
| 2019 | Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items | Ioannis Caragiannis, Nick Gravin, Xin Huang | EC 2019 |
| 2019 | Optimal Budget-Feasible Mechanisms for Additive Valuations | Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang | EC 2019 |
| 2019 | Spectral analysis of matrix scaling and operator scaling | Tsz Chiu Kwok, Lap Chi Lau, Akshay Ramachandran | FOCS 2019 |
| 2019 | Making Money from What You Know - How to Sell Information? | Shani Alkoby, Zihe Wang, David Sarne, Pingzhong Tang | AAAI 2019 |
| 2019 | O(log^2k/loglog{k})-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm | Fabrizio Grandoni , Bundit Laekhanukit and Shi Li | STOC 2019 |
| 2019 | Tight Approximation Ratio of Anonymous Pricing | Yaonan Jin , Pinyan Lu , Qi Qi , Zhihao Gavin Tang , Tao Xiao | STOC 2019 |
| 2019 | Counting Hypergraph Colorings in the Local Lemma Regime | Heng Guo, Chao Liao, Pinyan Lu, and Chihao Zhang | SIAM Journal on Computing 2019 |
| 2019 | Counting Independent Sets and Colorings on Random Regular Bipartite Graphs | Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao | APPROX-RANDOM 2019 |
| 2019 | Revenue Maximization with Imprecise Distribution | Yingkai Li, Pinyan Lu, Haoran Ye | AAMAS 2019 |
| 2019 | New Tools and Connections for Exponential-Time Approximation | Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof | Algorithmica 2019 |
| 2019 | On the Parameterized Complexity of Approximating Dominating Set | Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi | Journal of the ACM 2019 |
| 2019 | On the Complexity of Closest Pair via Polar-Pair of Point-Sets | Roee David, Karthik C. S., Bundit Laekhanukit | SIAM Journal on Discrete Mathematics 2019 |
| 2019 | Tight Revenue Gaps among Simple Mechanisms | Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang and Tao Xiao | SODA 2019 |
| 2019 | Correlation-Robust Analysis of Single Item Auction | Xiaohui Bei, Nick Gravin, Pinyan Lu and Zhihao Gavin Tang | SODA 2019 |
| 2019 | Zeros of Holant problems: locations and algorithms | Heng Guo, Chao Liao, Pinyan Lu and Chihao Zhang | SODA 2019 |
| 2019 | Approximability of the Six-vertex Model | Jin-Yi Cai, Tianyu Liu and Pinyan Lu | SODA 2019 |
| 2018 | Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems | Heng Guo, Pinyan Lu | TOCT 2018 |
| 2018 | A Simple Mechanism for a Budget-Constrained Buyer | Yu Cheng, Nick Gravin, Kamesh Munagala and Kangning Wang | WINE 2018 |
| 2018 | An improved welfare guarantee for first-price auctions | Darrell Hoy, Sam Taggart, Zihe Wang | SIGecom Exchanges |
| 2018 | Ex-post IR Dynamic Auctions with Cost-per-action Payments | Weiran Shen, Zihe Wang, Song Zuo | AAMAS 2018 |
| 2018 | Ex-post IR Dynamic Auctions with Cost-per-Action Payments | Weiran Shen, Zihe Wang, Song Zuo | IJCAI 2018 |
| 2018 | A tighter welfare guarantee for first-price auctions | Darrell Hoy, Samuel Taggart, Zihe Wang | STOC 2018 |
| 2018 | Facility Location Games With Fractional Preferences | Chi Kit Ken Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo | AAAI 2018 |
| 2018 | Testing Symmetric Markov Chains From a Single Trajectory | Constantinos Daskalakis, Nishanth Dikkala, and Nick Gravin | COLT 2018 |
| 2018 | Counting hypergraph colourings in the local lemma regime | Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang | STOC 2018 |
| 2018 | On the Parameterized Complexity of Approximating Dominating Set | Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi | STOC 2018 |
| 2018 | The Value of Information Concealment | Hu Fu, Chris Liaw, Pinyan Lu and Zhihao Gavin Tang | SODA 2018 |
| 2018 | On the Complexity of Closest Pair via Polar-Pair of Point-Sets | Roee David, Karthik C. S., Bundit Laekhanukit | SoCG 2018 |
| 2018 | Survivable Network Design for Group Connectivity in Low-Treewidth Graphs | Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz | APPROX-RANDOM 2018 |
| 2018 | Dichotomy for Real Holant^c Problems | Jin-Yi Cai, Pinyan Lu and Mingji Xia | SODA 2018 |
| 2018 | Separation in Correlation-Robust Monopolist Problem with Budget | Nick Gravin and Pinyan Lu | SODA 2018 |
| 2017 | Liquid Welfare Maximization in Auctions with Multiple Items | Pinyan Lu and Tao Xiao | SAGT 2017 |
| 2017 | An FPTAS for Counting Proper Four-Colorings on Cubic Graphs | Pinyan Lu, Kuan Yang, Chihao Zhang and Minshen Zhu | SODA 2017 |
| 2017 | From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai and Luca Trevisan | FOCS 2017 |
| 2017 | Computational Issues in Time-Inconsistent Planning | Pingzhong Tang, Yifeng Teng, Zihe Wang, Shenke Xiao, Yichong Xu | AAAI 2017 |
| 2017 | Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP | Jin-Yi Cai, Pinyan Lu and Mingji Xia | SIAM Journal on Computing |
| 2017 | Worst-Case Mechanism Design via Bayesian Analysis | Xiaohui Bei, Ning Chen, Nick Gravin and Pinyan Lu | SIAM Journal on Computing |
| 2017 | Hotelling-Downs Model with Limited Attraction | Weiran Shen, Zihe Wang | AAMAS 2017 |
| 2016 | Nonnegative Weighted #CSP: An Effective Complexity Dichotomy | Jin-Yi Cai, Xi Chen and Pinyan Lu | SIAM Journal on Computing |
| 2016 | Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems | Heng Guo and Pinyan Lu | APPROX-RANDOM 2016 |
| 2016 | Combinatorial Multi-Armed Bandit with General Reward Functions | Wei Chen, Wei Hu, Fu Li, Jian Li, Yu Liu and Pinyan Lu | NIPS 2016 |
| 2016 | FPTAS for Hardcore and Ising Models on Hypergraphs | Pinyan Lu, Kuan Yang and Chihao Zhang | STACS 2016 |
