2006
DOI: 10.1257/aer.96.3.602
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Dynamic Auction for Heterogeneous Commodities

Abstract: This article proposes a new dynamic design for auctioning multiple heterogeneous commodities. An auctioneer wishes to allocate K types of commodities among n bidders. The auctioneer announces a vector of current prices, bidders report quantities demanded at these prices, and the auctioneer adjusts the prices. Units are credited to bidders at the current prices as their opponents' demands decline, and the process continues until every commodity market clears. Bidders, rather than being assumed to behave as pric… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
263
0
2

Year Published

2007
2007
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 223 publications
(267 citation statements)
references
References 27 publications
2
263
0
2
Order By: Relevance
“…We take as our primary motivation the well-known fact that a VCG outcome may not be a core outcome, and thus may be considered "socially unacceptable," and unfit for an auction of public goods. Consider the following three-bidder, two-item example from Ausubel (2006)…”
Section: Bidder-pareto-optimal Core Mechanismsmentioning
confidence: 99%
“…We take as our primary motivation the well-known fact that a VCG outcome may not be a core outcome, and thus may be considered "socially unacceptable," and unfit for an auction of public goods. Consider the following three-bidder, two-item example from Ausubel (2006)…”
Section: Bidder-pareto-optimal Core Mechanismsmentioning
confidence: 99%
“…They prove through a salary adjustment process that there exists an equilibrium, if every firm views all workers as substitutes. This latter condition is called gross substitutes and has been widely used in auction, matching and housing models, see for instance, Roth and Sotomayor (1990), Stacchetti (1999, 2000), Milgrom (2000), Ausubel (2006), Sun and Yang (2006), and Ostrovsky (2008). This paper presents a new model, the partnership formation problem that subsumes and extends the assignment models studied by Koopmans and Beckmann (1957), Shapley and Shubik (1972), and Crawford and Knoer (1981).…”
mentioning
confidence: 99%
“…Let W NE denote the set of all NEPs for the game, with strategy space W and payoff functions given by (13), induced by the VCG-Kelly mechanism. Our main theorem on the existence and efficiency of NEPs is the following.…”
Section: Special Buyers Assumptionmentioning
confidence: 99%
“…The mechanism of [12] can be viewed as an instance of the VCG-Kelly mechanism, but for two-parameter surrogate functions. The recent paper of Ausubel [13] describes an allocation mechanism which is a generalization of ascending price auctions, which can provide efficient allocation using one dimensional bids for the allocation problem we address, but the payments are computed by integrating over price trajectories.…”
Section: Introductionmentioning
confidence: 99%