Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Inefficiency of the Uniform Price Auction (1211.1860v4)

Published 8 Nov 2012 in cs.GT

Abstract: We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient multi-unit Vickrey auction, the Uniform Price Auction encourages strategic bidding and is socially inefficient in general. The uniform pricing rule is, however, widely popular by its appeal to the natural anticipation, that identical items should be identically priced. In this work we study equilibria of the Uniform Price Auction for bidders with (symmetric) submodular valuation functions, over the number of units that they win. We investigate pure Nash equilibria of the auction in undominated strategies; we produce a characterization of these equilibria that allows us to prove that a fraction 1-1/e of the optimum social welfare is always recovered in undominated pure Nash equilibrium -- and this bound is essentially tight. Subsequently, we study the auction under the incomplete information setting and prove a bound of 4-2/k on the economic inefficiency of (mixed) Bayes Nash equilibria that are supported by undominated strategies.

Summary

We haven't generated a summary for this paper yet.