2014
DOI: 10.1016/b978-0-444-52980-0.00002-5
|View full text |Cite
|
Sign up to set email alerts
|

On the Numerical Solution of Equilibria in Auction Models with Asymmetries within the Private-Values Paradigm

Abstract: We describe and compare numerical methods used to approximate equilibrium bid functions in models of auctions as games of incomplete information. In such games, private values are modelled as draws from bidder-specific type distributions and pay-your-bid rules are used to determine transactions prices. We provide a formal comparison of the performance of these numerical methods (based on speed and accuracy) and suggest ways in which they can be improved and extended as well as applied to new settings.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 28 publications
(18 citation statements)
references
References 55 publications
0
18
0
Order By: Relevance
“…Also, a supplier with logistics facilities in a given area may find some increasing returns-to-scale in awarding several units in the auction. Such asymmetries among bidders create the conditions for what the literature refers as asymmetric auctions (Hubbard and Paarsch 2014;Maskin and Riley 2000).…”
Section: Introductionmentioning
confidence: 99%
“…Also, a supplier with logistics facilities in a given area may find some increasing returns-to-scale in awarding several units in the auction. Such asymmetries among bidders create the conditions for what the literature refers as asymmetric auctions (Hubbard and Paarsch 2014;Maskin and Riley 2000).…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, similarly to the original bidding problem, the closed-form solution exists only in a limited number of special cases [9], [12]. However, as presented by Hubbard and Paarsch [9], there exist well-defined numerical methods which can be used to solve it.…”
Section: Auction With Common Priormentioning
confidence: 99%
“…Due to the nature of the problem, however, the algorithms handle only a subset of all cases such that the lower boundary condition (4) is reduced toĉ i (b) =ĉ i . It is the purpose of this paper to address this deficiency by casting the bidding problem into a simpler setting of common prior (CP) for which there exists a plethora of numerical solutions that are well-researched and well-defined [9].…”
Section: Bidding Problem In the Digital Marketplacementioning
confidence: 99%
See 1 more Smart Citation
“…In other words, the outcomes at sealed, pay-yourbid and oral, descending-price auctions can be inefficient. In general, however, except by using the numerical methods described in Timothy P. Hubbard and Paarsch [2014], few predictions concerning the expected-revenue ranking of the different auction formats and pricing rules exist, which makes structural econometric empirical work especially important.…”
Section: Introductionmentioning
confidence: 99%