Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

FOCS
2008
IEEE

favoriteEmaildiscussreport

103views Theoretical Computer Science» more FOCS 2008»

Multi-unit Auctions with Budget Limits

13 years 11 months ago

Multi-unit Auctions with Budget Limits

Download www.eecs.harvard.edu

We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory literature. Our main result is an impossibility: there are no incentive-compatible auctions that always produce a Pareto-optimal allocation. We also obtain some surprising positive results for certain special cases. JEL Classiﬁcation Numbers: C70, D44, D82

Shahar Dobzinski, Ron Lavi, Noam Nisan

Real-time Traffic

Auction Theory Literature | FOCS 2008 | JEL Classiﬁcation Numbers | Multi-unit Auctions | Theoretical Computer Science |

claim paper

Related Content

» Bidding Strategies for Realistic MultiUnit SealedBid Auctions

» An Optimal MultiUnit Combinatorial Procurement Auction with Single Minded Bidders

» An Algorithm for MultiUnit Combinatorial Auctions

» A qualitative vickrey auction

» Bid optimization for broad match ad auctions

» Wireless channel allocation using an auction algorithm

» Dynamics of bid optimization in online advertisement auctions

» Fair access to scarce resources in adhoc grids using an economicbased approach

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	FOCS
Authors	Shahar Dobzinski, Ron Lavi, Noam Nisan

Comments (0)