Pinyan Lu

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 98

Top Venues

CoRR

SODA

SIAM J. Comput.

Publications

Xiamin Chen, Zhendong Lei, Pinyan Lu
Deep Cooperation of Local Search and Unit Propagation Techniques. CP (2024)
Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu
Incentives for Early Arrival in Cooperative Games. AAMAS (2024)
Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
Two-State Spin Systems with Negative Interactions. ITCS (2024)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Sample-Based Matroid Prophet Inequalities. CoRR (2024)
Pinyan Lu, Zihan Luo, Jialin Zhang
Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. CoRR (2024)
Yumou Fei, Leslie Ann Goldberg, Pinyan Lu
Two-State Spin Systems with Negative Interactions. CoRR (2023)
Lingxiao Huang, Pinyan Lu, Xuan Wu
Improved Coresets for Clustering with Capacity and Fairness Constraints. CoRR (2023)
Chang Liu, Zetian Jiang, Runzhong Wang, Lingxiao Huang, Pinyan Lu, Junchi Yan
Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching. ICLR (2023)
Yaonan Jin, Pinyan Lu, Tao Xiao
Learning Reserve Prices in Second-Price Auctions. ITCS (2023)
Yaonan Jin, Pinyan Lu
The Price of Stability for First Price Auction. SODA (2023)
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
Bidder Subset Selection Problem in Auction Design. SODA (2023)
Pinyan Lu, Chenyang Xu, Ruilong Zhang
Auction Design for Value Maximizers with Budget and Return-on-spend Constraints. CoRR (2023)
Zhang-Hua Fu, Sipeng Sun, Jintong Ren, Tianshu Yu, Haoyu Zhang, Yuanyuan Liu, Lingxiao Huang, Xiang Yan, Pinyan Lu
A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem. CoRR (2023)
Pinyan Lu, Zongqi Wan, Jialin Zhang
Competitive Auctions with Imperfect Predictions. CoRR (2023)
Pinyan Lu, Chenyang Xu, Ruilong Zhang
Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints. WINE (2023)
Yaonan Jin, Pinyan Lu
Efficient. J. ACM 70 (5) (2023)
Chenyang Xu, Pinyan Lu
Mechanism Design with Predictions. IJCAI (2022)
Shaofeng Zhang, Meng Liu, Junchi Yan, Hengrui Zhang, Lingxiao Huang, Xiaokang Yang, Pinyan Lu
M-Mix: Generating Hard Negatives via Multi-sample Mixing for Contrastive Learning. KDD (2022)
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu
Bayesian Auctions with Efficient Queries (Extended Abstract). IJCAI (2022)
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
Bidder Subset Selection Problem in Auction Design. CoRR (2022)
Chenyang Xu, Pinyan Lu
Mechanism Design with Predictions. CoRR (2022)
Yaonan Jin, Pinyan Lu
Efficient. CoRR (2022)
Yaonan Jin, Pinyan Lu
The Price of Stability for First Price Auction. CoRR (2022)
Pinyan Lu, Enze Sun, Chenghan Zhou
Better Approximation for Interdependent SOS Valuations. WINE (2022)
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
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem. IPEC (2022)
Yaonan Jin, Pinyan Lu
Efficient. FOCS (2022)
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu
Bayesian auctions with efficient queries. Artif. Intell. 303 (2022)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Oblivious Online Contention Resolution Schemes. SOSA (2022)
Pinyan Lu, Enze Sun, Chenghan Zhou
Better Approximation for Interdependent SOS Valuations. CoRR (2022)
Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao
An FPTAS for the hardcore model on random regular bipartite graphs. Theor. Comput. Sci. 929 (2022)
Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang
Tight Revenue Gaps among Multiunit Mechanisms. SIAM J. Comput. 51 (5) (2022)
Pinyan Lu, Chao Tao, Xiaojin Zhang
Variance-Dependent Best Arm Identification. CoRR (2021)
Ioannis Caragiannis, Nick Gravin, Pinyan Lu, Zihe Wang
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. WINE (2021)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Zeros of Holant Problems: Locations and Algorithms. ACM Trans. Algorithms 17 (1) (2021)
Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang
Generalized Sorting with Predictions. SOSA (2021)
Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang
Tight Revenue Gaps among Multi-Unit Mechanisms. CoRR (2021)
Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang
Tight Revenue Gaps among Multi-Unit Mechanisms. EC (2021)
Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang
Online Selection Problems against Constrained Adversary. ICML (2021)
Pinyan Lu, Chao Tao, Xiaojin Zhang
Variance-dependent best arm identification. UAI (2021)
Zhengfeng Ji, Zhihan Jin, Pinyan Lu
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. SODA (2021)
Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu
-wise independence with applications to non-uniform security. SODA (2021)
Xin Huang, Pinyan Lu
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores. EC (2021)
Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang
Oblivious Online Contention Resolution Schemes. CoRR (2021)
Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang
Optimal Budget-Feasible Mechanisms for Additive Valuations. ACM Trans. Economics and Comput. 8 (4) (2020)
Minming Li, Pinyan Lu, Yuhao Yao, Jialin Zhang
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio. IJCAI (2020)
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao
Tight Revenue Gaps Among Simple Mechanisms. SIAM J. Comput. 49 (5) (2020)
Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang
Generalized Sorting with Predictions. CoRR (2020)
Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu
Approximability of the Eight-Vertex Model. Computational Complexity Conference (2020)
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Problems on the Boolean Domain. Theory Comput. Syst. 64 (8) (2020)
Heng Guo, Jingcheng Liu, Pinyan Lu
Zeros of ferromagnetic 2-spin systems. SODA (2020)
Ao Liu, Zhibing Zhao, Chao Liao, Pinyan Lu, Lirong Xia
Learning Plackett-Luce Mixtures from Partial Preferences. AAAI (2019)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Zeros of Holant problems: locations and algorithms. SODA (2019)
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao
Tight Revenue Gaps among Simple Mechanisms. SODA (2019)
Yingkai Li, Pinyan Lu, Haoran Ye
Revenue Maximization with Imprecise Distribution. CoRR (2019)
Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang
Correlation-Robust Analysis of Single Item Auction. SODA (2019)
Yingkai Li, Pinyan Lu, Haoran Ye
Revenue Maximization with Imprecise Distribution. AAMAS (2019)
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao
Tight revenue gaps among simple and optimal mechanisms. SIGecom Exch. 17 (2) (2019)
Minming Li, Pinyan Lu, Yuhao Yao, Jialin Zhang
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio. CoRR (2019)
Jin-Yi Cai, Tianyu Liu, Pinyan Lu
Approximability of the Six-vertex Model. SODA (2019)
Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang
Optimal Budget-Feasible Mechanisms for Additive Valuations. EC (2019)
Yaonan Jin, Pinyan Lu, Tao Xiao
Learning Reserve Prices in Second-Price Auctions. CoRR (2019)
Heng Guo, Jingcheng Liu, Pinyan Lu
Zeros of ferromagnetic 2-spin systems. CoRR (2019)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Counting Hypergraph Colorings in the Local Lemma Regime. SIAM J. Comput. 48 (4) (2019)
Zhengfeng Ji, Zhihan Jin, Pinyan Lu
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. CoRR (2019)
Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao
Counting independent sets and colorings on random regular bipartite graphs. CoRR (2019)
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao
Tight approximation ratio of anonymous pricing. STOC (2019)
Xin Huang, Pinyan Lu
An algorithmic framework for approximating maximin share allocation of chores. CoRR (2019)
Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang
Optimal Budget-Feasible Mechanisms for Additive Valuations. CoRR (2019)
Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs. APPROX-RANDOM (2019)
Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu
Approximability of the Eight-vertex Model. CoRR (2018)
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao
Tight Revenue Gaps among Simple Mechanisms. CoRR (2018)
Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao
Tight Approximation Ratio of Anonymous Pricing. CoRR (2018)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Counting hypergraph colourings in the local lemma regime. STOC (2018)
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu
Brief Announcement: Bayesian Auctions with Efficient Queries. ICALP (2018)
Chi Kit Ken Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo
Facility Location Games With Fractional Preferences. AAAI (2018)
Nick Gravin, Pinyan Lu
Separation in Correlation-Robust Monopolist Problem with Budget. SODA (2018)
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Problems. SODA (2018)
Jing Chen, Bo Li, Yingkai Li, Pinyan Lu
Bayesian Auctions with Efficient Queries. CoRR (2018)
Hu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang
The Value of Information Concealment. SODA (2018)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Zeros of Holant problems: locations and algorithms. CoRR (2018)
Heng Guo, Pinyan Lu
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. ACM Trans. Comput. Theory 10 (4) (2018)
Hu Fu, Chris Liaw, Pinyan Lu, Zhihao Gavin Tang
The Value of Information Concealment. CoRR (2017)
Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. SODA (2017)
Pinyan Lu, Tao Xiao
Liquid Welfare Maximization in Auctions with Multiple Items. SAGT (2017)
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Problems. CoRR (2017)
Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu
Worst-Case Mechanism Design via Bayesian Analysis. SIAM J. Comput. 46 (4) (2017)
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. SIAM J. Comput. 46 (3) (2017)
Jin-Yi Cai, Tianyu Liu, Pinyan Lu
Approximability of the Six-vertex Model. CoRR (2017)
Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang
Counting hypergraph colorings in the local lemma regime. CoRR (2017)
Wei Chen, Wei Hu, Fu Li, Jian Li, Yu Liu, Pinyan Lu
Combinatorial Multi-Armed Bandit with General Reward Functions. NIPS (2016)
Wei Chen, Wei Hu, Fu Li, Jian Li, Yu Liu, Pinyan Lu
Combinatorial Multi-Armed Bandit with General Reward Functions. CoRR (2016)
Heng Guo, Pinyan Lu
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. APPROX-RANDOM (2016)
Lingxiao Huang, Pinyan Lu, Chihao Zhang
Canonical Paths for MCMC: from Art to Science. SODA (2016)
Sangxia Huang, Pinyan Lu
A Dichotomy for Real Weighted Holant Problems. Comput. Complex. 25 (1) (2016)
Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. CoRR (2016)
Jin-Yi Cai, Xi Chen, Pinyan Lu
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. SIAM J. Comput. 45 (6) (2016)
Pinyan Lu, Kuan Yang, Chihao Zhang
FPTAS for Hardcore and Ising Models on Hypergraphs. STACS (2016)
Jin-Yi Cai, Pinyan Lu
Erratum to: Signature Theory in Holographic Algorithms. Algorithmica 74 (4) (2016)
Ning Chen, Nikolai Gravin, Pinyan Lu
Competitive Analysis via Benchmark Decomposition. EC (2015)
Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci. 81 (1) (2015)

Pinyan Lu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pinyan Lu