.png){kind=icon}
.png){kind=icon}
Return
Efficient auctions
.png){kind=icon}
PRE
AI
DOI：10.1162/003355300554755.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We exhibit an efficient auction (an auction that maximizes surplus conditional on all available information). For private values, the Vickrey auction (for one good) or its Groves-Clarke extension (for multiple goods) is efficient. We show that the Vickrey and Groves-Clarke auctions can be generalized to attain efficiency when there are common values, if each buyer's information can be represented as a one-dimensional signal. When a buyer's information is multidimensional, no auction is generally efficient. Nevertheless, in a broad class of cases, our auction is constrained-efficient in the sense of being efficient subject to incentive constraints.
Keywords:
INFORMATION
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.7
Papers:
1.2K
Citations:
4.1W
Organization
No organization information available