Publications (41)
Budget Feasible Mechanism Design: From Prior-Free to Bayesian
Xiaohui Bei, Ning Chen, Nick Gravin +1
Budget Feasible Mechanism Design via Random Sampling
Xiaohui Bei, Ning Chen, Nick Gravin +1
Counting independent sets and colorings on random regular bipartite graphs
Chao Liao, Jiabao Lin, Pinyan Lu +1
Tight Approximation Ratio of Anonymous Pricing
Yaonan Jin, Pinyan Lu, Qi Qi +2
The Complexity of Ferromagnetic Two-spin Systems with External Fields
Jingcheng Liu, Pinyan Lu, Chihao Zhang
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Approximability of the Eight-vertex Model
Jin-Yi Cai, Tianyu Liu, Pinyan Lu +1
An FPTAS for Counting Proper Four-Colorings on Cubic Graphs
Pinyan Lu, Kuan Yang, Chihao Zhang +1
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems
Jin-Yi Cai, Xi Chen, Heng Guo +1
Approximability of the Six-vertex Model
Jin-Yi Cai, Tianyu Liu, Pinyan Lu
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
Jin-Yi Cai, Sangxia Huang, Pinyan Lu
Optimal Pricing in Social Networks with Incomplete Information
Wei Chen, Pinyan Lu, Xiaorui Sun +3
Counting hypergraph colorings in the local lemma regime
Heng Guo, Chao Liao, Pinyan Lu +1
Canonical Paths for MCMC: from Art to Science
Lingxiao Huang, Pinyan Lu, Chihao Zhang
The complexity of approximating conservative counting CSPs
Xi Chen, Martin Dyer, Leslie Ann Goldberg +4
Mechanism Design without Money via Stable Matching
Ning Chen, Nick Gravin, Pinyan Lu
Non-negative Weighted #CSPs: An Effective Complexity Dichotomy
Jin-Yi Cai, Xi Chen, Pinyan Lu
A Family of Counter Examples to an Approach to Graph Isomorphism
Jin-Yi Cai, Pinyan Lu, Mingji Xia
FPTAS for Hardcore and Ising Models on Hypergraphs
Pinyan Lu, Kuan Yang, Chihao Zhang
FPTAS for #BIS with Degree Bounds on One Side
Jingcheng Liu, Pinyan Lu
FPTAS for Counting Monotone CNF
Jingcheng Liu, Pinyan Lu
On the Approximability of Budget Feasible Mechanisms
Ning Chen, Nick Gravin, Pinyan Lu
Dichotomy for Real Holant$^c$ Problems
Jin-Yi Cai, Pinyan Lu, Mingji Xia
Competitive analysis via benchmark decomposition
Ning Chen, Nick Gravin, Pinyan Lu
FPTAS for Weighted Fibonacci Gates and Its Applications
Pinyan Lu, Menghui Wang, Chihao Zhang
Combinatorial Multi-Armed Bandit with General Reward Functions
Wei Chen, Wei Hu, Fu Li +3
Graph Homomorphisms with Complex Values: A Dichotomy Theorem
Jin-Yi Cai, Xi Chen, Pinyan Lu
The Value of Information Concealment
Hu Fu, Chris Liaw, Pinyan Lu +1
Zeros of Holant problems: locations and algorithms
Heng Guo, Chao Liao, Pinyan Lu +1
Revenue Maximization with Imprecise Distribution
Yingkai Li, Pinyan Lu, Haoran Ye
Optimal Competitive Auctions
Ning Chen, Nick Gravin, Pinyan Lu
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
Pinyan Lu, Changyuan Yu
A Simple FPTAS for Counting Edge Covers
Chengyu Lin, Jingcheng Liu, Pinyan Lu
Competitive Auctions for Markets with Positive Externalities
Nick Gravin, Pinyan Lu
On Tractable Exponential Sums
Jin-Yi Cai, Xi Chen, Richard Lipton +1
Improved Efficiency Guarantees in Auctions with Budgets
Pinyan Lu, Tao Xiao
Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio
Minming Li, Pinyan Lu, Yuhao Yao +1
Zeros of ferromagnetic 2-spin systems
Heng Guo, Jingcheng Liu, Pinyan Lu
Approximate Counting via Correlation Decay in Spin Systems
Liang Li, Pinyan Lu, Yitong Yin
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
Heng Guo, Pinyan Lu
Dichotomy for Holant* Problems with a Function on Domain Size 3
Jin-Yi Cai, Pinyan Lu, Mingji Xia