default search action
Pinyan Lu
Person information
- affiliation: Shanghai University of Finance and Economics, China
- unicode name: 陆品燕
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j37]Yaonan Jin, Pinyan Lu:
First Price Auction is 1-1/e2 Efficient. J. ACM 70(5): 36:1-36:86 (2023) - 2022
- [j36]Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Bayesian auctions with efficient queries. Artif. Intell. 303: 103630 (2022) - [j35]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multiunit Mechanisms. SIAM J. Comput. 51(5): 1535-1579 (2022) - [j34]Yaonan Jin, Pinyan Lu:
Settling the Efficiency of the First-Price Auction. SIGecom Exch. 20(2): 69-74 (2022) - [j33]Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao:
An FPTAS for the hardcore model on random regular bipartite graphs. Theor. Comput. Sci. 929: 174-190 (2022) - 2021
- [j32]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant Problems: Locations and Algorithms. ACM Trans. Algorithms 17(1): 4:1-4:25 (2021) - 2020
- [j31]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant∗ Problems on the Boolean Domain. Theory Comput. Syst. 64(8): 1362-1391 (2020) - [j30]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps Among Simple Mechanisms. SIAM J. Comput. 49(5): 927-958 (2020) - [j29]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. ACM Trans. Economics and Comput. 8(4): 21:1-21:15 (2020) - 2019
- [j28]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Counting Hypergraph Colorings in the Local Lemma Regime. SIAM J. Comput. 48(4): 1397-1424 (2019) - [j27]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) - 2018
- [j26]Heng Guo, Pinyan Lu:
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. ACM Trans. Comput. Theory 10(4): 17:1-17:25 (2018) - 2017
- [j25]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. SIAM J. Comput. 46(3): 853-889 (2017) - [j24]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Worst-Case Mechanism Design via Bayesian Analysis. SIAM J. Comput. 46(4): 1428-1448 (2017) - 2016
- [j23]Jin-Yi Cai, Pinyan Lu:
Erratum to: Signature Theory in Holographic Algorithms. Algorithmica 74(4): 1473-1476 (2016) - [j22]Sangxia Huang, Pinyan Lu:
A Dichotomy for Real Weighted Holant Problems. Comput. Complex. 25(1): 255-304 (2016) - [j21]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy. SIAM J. Comput. 45(6): 2177-2198 (2016) - 2015
- [j20]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): 311-329 (2015) - 2014
- [j19]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
The complexity of complex weighted Boolean #CSP. J. Comput. Syst. Sci. 80(1): 217-236 (2014) - [j18]Ning Chen, Nick Gravin, Pinyan Lu:
Truthful Generalized Assignments via Stable Matching. Math. Oper. Res. 39(3): 722-736 (2014) - [j17]Pinyan Lu, Jack Snoeyink:
Frontiers in algorithmics. Theor. Comput. Sci. 532: 1 (2014) - 2013
- [j16]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. 42(1): 324-356 (2013) - [j15]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. SIAM J. Comput. 42(3): 924-1029 (2013) - 2012
- [j14]Jin-Yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holant c Problems. Algorithmica 64(3): 511-533 (2012) - [j13]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic reduction, interpolation and hardness. Comput. Complex. 21(4): 573-604 (2012) - [j12]Sungjin Im, Pinyan Lu, Yajun Wang:
Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers. J. Comput. Sci. Technol. 27(4): 702-709 (2012) - [j11]Pinyan Lu, Changyuan Yu:
Worst-Case Nash Equilibria in Restricted Routing. J. Comput. Sci. Technol. 27(4): 710-717 (2012) - 2011
- [j10]Jin-yi Cai, Pinyan Lu:
Signature Theory in Holographic Algorithms. Algorithmica 61(4): 779-816 (2011) - [j9]Jin-yi Cai, Pinyan Lu:
Holographic algorithms: From art to science. J. Comput. Syst. Sci. 77(1): 41-61 (2011) - [j8]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Computational Complexity of Holant Problems. SIAM J. Comput. 40(4): 1101-1132 (2011) - [j7]Jin-yi Cai, Pinyan Lu, Mingji Xia:
A computational proof of complexity of some restricted counting problems. Theor. Comput. Sci. 412(23): 2468-2485 (2011) - 2010
- [j6]Jin-yi Cai, Pinyan Lu:
On Symmetric Signatures in Holographic Algorithms. Theory Comput. Syst. 46(3): 398-415 (2010) - [j5]Jin-yi Cai, Pinyan Lu:
On blockwise symmetric signatures for matchgates. Theor. Comput. Sci. 411(4-5): 739-750 (2010) - 2009
- [j4]Jin-yi Cai, Vinay Choudhary, Pinyan Lu:
On the Theory of Matchgate Computations. Theory Comput. Syst. 45(1): 108-132 (2009) - [j3]Jin-yi Cai, Pinyan Lu:
Holographic algorithms: The power of dimensionality resolved. Theor. Comput. Sci. 410(18): 1618-1628 (2009) - 2008
- [j2]Jin-yi Cai, Pinyan Lu:
Basis Collapse in Holographic Algorithms. Comput. Complex. 17(2): 254-281 (2008) - 2007
- [j1]Jia Jia, Lianhong Cai, Pinyan Lu, Xuhui Liu:
Fingerprint matching based on weighting method and the SVM. Neurocomputing 70(4-6): 849-858 (2007)
Conference and Workshop Papers
- 2025
- [c105]Lingxiao Huang, Jian Li, Pinyan Lu, Xuan Wu:
Coresets for Constrained Clustering: General Assignment Constraints and Improved Size Bounds. SODA 2025: 4732-4782 - 2024
- [c104]Yaoxin Ge, Yao Zhang, Dengji Zhao, Zhihao Gavin Tang, Hu Fu, Pinyan Lu:
Incentives for Early Arrival in Cooperative Games. AAMAS 2024: 651-659 - [c103]Xiamin Chen, Zhendong Lei, Pinyan Lu:
Deep Cooperation of Local Search and Unit Propagation Techniques. CP 2024: 6:1-6:16 - [c102]Yaonan Jin, Pinyan Lu:
Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer. FOCS 2024: 1251-1259 - [c101]Fangxiao Wang, Bo Li, Pinyan Lu:
Improved Approximation of Weighted MMS Fairness for Indivisible Chores. IJCAI 2024: 3014-3022 - [c100]Yumou Fei, Leslie Ann Goldberg, Pinyan Lu:
Two-State Spin Systems with Negative Interactions. ITCS 2024: 45:1-45:13 - [c99]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Sample-Based Matroid Prophet Inequalities. EC 2024: 781 - [c98]Pinyan Lu, Zongqi Wan, Jialin Zhang:
Competitive Auctions with Imperfect Predictions. EC 2024: 1155-1183 - 2023
- [c97]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 - [c96]Yaonan Jin, Pinyan Lu, Tao Xiao:
Learning Reserve Prices in Second-Price Auctions. ITCS 2023: 75:1-75:24 - [c95]Yaonan Jin, Pinyan Lu:
The Price of Stability for First Price Auction. SODA 2023: 332-352 - [c94]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. SODA 2023: 3788-3801 - [c93]Pinyan Lu, Chenyang Xu, Ruilong Zhang:
Auction Design for Value Maximizers with Budget and Return-on-Spend Constraints. WINE 2023: 474-491 - 2022
- [c92]Yaonan Jin, Pinyan Lu:
First Price Auction is 1 - 1 /e2 Efficient. FOCS 2022: 179-187 - [c91]Chenyang Xu, Pinyan Lu:
Mechanism Design with Predictions. IJCAI 2022: 571-577 - [c90]Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Bayesian Auctions with Efficient Queries (Extended Abstract). IJCAI 2022: 5708-5712 - [c89]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: 29:1-29:3 - [c88]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: 2461-2470 - [c87]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Abner Turkieltaub, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Oblivious Online Contention Resolution Schemes. SOSA 2022: 268-278 - [c86]Pinyan Lu, Enze Sun, Chenghan Zhou:
Better Approximation for Interdependent SOS Valuations. WINE 2022: 219-234 - 2021
- [c85]Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang:
Online Selection Problems against Constrained Adversary. ICML 2021: 5002-5012 - [c84]Xin Huang, Pinyan Lu:
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores. EC 2021: 630-631 - [c83]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multi-Unit Mechanisms. EC 2021: 654-673 - [c82]Zhengfeng Ji, Zhihan Jin, Pinyan Lu:
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. SODA 2021: 959-975 - [c81]Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu:
Concentration bounds for almost k-wise independence with applications to non-uniform security. SODA 2021: 2404-2423 - [c80]Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang:
Generalized Sorting with Predictions. SOSA 2021: 111-117 - [c79]Pinyan Lu, Chao Tao, Xiaojin Zhang:
Variance-dependent best arm identification. UAI 2021: 1120-1129 - [c78]Ioannis Caragiannis, Nick Gravin, Pinyan Lu, Zihe Wang:
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. WINE 2021: 131-148 - 2020
- [c77]Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu:
Approximability of the Eight-Vertex Model. CCC 2020: 4:1-4:18 - [c76]Minming Li, Pinyan Lu, Yuhao Yao, Jialin Zhang:
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio. IJCAI 2020: 238-245 - [c75]Heng Guo, Jingcheng Liu, Pinyan Lu:
Zeros of ferromagnetic 2-spin systems. SODA 2020: 181-192 - 2019
- [c74]Ao Liu, Zhibing Zhao, Chao Liao, Pinyan Lu, Lirong Xia:
Learning Plackett-Luce Mixtures from Partial Preferences. AAAI 2019: 4328-4335 - [c73]Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao:
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs. APPROX-RANDOM 2019: 34:1-34:12 - [c72]Yingkai Li, Pinyan Lu, Haoran Ye:
Revenue Maximization with Imprecise Distribution. AAMAS 2019: 1582-1590 - [c71]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. EC 2019: 887-900 - [c70]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Correlation-Robust Analysis of Single Item Auction. SODA 2019: 193-208 - [c69]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps among Simple Mechanisms. SODA 2019: 209-228 - [c68]Jin-Yi Cai, Tianyu Liu, Pinyan Lu:
Approximability of the Six-vertex Model. SODA 2019: 2248-2261 - [c67]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant problems: locations and algorithms. SODA 2019: 2262-2278 - [c66]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight approximation ratio of anonymous pricing. STOC 2019: 674-685 - 2018
- [c65]Chi Kit Ken Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo:
Facility Location Games With Fractional Preferences. AAAI 2018: 1039-1046 - [c64]Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Brief Announcement: Bayesian Auctions with Efficient Queries. ICALP 2018: 108:1-108:4 - [c63]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Real Holantc Problems. SODA 2018: 1802-1821 - [c62]Nick Gravin, Pinyan Lu:
Separation in Correlation-Robust Monopolist Problem with Budget. SODA 2018: 2069-2080 - [c61]Hu Fu, Christopher Liaw, Pinyan Lu, Zhihao Gavin Tang:
The Value of Information Concealment. SODA 2018: 2533-2544 - [c60]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Counting hypergraph colourings in the local lemma regime. STOC 2018: 926-939 - 2017
- [c59]Pinyan Lu, Tao Xiao:
Liquid Welfare Maximization in Auctions with Multiple Items. SAGT 2017: 41-52 - [c58]Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu:
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. SODA 2017: 1798-1817 - 2016
- [c57]Heng Guo, Pinyan Lu:
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. APPROX-RANDOM 2016: 31:1-31:26 - [c56]Wei Chen, Wei Hu, Fu Li, Jian Li, Yu Liu, Pinyan Lu:
Combinatorial Multi-Armed Bandit with General Reward Functions. NIPS 2016: 1651-1659 - [c55]Lingxiao Huang, Pinyan Lu, Chihao Zhang:
Canonical Paths for MCMC: from Art to Science. SODA 2016: 514-527 - [c54]Pinyan Lu, Kuan Yang, Chihao Zhang:
FPTAS for Hardcore and Ising Models on Hypergraphs. STACS 2016: 51:1-51:14 - 2015
- [c53]Ning Chen, Nikolai Gravin, Pinyan Lu:
Competitive Analysis via Benchmark Decomposition. EC 2015: 363-376 - [c52]Pinyan Lu, Tao Xiao:
Improved Efficiency Guarantees in Auctions with Budgets. EC 2015: 397-413 - [c51]Jingcheng Liu, Pinyan Lu:
FPTAS for Counting Monotone CNF. SODA 2015: 1531-1548 - [c50]Jingcheng Liu, Pinyan Lu:
FPTAS for #BIS with Degree Bounds on One Side. STOC 2015: 549-556 - 2014
- [c49]Jingcheng Liu, Pinyan Lu, Chihao Zhang:
The Complexity of Ferromagnetic Two-spin Systems with External Fields. APPROX-RANDOM 2014: 843-856 - [c48]Jingcheng Liu, Pinyan Lu, Chihao Zhang:
FPTAS for Counting Weighted Edge Covers. ESA 2014: 654-665 - [c47]Pinyan Lu, Menghui Wang, Chihao Zhang:
FPTAS for Weighted Fibonacci Gates and Its Applications. ICALP (1) 2014: 787-799 - [c46]Chengyu Lin, Jingcheng Liu, Pinyan Lu:
A Simple FPTAS for Counting Edge Covers. SODA 2014: 341-348 - [c45]Ning Chen, Nick Gravin, Pinyan Lu:
Optimal competitive auctions. STOC 2014: 253-262 - 2013
- [c44]Pinyan Lu, Yitong Yin:
Improved FPTAS for Multi-spin Systems. APPROX-RANDOM 2013: 639-654 - [c43]Nick Gravin, Pinyan Lu:
Competitive Auctions for Markets with Positive Externalities. ICALP (2) 2013: 569-580 - [c42]Chen Zeng, Jin-Yi Cai, Pinyan Lu, Jeffrey F. Naughton:
On optimal differentially private mechanisms for count-range queries. ICDT 2013: 261-271 - [c41]Liang Li, Pinyan Lu, Yitong Yin:
Correlation Decay up to Uniqueness in Spin Systems. SODA 2013: 67-84 - [c40]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant* Problems with Domain Size 3. SODA 2013: 1278-1295 - [c39]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. STACS 2013: 148-159 - [c38]Pinyan Lu, Lan Yu:
Characterization of Truthful Mechanisms for One-Dimensional Single Facility Location Game with Payments. WINE 2013: 333-346 - 2012
- [c37]Ning Chen, Pinyan Lu, Hongyang Zhang:
Computing the Nucleolus of Matching, Cover and Clique Games. AAAI 2012: 1319-1325 - [c36]Sangxia Huang, Pinyan Lu:
A Dichotomy for Real Weighted Holant Problems. CCC 2012: 96-106 - [c35]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability after Uniqueness Phase Transition in Two-Spin Systems. COCOA 2012: 336-347 - [c34]Liang Li, Pinyan Lu, Yitong Yin:
Approximate counting via correlation decay in spin systems. SODA 2012: 922-940 - [c33]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget feasible mechanism design: from prior-free to bayesian. STOC 2012: 449-458 - 2011
- [c32]Jin-yi Cai, Xi Chen, Pinyan Lu:
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy. CCC 2011: 45-54 - [c31]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723 - [c30]Ning Chen, Nick Gravin, Pinyan Lu:
On the Approximability of Budget Feasible Mechanisms. SODA 2011: 685-699 - [c29]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant* Problems of Boolean Domain. SODA 2011: 1714-1728 - [c28]Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia:
The Complexity of Weighted Boolean #CSP Modulo k. STACS 2011: 249-260 - [c27]Wei Chen, Pinyan Lu, Xiaorui Sun, Bo Tang, Yajun Wang, Zeyuan Allen Zhu:
Optimal Pricing in Social Networks with Incomplete Information. WINE 2011: 49-60 - [c26]Xue Chen, Guangda Hu, Pinyan Lu, Lei Wang:
On the Approximation Ratio of k-Lookahead Auction. WINE 2011: 61-71 - [c25]Dakan Wang, Gang Wang, Pinyan Lu, Yajun Wang, Zheng Chen, Botao Amber Hu:
Is pay-per-click efficient?: an empirical analysis of click values. WWW (Companion Volume) 2011: 141-142 - 2010
- [c24]Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. FAW 2010: 148-159 - [c23]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP. FOCS 2010: 427-436 - [c22]Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. ICALP (1) 2010: 275-286 - [c21]Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant to #CSP and Back: Dichotomy for Holantc Problems. ISAAC (1) 2010: 253-265 - [c20]Pinyan Lu, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu:
Asymptotically optimal strategy-proof mechanisms for two-facility games. EC 2010: 315-324 - [c19]Sungjin Im, Pinyan Lu, Yajun Wang:
Envy-Free Pricing with General Supply Constraints. WINE 2010: 483-491 - 2009
- [c18]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holant problems and counting CSP. STOC 2009: 715-724 - [c17]Jin-yi Cai, Pinyan Lu, Mingji Xia:
A Computational Proof of Complexity of Some Restricted Counting Problems. TAMC 2009: 138-149 - [c16]Pinyan Lu:
On 2-Player Randomized Mechanisms for Scheduling. WINE 2009: 30-41 - [c15]Pinyan Lu, Yajun Wang, Yuan Zhou:
Tighter Bounds for Facility Games. WINE 2009: 137-148 - 2008
- [c14]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. FOCS 2008: 644-653 - [c13]Jin-yi Cai, Pinyan Lu:
Signature Theory in Holographic Algorithms. ISAAC 2008: 568-579 - [c12]Jin-yi Cai, Pinyan Lu:
Holographic algorithms with unsymmetric signatures. SODA 2008: 54-63 - [c11]Pinyan Lu, Changyuan Yu:
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. STACS 2008: 527-538 - [c10]Pinyan Lu, Changyuan Yu:
Worst-Case Nash Equilibria in Restricted Routing. WINE 2008: 231-238 - [c9]Pinyan Lu, Changyuan Yu:
Randomized Truthful Mechanisms for Scheduling Unrelated Machines. WINE 2008: 402-413 - 2007
- [c8]Jin-yi Cai, Pinyan Lu:
Bases Collapse in Holographic Algorithms. CCC 2007: 292-304 - [c7]Jin-yi Cai, Vinay Choudhary, Pinyan Lu:
On the Theory of Matchgate Computations. CCC 2007: 305-318 - [c6]Jin-yi Cai, Pinyan Lu:
On Block-Wise Symmetric Signatures for Matchgates. FCT 2007: 187-198 - [c5]Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: The Power of Dimensionality Resolved. ICALP 2007: 631-642 - [c4]Jin-yi Cai, Pinyan Lu:
On Symmetric Signatures in Holographic Algorithms. STACS 2007: 429-440 - [c3]Jin-yi Cai, Pinyan Lu:
Holographic algorithms: from art to science. STOC 2007: 401-410 - 2006
- [c2]Pinyan Lu, Shang-Hua Teng, Changyuan Yu:
Truthful Auctions with Optimal Profit. WINE 2006: 27-36 - 2005
- [c1]Pinyan Lu, Jialin Zhang, Chung Keung Poon, Jin-yi Cai:
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs. ISAAC 2005: 767-776
Parts in Books or Collections
- 2017
- [p1]Heng Guo, Pinyan Lu:
On the Complexity of Holant Problems. The Constraint Satisfaction Problem 2017: 159-177
Editorship
- 2019
- [e5]Pinyan Lu, Guochuan Zhang:
30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. LIPIcs 149, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-130-6 [contents] - 2018
- [e4]Jianer Chen, Pinyan Lu:
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings. Lecture Notes in Computer Science 10823, Springer 2018, ISBN 978-3-319-78454-0 [contents] - [e3]Lian Li, Pinyan Lu, Kun He:
Theoretical Computer Science - 36th National Conference, NCTCS 2018, Shanghai, China, October 13-14, 2018, Proceedings. Communications in Computer and Information Science 882, Springer 2018, ISBN 978-981-13-2711-7 [contents] - 2017
- [e2]Nikhil R. Devanur, Pinyan Lu:
Web and Internet Economics - 13th International Conference, WINE 2017, Bangalore, India, December 17-20, 2017, Proceedings. Lecture Notes in Computer Science 10660, Springer 2017, ISBN 978-3-319-71923-8 [contents] - 2012
- [e1]Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings. Lecture Notes in Computer Science 7285, Springer 2012, ISBN 978-3-642-29699-4 [contents]
Reference Works
- 2016
- [r3]Pinyan Lu, Yitong Yin:
Approximating the Partition Function of Two-Spin Systems. Encyclopedia of Algorithms 2016: 117-123 - [r2]Jin-Yi Cai, Xi Chen, Pinyan Lu:
Complexity Dichotomies for Counting Graph Homomorphisms. Encyclopedia of Algorithms 2016: 366-369 - [r1]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms. Encyclopedia of Algorithms 2016: 921-926
Informal and Other Publications
- 2024
- [i70]Pinyan Lu, Zihan Luo, Jialin Zhang:
Design and Characterization of Strategy-Proof Mechanisms for Two-Facility Game on a Line. CoRR abs/2404.06252 (2024) - [i69]Hu Fu, Pinyan Lu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang:
Sample-Based Matroid Prophet Inequalities. CoRR abs/2406.12799 (2024) - [i68]Junyu Zhang, Yao Zhang, Yaoxin Ge, Dengji Zhao, Hu Fu, Zhihao Gavin Tang, Pinyan Lu:
Incentives for Early Arrival in Cost Sharing. CoRR abs/2410.18586 (2024) - 2023
- [i67]Pinyan Lu, Chenyang Xu, Ruilong Zhang:
Auction Design for Value Maximizers with Budget and Return-on-spend Constraints. CoRR abs/2307.04302 (2023) - [i66]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 abs/2308.04639 (2023) - [i65]Yumou Fei, Leslie Ann Goldberg, Pinyan Lu:
Two-State Spin Systems with Negative Interactions. CoRR abs/2309.04735 (2023) - [i64]Pinyan Lu, Zongqi Wan, Jialin Zhang:
Competitive Auctions with Imperfect Predictions. CoRR abs/2309.15414 (2023) - 2022
- [i63]Chenyang Xu, Pinyan Lu:
Mechanism Design with Predictions. CoRR abs/2205.11313 (2022) - [i62]Yaonan Jin, Pinyan Lu:
First Price Auction is 1 - 1/e2 Efficient. CoRR abs/2207.01761 (2022) - [i61]Yaonan Jin, Pinyan Lu:
The Price of Stability for First Price Auction. CoRR abs/2207.04455 (2022) - [i60]Pinyan Lu, Enze Sun, Chenghan Zhou:
Better Approximation for Interdependent SOS Valuations. CoRR abs/2210.06507 (2022) - [i59]Xiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang:
Bidder Subset Selection Problem in Auction Design. CoRR abs/2211.10969 (2022) - 2021
- [i58]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multi-Unit Mechanisms. CoRR abs/2102.07454 (2021) - [i57]Pinyan Lu, Chao Tao, Xiaojin Zhang:
Variance-Dependent Best Arm Identification. CoRR abs/2106.10417 (2021) - [i56]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
- [i55]Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang:
Generalized Sorting with Predictions. CoRR abs/2011.00172 (2020) - 2019
- [i54]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. CoRR abs/1902.04635 (2019) - [i53]Yingkai Li, Pinyan Lu, Haoran Ye:
Revenue Maximization with Imprecise Distribution. CoRR abs/1903.00836 (2019) - [i52]Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao:
Counting independent sets and colorings on random regular bipartite graphs. CoRR abs/1903.07531 (2019) - [i51]Xin Huang, Pinyan Lu:
An algorithmic framework for approximating maximin share allocation of chores. CoRR abs/1907.04505 (2019) - [i50]Heng Guo, Jingcheng Liu, Pinyan Lu:
Zeros of ferromagnetic 2-spin systems. CoRR abs/1907.06156 (2019) - [i49]Minming Li, Pinyan Lu, Yuhao Yao, Jialin Zhang:
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio. CoRR abs/1907.08918 (2019) - [i48]Zhengfeng Ji, Zhihan Jin, Pinyan Lu:
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler. CoRR abs/1911.11962 (2019) - [i47]Yaonan Jin, Pinyan Lu, Tao Xiao:
Learning Reserve Prices in Second-Price Auctions. CoRR abs/1912.10069 (2019) - 2018
- [i46]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps among Simple Mechanisms. CoRR abs/1804.00480 (2018) - [i45]Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Bayesian Auctions with Efficient Queries. CoRR abs/1804.07451 (2018) - [i44]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant problems: locations and algorithms. CoRR abs/1807.09129 (2018) - [i43]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight Approximation Ratio of Anonymous Pricing. CoRR abs/1811.00763 (2018) - [i42]Jin-Yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu:
Approximability of the Eight-vertex Model. CoRR abs/1811.03126 (2018) - 2017
- [i41]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Real Holantc Problems. CoRR abs/1702.02693 (2017) - [i40]Hu Fu, Chris Liaw, Pinyan Lu, Zhihao Gavin Tang:
The Value of Information Concealment. CoRR abs/1707.05875 (2017) - [i39]Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Counting hypergraph colorings in the local lemma regime. CoRR abs/1711.03396 (2017) - [i38]Jin-Yi Cai, Tianyu Liu, Pinyan Lu:
Approximability of the Six-vertex Model. CoRR abs/1712.05880 (2017) - 2016
- [i37]Wei Chen, Wei Hu, Fu Li, Jian Li, Yu Liu, Pinyan Lu:
Combinatorial Multi-Armed Bandit with General Reward Functions. CoRR abs/1610.06603 (2016) - [i36]Pinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu:
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs. CoRR abs/1611.04100 (2016) - 2015
- [i35]Pinyan Lu, Kuan Yang, Chihao Zhang:
FPTAS for Hardcore and Ising Models on Hypergraphs. CoRR abs/1509.05494 (2015) - [i34]Lingxiao Huang, Pinyan Lu, Chihao Zhang:
Canonical Paths for MCMC: from Art to Science. CoRR abs/1510.04099 (2015) - [i33]Heng Guo, Pinyan Lu:
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. CoRR abs/1511.00493 (2015) - 2014
- [i32]Ning Chen, Nick Gravin, Pinyan Lu:
Optimal Competitive Auctions. CoRR abs/1401.0880 (2014) - [i31]Jingcheng Liu, Pinyan Lu, Chihao Zhang:
The Complexity of Ferromagnetic Two-spin Systems with External Fields. CoRR abs/1402.4346 (2014) - [i30]Pinyan Lu, Menghui Wang, Chihao Zhang:
FPTAS for Weighted Fibonacci Gates and Its Applications. CoRR abs/1402.4370 (2014) - [i29]Pinyan Lu, Tao Xiao:
Improved Efficiency Guarantees in Auctions with Budgets. CoRR abs/1407.8325 (2014) - [i28]Ning Chen, Nick Gravin, Pinyan Lu:
Competitive analysis via benchmark decomposition. CoRR abs/1411.2079 (2014) - [i27]Jingcheng Liu, Pinyan Lu:
FPTAS for #BIS with One Side Degree Bound. CoRR abs/1412.0073 (2014) - 2013
- [i26]Chengyu Lin, Jingcheng Liu, Pinyan Lu:
A Simple FPTAS for Counting Edge Covers. CoRR abs/1309.6115 (2013) - [i25]Jingcheng Liu, Pinyan Lu:
FPTAS for Counting Monotone CNF. CoRR abs/1311.3728 (2013) - 2012
- [i24]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget Feasible Mechanism Design: From Prior-Free to Bayesian. CoRR abs/1203.4455 (2012) - [i23]Jin-Yi Cai, Xi Chen, Heng Guo, Pinyan Lu:
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems. CoRR abs/1205.2934 (2012) - [i22]Jin-Yi Cai, Pinyan Lu, Mingji Xia:
Dichotomy for Holant* Problems with a Function on Domain Size 3. CoRR abs/1207.2354 (2012) - [i21]Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby:
The complexity of approximating conservative counting CSPs. CoRR abs/1208.1783 (2012) - 2011
- [i20]Ning Chen, Nick Gravin, Pinyan Lu:
Mechanism Design without Money via Stable Matching. CoRR abs/1104.2872 (2011) - [i19]Xiaohui Bei, Ning Chen, Nick Gravin, Pinyan Lu:
Budget Feasible Mechanism Design via Random Sampling. CoRR abs/1107.2994 (2011) - [i18]Nick Gravin, Pinyan Lu:
Competitive Auctions for Markets with Positive Externalities. CoRR abs/1107.5221 (2011) - [i17]Liang Li, Pinyan Lu, Yitong Yin:
Approximate Counting via Correlation Decay in Spin Systems. CoRR abs/1109.0604 (2011) - [i16]Liang Li, Pinyan Lu, Yitong Yin:
Correlation Decay up to Uniqueness in Spin Systems. CoRR abs/1111.7064 (2011) - [i15]Pinyan Lu:
Complexity Dichotomies of Counting Problems. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i14]Jin-yi Cai, Sangxia Huang, Pinyan Lu:
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems. CoRR abs/1004.0803 (2010) - [i13]Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
On Tractable Exponential Sums. CoRR abs/1005.2632 (2010) - [i12]Wei Chen, Pinyan Lu, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu:
Pricing in Social Networks: Equilibrium and Revenue Maximization. CoRR abs/1007.1501 (2010) - [i11]Ning Chen, Nick Gravin, Pinyan Lu:
On the Approximability of Budget Feasible Mechanisms. CoRR abs/1007.3801 (2010) - [i10]Jin-yi Cai, Pinyan Lu, Mingji Xia:
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. CoRR abs/1008.0683 (2010) - [i9]Jin-yi Cai, Xi Chen, Pinyan Lu:
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy. CoRR abs/1012.5659 (2010) - 2009
- [i8]Jin-yi Cai, Xi Chen, Pinyan Lu:
Graph Homomorphisms with Complex Values: A Dichotomy Theorem. CoRR abs/0903.4728 (2009) - 2008
- [i7]Jin-yi Cai, Pinyan Lu, Mingji Xia:
A Family of Counter Examples to an Approach to Graph Isomorphism. CoRR abs/0801.1766 (2008) - [i6]Pinyan Lu, Changyuan Yu:
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. CoRR abs/0802.2851 (2008) - 2007
- [i5]Jin-yi Cai, Pinyan Lu:
Bases Collapse in Holographic Algorithms. Electron. Colloquium Comput. Complex. TR07 (2007) - [i4]Jin-yi Cai, Pinyan Lu:
On Block-wise Symmetric Signatures for Matchgates. Electron. Colloquium Comput. Complex. TR07 (2007) - [i3]Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: The Power of Dimensionality Resolved. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i2]Jin-yi Cai, Pinyan Lu:
On Symmetric Signatures in Holographic Algorithms. Electron. Colloquium Comput. Complex. TR06 (2006) - [i1]Jin-yi Cai, Pinyan Lu:
Holographic Algorithms: From Art to Science. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
aka: Jin-yi Cai
aka: Nikolai Gravin
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 2025-01-29 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint