2010
DOI: 10.1007/s00199-010-0563-9
|View full text |Cite
|
Sign up to set email alerts
|

Asymmetric first-price auctions with uniform distributions: analytic solutions to the general case

Abstract: We provide analytic solutions for any asymmetric …rst-price auction, both with and without a minimum bid m, for two buyers having

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
39
0

Year Published

2012
2012
2016
2016

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 78 publications
(39 citation statements)
references
References 25 publications
0
39
0
Order By: Relevance
“…We can then define C L ( b ) and C H ( b ) as the respective inverse bid functions with supports ][b̲L,truebfalse¯L and ][b̲H,truebfalse¯H, where these intervals denote the range of bids for which someone wins the auction with positive probability as in Kaplan and Zamir (). It is straightforward to extend Lemma 4 of Kaplan and Zamir () to the LLH and LHH cases to show that both inverse functions share the same upper support which we define as truebfalse¯. However, it is not necessary for both types to share the same lower support in the LLH composition as the two low‐cost types may be incentivized to bid below c̲H when competing against each other.…”
Section: Equilibrium Bidding Strategies and Ex Ante Predictionsmentioning
confidence: 99%
See 1 more Smart Citation
“…We can then define C L ( b ) and C H ( b ) as the respective inverse bid functions with supports ][b̲L,truebfalse¯L and ][b̲H,truebfalse¯H, where these intervals denote the range of bids for which someone wins the auction with positive probability as in Kaplan and Zamir (). It is straightforward to extend Lemma 4 of Kaplan and Zamir () to the LLH and LHH cases to show that both inverse functions share the same upper support which we define as truebfalse¯. However, it is not necessary for both types to share the same lower support in the LLH composition as the two low‐cost types may be incentivized to bid below c̲H when competing against each other.…”
Section: Equilibrium Bidding Strategies and Ex Ante Predictionsmentioning
confidence: 99%
“…However, it is not necessary for both types to share the same lower support in the LLH composition as the two low‐cost types may be incentivized to bid below c̲H when competing against each other. Following Appendices A.2 and A.3 of Kaplan and Zamir (), the upper boundary conditions for each type are CHtruebfalse¯=b¯ and CLtruebfalse¯=truecfalse¯L=20. From these conditions, we can derive truebfalse¯ in each case.…”
Section: Equilibrium Bidding Strategies and Ex Ante Predictionsmentioning
confidence: 99%
“…Notice that, in our setting, the supports of effective cost distributions are naturally different for contractors with different backlog levels. We adjust the standard argument (see Kaplan and Zamir, ), accounting for the all‐pay component in order to obtain the boundary condition for our optimization program. More specifically, without loss of generality, assume that trueφ¯1trueφ¯2 .…”
Section: Equilibrium Characterizationmentioning
confidence: 99%
“…For example, Kaplan and Zamir (2012) provide explicit forms of the equilibrium bid functions in an asymmetric first-price auction with two buyers whose values v 1 and v 2 are uniformly distributed in [v 1 , v 1 ] and [v 2 , v 2 ], respectively. However, an explicit expression of the BNE is mathematically hard to obtain and so far it is available only for simple models, subject to highly restrictive assumptions.…”
Section: First-price Auctions: Theoretical Advancesmentioning
confidence: 99%
“…These were fromGriesmer et al (1967). Also, seeKaplan and Zamir (2012) for the general solution to the uniform case. 20 See Section 7.2.5 for examples byMaskin and Riley (2000a) where the revenue between a first-price auction and a second-price auction can be ordered in either way.…”
mentioning
confidence: 99%