English

Improved Efficiency Guarantees in Auctions with Budgets

Computer Science and Game Theory 2015-02-16 v3

Abstract

We study the efficiency guarantees in the simple auction environment where the auctioneer has one unit of divisible good to be distributed among a number of budget constrained agents. With budget constraints, the social welfare cannot be approximated by a better factor than the number of agents by any truthful mechanism. Thus, we follow a recent work by Dobzinski and Leme (ICALP 2014) to approximate the liquid welfare, which is the welfare of the agents each capped by her/his own budget. We design a new truthful auction with an approximation ratio of 5+121.618\frac{\sqrt{5}+1}{2} \approx 1.618, improving the best previous ratio of 22 when the budgets for agents are public knowledge and their valuation is linear (additive). In private budget setting, we propose the first constant approximation auction with approximation ratio of 3434. Moreover, this auction works for any valuation function. Previously, only O(logn)O(\log n) approximation was known for linear and decreasing marginal (concave) valuations, and O(log2n)O(\log^2 n) approximation was known for sub-additive valuations.

Keywords

Cite

@article{arxiv.1407.8325,
  title  = {Improved Efficiency Guarantees in Auctions with Budgets},
  author = {Pinyan Lu and Tao Xiao},
  journal= {arXiv preprint arXiv:1407.8325},
  year   = {2015}
}

Comments

Strengthened results in private budget setting, in which our auction can work on any valuation function and guarantees a constant approximation ratio

R2 v1 2026-06-22T05:17:23.829Z