4 citations · 5 across the 2 of their papers we have counts for
5 papers
Average-Case Subset Balancing Problems
Xi Chen, Yaonan Jin, Tim Randolph +1
Given a set of input integers, the Equal Subset Sum problem asks us to find two distinct subsets with the same sum. In this paper we present an algorithm that runs in time $O^*…
On Asymptotically Tight Tail Bounds for Sums of Geometric and Exponential Random Variables
Yaonan Jin, Yingkai Li, Yining Wang +1
In this note we prove bounds on the upper and lower probability tails of sums of independent geometric or exponentially distributed random variables. We also prove negative results…
Optimal Budget-Feasible Mechanisms for Additive Valuations
Nick Gravin, Yaonan Jin, Pinyan Lu +1
In this paper, we show a tight approximation guarantee for budget-feasible mechanisms with an additive buyer. We propose a new simple randomized mechanism with approximation ratio…
Tight Approximation Ratio of Anonymous Pricing
Yaonan Jin, Pinyan Lu, Qi Qi +2
We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, i…
Tight Revenue Gaps among Simple Mechanisms
Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang +1
We consider a fundamental problem in microeconomics: selling a single item to a number of potential buyers, whose values are drawn from known independent and regular (not necessari…