S
Zodix
Study
Academic Library
Search
Shelves
Open access
Sign in
Search or jump to…
⌘K
Pinyan Lu · Study
Home
/
Author
Pinyan Lu
14 works
· latest 2021
· 4 institutions
cluster: provisional
ORCID 0009-0005-0569-4122
Follow
Suggest an ORCID correction
h-index
14
i10
14
Citations
870
Works here
14
08
09
10
11
12
14
16
18
19
21
Most cited in this library
Asymptotically optimal strategy-proof mechanisms for two-facility games
2010 · 174 citations
Tighter Bounds for Facility Games
2009 · 111 citations
On the approximability of budget feasible mechanisms
2011 · 94 citations
Combinatorial Multi-Armed Bandit with General Reward Functions
2016 · 85 citations
On the Approximability of Budget Feasible Mechanisms
2011 · 77 citations
Works
14 shown
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
ACM Conference on Economics and Computation (EC)
·
2021
·
2 authors
·
other
·
Open access
49
citations
Tight approximation ratio of anonymous pricing
ACM Symposium on Theory of Computing (STOC)
·
2019
·
5 authors
·
other
24
citations
Separation in Correlation-Robust Monopolist Problem with Budget
Society for Industrial and Applied Mathematics eBooks
·
2018
·
2 authors
·
other
24
citations
Combinatorial Multi-Armed Bandit with General Reward Functions
arXiv (Cornell University)
·
2016
·
6 authors
·
preprint
·
Open access
85
citations
Optimal competitive auctions
ACM Symposium on Theory of Computing (STOC)
·
2014
·
3 authors
·
other
·
Open access
36
citations
Budget feasible mechanism design
ACM Symposium on Theory of Computing (STOC)
·
2012
·
4 authors
·
other
44
citations
Budget Feasible Mechanism Design: From Prior-Free to Bayesian
arXiv (Cornell University)
·
2012
·
4 authors
·
preprint
·
Open access
59
citations
On the approximability of budget feasible mechanisms
·
2011
·
3 authors
·
Open access
94
citations
On the Approximability of Budget Feasible Mechanisms
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
2011
·
3 authors
·
other
77
citations
Optimal Pricing in Social Networks with Incomplete Information
Lecture notes in computer science
·
2011
·
6 authors
·
other
·
Open access
28
citations
Asymptotically optimal strategy-proof mechanisms for two-facility games
ACM Conference on Electronic Commerce (EC)
·
2010
·
4 authors
·
other
174
citations
Tighter Bounds for Facility Games
Lecture notes in computer science
·
2009
·
3 authors
·
other
111
citations
On 2-Player Randomized Mechanisms for Scheduling
Lecture notes in computer science
·
2009
·
1 author
·
other
26
citations
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
arXiv (Cornell University)
·
2008
·
1 author
·
preprint
·
Open access
39
citations