Sequential First-Price Auction with Randomly Arriving Buyers

Shulin LIU, Xiaohu HAN

Journal of Systems Science and Information ›› 2018, Vol. 6 ›› Issue (1) : 29-34.

PDF(103 KB)
PDF(103 KB)
Journal of Systems Science and Information ›› 2018, Vol. 6 ›› Issue (1) : 29-34. DOI: 10.21078/JSSI-2018-029-06
 

Sequential First-Price Auction with Randomly Arriving Buyers

Author information +
History +

Abstract

In this paper we reanalyze Said’s (2011) work by retaining all his assumptions except that we use the first-price auction to sell differentiated goods to buyers in dynamic markets instead of the second-price auction. We conclude that except for the expression of the equilibrium bidding strategy, all the results for the first-price auction are exactly the same as the corresponding ones for the second-price auction established by Said (2011). This implies that the well-known "revenue equivalence theorem"holds true for Said’s (2011) dynamic model setting.

Key words

sequential first-price auction / sequential second-price auction / dynamic market / symmetric Markov equilibrium / the difference equation

Cite this article

Download Citations
Shulin LIU , Xiaohu HAN. Sequential First-Price Auction with Randomly Arriving Buyers. Journal of Systems Science and Information, 2018, 6(1): 29-34 https://doi.org/10.21078/JSSI-2018-029-06

1 Introduction

Sequential auctions have been long studied in the economics literature. The detailed review of most related works, such as Wolinsky[1], De Fraja and Sa´kovics[2], Satterthwaite and Shneyerov[3], can be found in [4]. This paper follows Said and use all his assumptions except that the first-price auction1 has been used to sell differentiated goods to buyers in dynamic markets in which the buyers and new goods arrive randomly to the market, instead of the second-price auctions. We do the same studies as Said did. We make comparison between our results and the corresponding ones obtained by [4]. Surprisingly, we find that the expected values to a buyer under both the first-price and the second-price auctions are the same. Therefore, under the model setting of Said's[4] the "revenue equivalence theorem" holds. The second-order nonhomogeneous linear difference equation with a boundary condition which the expected value to a buyer satisfies is exactly the same under these two types of auction formats. Thus, the unique symmetric Markov equilibrium under the first-price auction can be characterized by the identical explicit expression used by Said[4], since it is derived from the identical difference equation mentioned above.
1Albano and Spagnolo[5] indicated that sequential first-price auctions for multiple objects are very common in procurement, electricity, tobacco, timber, and oil lease markets.

2 Main Results

In order to facilitate the comparison between our results and the ones obtained by Said[4], we use the same notations as Said's[4] except for the notations with superscript of f for the first-price auction (which correspond to the notations without superscript of f for the second-price auction). For example, Vf(vit,n) denotes the maximum expected payoff to a buyer with valuation vit, which corresponds to V(vit,n) for the second-price auction. Other notations such as Wf(n) have the similar meanings.
We retain all the assumptions made by Said[4] except that we make the following two new assumptions.
Assumption Ⅰ We use the first-price auction to sell differentiated goods to buyers instead of the second-price auction used by Said[4].
Assumption Ⅱ Each buyer i{1,2,,n} has a private valuation vit for the object at time t, where vit is independently (across buyer i and period t) drawn from the distribution function F on [v_,v¯] with a continuous density function f and finite variance, v_ and v¯ are the lowest and highest possible valuations of a buyer, respectively.2
2Said[4] assumed that F was defined on R+ but integrate over (,) to compute the expectation with respect to vit (see his second lemma). We think that it is more suitable for us to define F on [v_,v¯]. We indicate that all the results obtained by Said[4] still apply for our Assumption Ⅱ.
Similar to Said[4], we have the expression of Wf(n) for all n2,
Wf(n)=pqE[Vf(vit,n+1)]+p(1q)E[Vf(vit,n)]+(1p)qδWf(n+1)+(1p)(1q)δWf(n),
(1)
since Wf(n) is relevant to the first-price auction.
Next let us consider the decision made by buyer i when there are n2 buyers on the market and an available object currently. This buyer, with valuation vit, must choose her bid bit to maximize her expected payoff. Under the first-price auction, she receives the payoff of vit less her bid bit with a winning probability of Pr(bit>maxji{bjt}). If she loses, she receives the payoff of δWf(n1) with a probability of Pr(bitmaxji{bjt}). Therefore,
Vf(vit,n)=maxbit{Pr(bit>maxji{bjt})(vitbit)+Pr(bitmaxji{bjt})δWf(n1)}.
(2)
Solving the optimization problem, we can determine the equilibrium bid function, as shown in the following Lemma 1.
Lemma 1 (Symmetric equilibrium bid strategy) In equilibrium, a buyer with a valuation of vit who is one of n2 bidders on the market bids bit=bf(vit,n), where
bf(vit,n)=vit1G1(n1)(vit)v_vitG1(n1)(x)dxδWf(n1),
(3)
and v_ is the bidder's lowest possible valuation.
Proof Note that, since Pr(bitmaxji{bjt})=1Pr(bit>maxji{bjt}), we may rewrite Vf(vit,n) as
Vf(vit,n)=maxbit{Pr(bit+C>maxji{bjt+C})[vit(bit+C)]}+C,
(4)
where C=δWf(n1). Furthermore, setting dit=bit+C yields
Vf(vit,n)=maxdit{Pr(dit>maxji{djt})(vitdit)}+C.
(4')
Denote the optimal solution (the symmetric equilibrium bid) of Equation (4) by D(vit,n). If a buyer has the lowest possible valuation v_, then her surplus is zero, implying D(v_,n)=v_. Then, we get a standard first-price auction model. By applying Equation (5) in McAfee and McMillan[6], we have
D(vit,n)=vit1G1(n1)(vit)v_vitG1(n1)(x)dx.
Since dit=bit+C, the symmetric equilibrium bid can be obtained from Equation (4), denoted by bf(vit,n), it is given by Equation (3). The proof of Lemma 1 is completed.
Based on Lemma 1, we can obtain the expected equilibrium payoff to a buyer from an auction with n2 participants, which is parallel to the second lemma in [4] and shown below as Lemma 2.
Lemma 2 (Expected equilibrium payoff) The expected payoff to a buyer from an auction with n2 participants is
E[Vf(vit,n)]=Y~f(n)+δWf(n1),
(5)
where Yf(n)=v_v¯[G1(n1)(x)G1(n)(x)]dx.
Proof We substitute the symmetric equilibrium strategy Equation (3) into Equation (4). Since
Pr(bf(vit,n)+C>maxji{bf(vjt,n)+C})=Pr(bf(vit,n)>maxji{bf(vjt,n)})=Pr(vit>maxji{vjt})=G1(n1)(vit),
we have
Vf(vit,n)=v_vitG1(n1)(x)dx+δWf(n1).
Thus,
E[Vf(vit,n)]=v_v¯[f(vit)v_vitG1(n1)(x)dx]dvitchangetheorderofintegral+δWf(n1)=v_v¯[G1(n1)(x)xv¯f(vit)dvit]dx+δWf(n1)=v_v¯G1(n1)(x)[1F(x)]dx+δWf(n1)=v_v¯[G1(n1)(x)G1(n)(x)]dx+δWf(n1)=Y~f(n)+δWf(n1).
The proof of Lemma 2 is completed.
By substituting Equation (5) into Equation (1) and then solving for Wf(n+1) in terms of Wf(n) and Y~f(n) alone, we have
Wf(n+1)=1pqδ(1p)(1q)δδ(1p)qaWf(n)p(1q)(1p)qbWf(n1)pδ(1p)cY~f(n+1)p(1q)δ(1p)qdY~f(n).
(6)
From the assumption that this arrival occurs immediately and with probability 1 if there is only a single buyer remaining on the market from previous periods --- There are always at least two buyers present, we have q=1 when n=1. Therefore, setting n=1 in Equation (1) yields Wf(1)=pE[Vf(vit,2)]+(1p)δWf(2)). Recalling by Equation (5), we have Wf(1)=p(Y~f(2)+δWf(1))+(1p)δWf(2). Solving for Wf(1) yields
Wf(1)=p1δpeY~f(2)+(1p)δ1δpfWf(2).
(7)
A solution to the second-order nonhomogeneous linear difference equation Equation (6) with the boundary condition Equation (7) gives the expected value of buyer. While one could solve this system, the continuous time limit is significantly more tractable. Recalling that δ=eηΔ,p=λΔ, and q=ρΔ and taking the limits of Equation (6) and Equation (7) as the period length Δ goes to zero, for n2, yield3
Wf(n+1)=η+λ+ρρWf(n)λρWf(n1)λρY~f(n)andWf(1)=Wf(2).
(8)
3The limits of coefficients of a,b,c,d,e,f are shown in the appendix.
Theorem 1 The expected value for the buyer under the first-price auction is exactly the same as that under the second-price auction, namely, Wf(n)=W(n).
Proof According to Said[4], W(n) is a solution to the following nonhomogeneous linear difference equation
W(n+1)=η+λ+ρρW(n)λρW(n1)λρY~(n)andW(1)=W(2).
(9)
From Said[4], we have Y~(n)=E[Y1(n)]E[Y1(n1)]. From Lemma 2, we have
Y~f(n)=v_v¯[G1(n1)(x)G1(n)(x)]dx=[G1(n1)(x)G1(n)(x)]xv_v¯v_v¯xd[G1(n1)(x)G1(n)(x)]=v_v¯xdG1(n1)(x)+v_v¯xdG1(n)(x)=E[Y1(n)]E[Y1(n1)].
Therefore, Y~f(n)=Y~(n). It follows from Equation (8) and Equation (9) that we have Wf(n)=W(n).
Since the nonhomogeneous linear difference equation for the first-price auction Equation (8) is exactly the same as that for the second-price auction Equation (9), we can use the identical expected value functions of Equation (8) and Equation (9) given by Said[4] to characterize the unique symmetric Markov equilibrium of the infinite horizon first-price sequential auction game. Namely, under the first-price auction we have exactly the same Theorem and Corollary given by Said[4].
Recalling Equation (5) and Theorem 1, we have the following corollary easily.
Corollary 1 The expected payoff of a buyer is identical under the first and second price auctions. Namely, E[Vf(vit,n)]=E[V(vit,n)].

3 Conclusion

Under Said's[4] dynamic model setting, we use the first-price auction to sell the goods instead of the second-price auction used by Said's[4]. We find the symmetric equilibrium bid strategy, the expected equilibrium payoff, and the expected equilibrium value. By making comparison between our results and the corresponding results obtained by Said's[4], we find that except for the expressions of the equilibrium bids, all the remaining results for the first-price auction (mentioned above) are the same as those for the second-price auction. This implies that the traditional "revenue equivalence theorem'' also applies to Said's[4] dynamic model setting.

Appendix

Recalling that δ=eηΔ,p=λΔ, and q=ρΔ, we can find the limits of a,b,c,d,e, and f defined in Equation (6) and Equation (7) as Δ goes to zero, as shown below
limΔ0a=limΔ01pqδ(1p)(1q)δ(1p)qδ=limΔ01λρΔ2eηΔ(1λΔ)(1ρΔ)eηΔ(1λΔ)ρΔeηΔ=limΔ01eηΔ(1λΔ)ρΔeηΔlimΔ0λρΔ2eηΔ+eηΔ(λΔρΔ+λρΔ2)(1λΔ)ρΔeηΔ=limΔ0η(1λΔ)ρeηΔlimΔ0λρΔ+(λρ+λρΔ)(1λΔ)ρ=η+λ+ρρ.
limΔ0b=limΔ0p(1q)(1p)q=limΔ0λΔ(1ρΔ)(1λΔ)ρΔ=limΔ0λ(1ρΔ)(1λΔ)ρ=λρ.limΔ0c=limΔ0pδ(1p)=limΔ0λΔeηΔ(1λΔ)=01=0.limΔ0d=limΔ0p(1q)δ(1p)q=limΔ0λΔ(1ρΔ)eηΔ(1λΔ)ρΔ=limΔ0λ(1ρΔ)eηΔ(1λΔ)ρ=λρ.   limΔ0e=limΔ0p1δp=limΔ0λΔ1eηΔλΔ=01=0.limΔ0f=limΔ0(1p)δ1δp=limΔ0(1λΔ)eηΔ1eηΔλΔ=11=1.

References

1
Wolinsky A. Dynamic markets with competitive bidding. Review of Economic Studies, 1988, 55 (55): 71- 84.
2
De Fraja G, Sakovics J. Walras retrouve. Journal of Political Economy, 2004, 109 (4): 842- 863.
3
Satterthwaite M, Shneyerov A. Convergence to perfect competition of a dynamic matching and bargaining market with two-sided incomplete information and exogenous exit rate. Game and Economic Behavior, 2008, 63, 435- 467.
4
Said M. Sequential auctions with randomly arriving buyers. Games and Economic Behavior, 2011, 73 (1): 236- 243.
5
Albano G L, Spagnolo G. Collusive drawbacks of sequential auctions. Journal of Public Procurement, 2011, 11, 139- 170.
6
McAfee R P, McMillan J. Auctions and bidding. Journal of Economic Literature, 1987, 25 (2): 699- 738.

Acknowledgements

The authors gratefully acknowledge the Editor and two anonymous referees for their insightful comments and helpful suggestions that led to a marked improvement of the article.

Funding

the National Natural Science Foundation of China(71171052)
PDF(103 KB)

201

Accesses

0

Citation

Detail

Sections
Recommended

/