World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
3516
World Ranking
13745
National Ranking
1670

Research.com Recognitions

  • 2019 - ACM Distinguished Member

Overview

Pinyan Lu is affiliated with Shanghai University of Finance and Economics in China. Their research spans multiple domains within computer science, decision sciences, and business, management and accounting, with a significant focus on management science and operations research, marketing, and artificial intelligence.

The scientist's work primarily covers topics such as auction theory and applications, consumer market behavior and pricing, game theory and voting systems, advanced bandit algorithms research, complexity and algorithms in graphs, optimization and search problems, and Markov chains and Monte Carlo methods.

Pinyan Lu has contributed to a number of publications, including proceedings and journals in prominent venues. Their recent papers include:

  • "M-Mix", 2022, Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
  • "Computing the Nucleolus of Matching, Cover and Clique Games", 2021, Proceedings of the AAAI Conference on Artificial Intelligence
  • "Optimal Budget-Feasible Mechanisms for Additive Valuations", 2020, ACM Transactions on Economics and Computation
  • "Mechanism Design with Predictions", 2022, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
  • "Tight Revenue Gaps Among Simple Mechanisms", 2020, SIAM Journal on Computing

Their frequent coauthors include Yaonan Jin, Zhihao Gavin Tang, Lingxiao Huang, Nick Gravin, and Chenyang Xu. Collaborative work with these researchers is evidenced by multiple joint publications.

Pinyan Lu's work appears regularly in venues such as arXiv (Cornell University), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, Proceedings of the AAAI Conference on Artificial Intelligence, SIAM Journal on Computing, and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Their research contributes broadly to subfields including management science and operations research, marketing, artificial intelligence, economics and econometrics, and computational theory and mathematics.

In recognition of their contributions, Pinyan Lu was honored as an ACM Distinguished Member in 2019.

Best Publications

  • Holographic algorithms: From art to science

    Jin-Yi Cai;Pinyan Lu

  • Asymptotically optimal strategy-proof mechanisms for two-facility games

    Pinyan Lu;Xiaorui Sun;Yajun Wang;Zeyuan Allen Zhu

  • On the approximability of budget feasible mechanisms

    Ning Chen;Nick Gravin;Pinyan Lu

  • Graph Homomorphisms with Complex Values: A Dichotomy Theorem

    Jin-Yi Cai;Xi Chen;Pinyan Lu

  • Holant problems and counting CSP

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • Correlation decay up to uniqueness in spin systems

    Liang Li;Pinyan Lu;Yitong Yin

  • Tighter Bounds for Facility Games

    Pinyan Lu;Yajun Wang;Yuan Zhou

  • Holographic algorithms: from art to science

    Jin-Yi Cai;Pinyan Lu

  • Holographic Algorithms

    Unknown

  • On the Theory of Matchgate Computations

    Jin-Yi Cai;Vinay Choudhary;Pinyan Lu

  • Combinatorial multi-armed bandit with general reward functions

    Wei Chen;Wei Hu;Fu Li;Jian Li

  • Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • The complexity of complex weighted Boolean #CSP

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • Budget feasible mechanism design: from prior-free to bayesian

    Xiaohui Bei;Ning Chen;Nick Gravin;Pinyan Lu

  • Nonnegative Weighted #CSP: An Effective Complexity Dichotomy

    Jin-Yi Cai;Xi Chen;Pinyan Lu

  • Approximate counting via correlation decay in spin systems

    Liang Li;Pinyan Lu;Yitong Yin

  • Computational Complexity of Holant Problems

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • The Complexity of Symmetric Boolean Parity Holant Problems

    Heng Guo;Pinyan Lu;Leslie G. Valiant

  • Dichotomy for Holant problems of Boolean domain

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • An Algorithmic Framework for Approximating Maximin Share Allocation of Chores

    Xin Huang;Pinyan Lu

  • On Symmetric Signatures in Holographic Algorithms

    Jin-Yi Cai;Pinyan Lu

  • Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP

    Jin-Yi Cai;Pinyan Lu;Mingji Xia

  • A Dichotomy for Real Weighted Holant Problems

    Sangxia Huang;Pinyan Lu

  • Facility location games with fractional preferences

    Ken C.K. Fong;Minming Li;Pinyan Lu;Taiki Todo

  • From Holant to #CSP and Back: Dichotomy for Holantc Problems

    Jin-Yi Cai;Sangxia Huang;Pinyan Lu

Frequent Co-Authors

Jin-Yi Cai
Jin-Yi Cai University of Wisconsin–Madison
Xi Chen
Xi Chen Columbia University
Zeyuan Allen-Zhu
Zeyuan Allen-Zhu Meta Platforms, Inc.
Zheng Chen
Zheng Chen Microsoft Research Asia (China)
Richard J. Lipton
Richard J. Lipton Georgia Institute of Technology
Leslie Ann Goldberg
Leslie Ann Goldberg University of Oxford
Martin Dyer
Martin Dyer University of Leeds
Shang-Hua Teng
Shang-Hua Teng University of Southern California
Mark Jerrum
Mark Jerrum Queen Mary University of London
Leslie G. Valiant
Leslie G. Valiant Harvard University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options in Computer Science can open up flexible and affordable pathways to advance your education and career. For those seeking rapid professional growth, the quickest online masters degree programs offer accelerated learning, allowing you to earn your qualifications in less time.

Choosing the right degree is essential. Many students prioritize programs that offer strong job prospects. Check out the best masters degree to get for a competitive edge in tech-driven industries.

If you’re just starting out or want a more cost-effective introduction to computer science, consider enrolling in an associate's degree online. These programs provide foundational knowledge and can serve as a stepping stone to further study or immediate entry-level employment.

Online learning continues to grow in popularity, especially among students seeking value. Discover affordable online degree programs to help minimize student debt while earning a respected credential in computer science.

Best Scientists Citing Pinyan Lu

Trending Scientists

Recently Published Articles