• Publications
  • Influence
On the approximability of budget feasible mechanisms
TLDR
We show a lower bound of 1 + √2 for the approximation ratio of deterministic mechanisms and 2 for randomized mechanisms for knapsack, as well as the general monotone submodular functions. Expand
  • 87
  • 14
  • PDF
Asymptotically optimal strategy-proof mechanisms for two-facility games
TLDR
We consider the problem of locating facilities in a metric space to serve a set of selfish agents. Expand
  • 123
  • 13
  • PDF
Holant problems and counting CSP
TLDR
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant Problems. Expand
  • 91
  • 11
Correlation Decay up to Uniqueness in Spin Systems
TLDR
We show that a two-state anti-ferromagnetic spin system exhibits strong spatial mixing on all graphs of maximum degree at most Δ if and only if the system has a unique Gibbs measure. Expand
  • 102
  • 11
  • PDF
Budget feasible mechanism design: from prior-free to bayesian
TLDR
Budget feasible mechanism design studies procurement combinatorial auctions in which the sellers have private costs to produce items, and the buyer (auctioneer) aims to maximize a social valuation function on subsets of items, under the budget constraint. Expand
  • 52
  • 9
  • PDF
Combinatorial Multi-Armed Bandit with General Reward Functions
TLDR
We study the stochastic combinatorial multi-armed bandit (CMAB) framework that allows a general nonlinear reward function, whose expected value may not depend only on the means of the input random variables but possibly on the entire distributions of these variables. Expand
  • 54
  • 8
  • PDF
A Dichotomy for Real Weighted Holant Problems
  • Sangxia Huang, P. Lu
  • Mathematics, Computer Science
  • IEEE 27th Conference on Computational Complexity
  • 1 March 2016
TLDR
Holant is a framework of counting characterized by local constraints. Expand
  • 38
  • 7
  • PDF
Tighter Bounds for Facility Games
TLDR
We study the approximation ratio of social welfare for strategy-proof mechanisms, where no agent can benefit by misreporting its location. Expand
  • 83
  • 6
  • PDF
The complexity of complex weighted Boolean #CSP
TLDR
We prove a complexity dichotomy theorem for the most general form of Boolean #CSP where every constraint function takes values in the field of complex numbers C. Expand
  • 50
  • 5
  • PDF
FPTAS for Counting Monotone CNF
  • J. Liu, P. Lu
  • Computer Science, Mathematics
  • SODA
  • 14 November 2013
TLDR
We design a deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of satisfying assignments for a given monotone CNF formula when each variable appears in at most 5 clauses. Expand
  • 31
  • 5
  • PDF
...
1
2
3
4
5
...