Abstract
We consider multi-unit discriminatory auctions where ex ante symmetric bidders have single-unit demands and resale is allowed after the bidding stage. When bidders use the optimal auction to sell items in the resale stage, the equilibrium in the auction without resale is no longer an equilibrium in an auction with resale. We find a symmetric and monotone equilibrium when there are two units for sale, and, interestingly, we show that there may not be a symmetric and monotone equilibrium if there are more than two units.
Similar content being viewed by others
Notes
The auctioneer of our model sells units via discriminatory price auctions that have no minimum prices (reserve prices) on units. In the resale stage, we assume that resellers can use optimal mechanisms. Hence, they can use reserve prices.
More specifically, one might think that adding a resale stage to this setup should not alter the equilibrium outcome; all winners have higher valuations than all losers, and so there would be no incentive for resale. We show that this intuition is incorrect: when resale is allowed and resellers have all the bargaining power and can design any mechanism to sell the items, then the equilibrium of the auction without resale, which is symmetric, monotone and efficient, is no longer an equilibrium (Proposition 1). This is because a low-value bidder would act as if she was a high-value bidder and won items to resell them after auction stage.
We are grateful to an anonymous referee for this line of arguments.
These conditions depend on the number of regular bidders and value distribution. For instance, when value distribution is uniform, speculators do not play an active role. In our paper, in contrast, speculative behavior always exists. To the best of our knowledge, Garratt and Troger (2006) are the first to point out that speculation can affect equilibrium behavior in single-unit auctions. We further advance research on this topic by analyzing how speculation affects equilibrium behavior in multi-unit auctions. The main difference between Garratt and Troger (2006) and our paper is that, in Garratt and Troger (2006), there is asymmetric speculation as only special agents called speculators could speculate, whereas in our paper all agents can speculate.
Myerson’s regularity assumption, \(\psi ' \left( x\right) >0 \), is satisfied by many distributions and is commonly made in auction theory and mechanism design literature.
Revealing information about winning bids does not alter results. This is because the winner (reseller) already knows her value and bid while choosing the optimal reserve price. Not revealing information about the losing bids, however, is crucial for our results. The effects of revealing or partially revealing information on bids is beyond the scope of this paper. See Hafalir and Krishna (2008), who argue that there is no symmetric and monotone equilibrium in single-unit first-price auctions with resale when the losing bid is announced. Also see the discussion by Calzolari and Pavan (2006) of a monopolist who optimally designs beliefs in the resale market by partially revealing information to maximize revenue.
The optimal auction is to run a second-price auction with a reserve price \( \frac{z}{2}.\) Then, with probability \(\frac{1}{2},\) the object will be sold at the reserve price, and when the object is sold higher than the reserve price (with probability \(\frac{1}{4}\)) the expected selling price is \(\frac{2}{3}z\) (the expectation of second highest of two random variables uniformly distributed between \(\frac{z}{2}\) and z). Hence, the optimal revenue is \(\frac{1}{2} \times \frac{z}{2}+\frac{1}{4}\times \frac{2z}{3}=\frac{5}{12}z.\)
The optimal auction allocates the object to the bidder who has the highest (positive) virtual value. As it is established in Equation (5.16) in Section 13.5.2 of Krishna (2002), the maximized value of expected revenue is given by the expectation of highest of virtual values and 0.
We generalize this result for a power distribution, \(F(x)=x^a\), in the Online Appendices.
To see the first claim, suppose that \(\beta \left( 0\right) > 0\), then there exists \(\varepsilon \) such that \(\beta \left( \varepsilon \right) > \varepsilon \), and there is a strictly positive probability that the agent with \(\varepsilon \) value will get the unit at price \(\beta \left( \varepsilon \right) > \varepsilon \) while not being able to sell the unit to higher value agents in a symmetric equilibrium. This agent would make a negative payoff, which gives a contradiction. To see the second claim, suppose that \(\beta (x)=c\) for all \(x \in [a,b]\) for some \(a>b\). Then, for any bidder with value \(x \in [a,b]\), by bidding c, there is a strictly positive probability of a tie. Moreover, (i) in case of a tie she will get the object with \(\frac{1}{2}\) or \(\frac{1}{3}\) probability, and (ii) her expected utility for this case has to be positive. Next, one can argue that bidding \(c+\varepsilon \) for a small enough \(\varepsilon \) rather than c would strictly increase her expected utility. This occurs because with this deviation, she increases her chance of winning (for the cases where there was a tie) from \(\frac{1}{2}\) or \(\frac{1}{3}\) to 1. Hence, we reach a contradiction.
The optimal mechanism is a uniform-price auction with a reserve price \(\frac{v}{2}\) when there is one unit to be sold to two bidders whose valuations are uniformly distributed in [0, v]. Therefore, the revenue is \(2\times \frac{1}{2}\times \frac{1}{2}\times \frac{v}{2}+\frac{1}{2}\times \frac{1}{2}\times \frac{2v}{3}=\frac{5}{12}v \).
The variables in integrals k, l, m denote the realizations for the highest, the second highest, and the third highest values among the competitors. The first term in the summation represents the case in which the bidder with value x pays the third highest value, and the last term represents the case in which the bidder with value x pays the reserve price.
The proof in Reny (2011) is done by appealing to Remark 3.1 in Reny (1999) and showing that this game is “better-reply secure”. From the extensions of Reny (2011), one may conjecture that if a game (i) is symmetric, (ii) is better-reply secure, and (iii) satisfies G.1–G.5, then there exists a symmetric monotone equilibrium. However, this conjecture is wrong because our game can be shown to be better-reply secure.
We are grateful to an anonymous referee for raising this point.
The optimal mechanism is a uniform-price auction (where the price is the highest of the highest loser’s bid and the reserve price) with reserve price \(\frac{v}{2}\) when there are two units to be sold to three bidders whose valuations are uniformly distributed in [0, v]. Therefore, the revenue is \(\frac{3}{8}\times \frac{v}{2}+\frac{3}{8}\times 2\times \frac{v}{2}+\frac{1}{ 8}\times 2\times \frac{5v}{8}=\frac{23}{32}v\).
The optimal mechanism is a uniform-price auction with reserve price \(\frac{v}{2}\) when there is one unit to be sold to two bidders whose valuations are uniformly distributed in [0, v]. Therefore, the revenue is \(2\times \frac{1}{2}\times \frac{1}{2}\times \frac{v}{2}+\frac{1}{2}\times \frac{1}{2}\times \frac{2v}{3}=\frac{5}{12}v \).
References
Athey, S.: Single crossing properties and the existence of pure strategy equilibria in games of incomplete information. Econometrica 69(4), 861–889 (2001)
Ausubel, L.M., Cramton, P., Pycia, M., Rostek, M., Weretka, M.: Demand reduction and inefficiency in multi-unit auctions. Rev. Econ. Stud. 81(4), 1366–1400 (2014)
Bukhchandani, S., Huang, C.-F.: Auctions with resale markets: an exploratory model of treasury bill markets. Rev. Fin. Stud.es 2(3), 311–339 (1989)
Calzolari, G., Pavan, A.: Monopoly with resale. RAND J. Econ. 37(2), 362–375 (2006)
Cheng, H.: Auctions with resale and bargaining power. J. Math. Econ. 47(3), 300–308 (2011)
Cheng, H., Tan, G.: Asymmetric common-value auctions with applications to private-value auctions with resale. Econ. Theory 45(1–2), 253–290 (2010)
Dworczak, P.: The Effects of Post-Auction Bargaining between Bidders, Stanford University working paper (2015)
Engelbrecht-Wiggans, R., Kahn, C.M.: Multi-unit auctions with uniform prices. Econ. Theory 12(2), 227–258 (1998a)
Engelbrecht-Wiggans, R., Kahn, C.M.: Multi-unit pay-your-bid auctions with variable awards. Games Econ. Behav. 23(1), 25–42 (1998b)
Filiz-Ozbay, E., Lopez-Vargas, K., Ozbay, E.Y.: Multi-object auctions with resale: theory and experiment. Games Econ. Behav. 89, 1–16 (2015)
Garratt, R.J., Troger, T., Zheng, C.Z.: Collusion via resale. Econometrica 77(4), 1095–1136 (2009)
Garratt, R., Troger, T.: Speculation in standard auctions with resale. Econometrica 74(3), 753–769 (2006)
Gupta, M., Lebrun, B.: First price auctions with resale. Econ. Lett. 64(2), 181–185 (1999)
Hafalir, I., Krishna, V.: Asymmetric auctions with resale. Am. Econ. Rev. 98(1), 87–112 (2008)
Hafalir, I., Krishna, V.: Revenue and efficiency effects of resale in first-price auctions. J. Math. Econ. 45(9–10), 589–602 (2009)
Haile, P.A.: Partial pooling at the reserve price in auctions with resale opportunities. Games Econ. Behav. 33(2), 231–248 (2000)
Haile, P.A.: Auctions with resale markets: an application to U.S. forest service timber sales. Am. Econ. Rev. 91(3), 399–427 (2001)
Haile, P.A.: Auctions with private uncertainty and resale opportunities. J. Econ. Theory 108(1), 72–110 (2003)
Krishna, V.: Auction Theory. Elsevier Science, Academic, San Diego (2002)
Lebrun, B.: First-price auctions with resale and with outcomes robust to bid disclosure. RAND J. Econ. 41(1), 165–178 (2010)
McAdams, D.: Isotone equilibrium in games of incomplete information. Econometrica 71(4), 1191–1214 (2003)
Milgrom, P., Weber, R.J.: A theory of auctions and competitive bidding, ii. Econ. Theory Auct. 2, 179–194 (2000)
Noussair, C.: Equilibria in a multi-object uniform price sealed bid auction with multi-unit demands. Econ. Theory 5(2), 337–351 (1995)
Pagnozzi, M.: Bidding to lose? Auctions with resale. RAND J. Econ. 38(4), 1090–1112 (2007)
Pagnozzi, M.: Are speculators unwelcome in multi-object auctions? Am. Econ. J. Microecon. 2(2), 97–131 (2010)
Pagnozzi, M., Saral, K.J.: Multi-object Auctions with Resale: an Experimental Analysis. MPRA Paper 43665, University Library of Munich, Germany (2013)
Reny, P.J.: On the existence of pure and mixed strategy nash equilibria in discontinuous games. Econometrica 67(5), 1029–1056 (1999)
Reny, P.J.: On the existence of monotone pure-strategy equilibria in Bayesian games. Econometrica 79(2), 499–553 (2011)
Saral, K.J.: Speculation and demand reduction in english clock auctions with resale. J. Econ. Behav. Org. 84(1), 416–431 (2012)
Virag, G.: First-price auctions with resale: the case of many bidders. Econ. Theory 52(1), 129–163 (2013)
Xu, X., Levin, D., Ye, L.: Auctions with entry and resale. Games Econ. Behav. 79, 92–105 (2013)
Zheng, C.Z.: Optimal auction with resale. Econometrica 70(6), 2197–2224 (2002)
Zheng, C.Z.: Existence of Monotone Equilibria in First-price Auctions with Resale. Working paper (2014)
Acknowledgements
We are very grateful and deeply indebted to Vijay Krishna for his contributions to an earlier version of this paper. We also thank Christoph Mueller and Gabor Virag for valuable discussion and anonymous reviewers for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Hafalir acknowledges financial support from National Science Foundation Grant SES-1326584.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Appendix
Appendix
Proof of Proposition 1
The proof follows from an argument that is similar to the one made in Example 1. Suppose every bidder other than bidder 1 uses the no resale equilibrium strategy. Consider bidder 1 with value 1 and the alternative strategy \(\left( \beta _{1}^{N}\left( 1\right) ,\beta _{1}^{N}\left( 1\right) ,0,\ldots ,0\right) \) (similar strategies can be found for other values in \(\left( 0,1\right) \)). With this strategy, this bidder will receive two units. She can sell the second unit using a second-price auction with a reserve price \(\frac{1}{2} ,\) which gives her an expected revenue that is strictly higher than \(\mathbb {E}\left[ Y_{k}^{\left( n-1\right) }\right] \). This is because \(\mathbb {E}\left[ Y_{k}^{\left( n-1\right) }\right] \) is the expected revenue of the second-price auction with no reserve price, and the expected revenue of a second-price auction with optimal reserve price is strictly higher than that. Since this bidder has paid \(\mathbb {E}\left[ Y_{k}^{\left( n-1\right) }\right] \) for the second unit and gets strictly more than \(\mathbb {E}\left[ Y_{k}^{\left( n-1\right) }\right] \) in the resale stage, this deviation strictly increases her utility. \(\beta ^{N}\left( x\right) \) is not an equilibrium of discriminatory auctions with resale. \(\square \)
Proof of Lemma 1
First, by method of contradiction, suppose that \(\beta ( x) >\frac{23}{64}x\) for some \(x\in \left[ 0,c\right] .\) Consider a bidder with value \( y=\theta ^{-1}\left( \beta \left( x\right) \right) \). When this bidder receives three units from the auctioneer, his total payment for second and third object is \(\delta \left( y\right) +\theta \left( y\right) \ge 2\theta \left( y\right) =2 \beta \left( x\right) >\frac{23}{32}x,\) whereas his expected revenue from resale for this case is only \(\frac{23}{32} x\).Footnote 18 Therefore, he makes a loss when he receives 3 units. So, he is better off by deviating to \((\beta ( y) ,0,0) \). \(\square \)
Proof of Lemma 2
For (i), by method of contradiction, suppose that there exists \(t\in \left[ 0,\theta \left( 1\right) \right] \ \) such that \(\frac{d\beta ^{-1}}{dt}( t) >\frac{32}{23}\) and \(\delta ^{-1}\left( t\right) <\theta ^{-1}\left( t\right) .\) Then we can argue that type \(\theta ^{-1}\left( t\right) \equiv y\) strictly benefits by deviating to \(\left( \beta \left( y\right) ,\delta \left( y\right) ,t+\varepsilon \right) \) for a small enough \( \varepsilon \). This is because, by deviating to \(t+\varepsilon \) from t for his third bid (and this is feasible because \(\delta ^{-1}\left( t\right) <\theta ^{-1}\left( t\right) \)), this bidder (i) increases the probability of getting three units and (ii) increases his net utility when he sells two units to unassigned bidders (his payment increases by \( \varepsilon \) and his expected revenue increases by strictly more than \( \frac{23}{32}\times \frac{32}{23}\times \varepsilon =\varepsilon .\))
Next, because \(\beta \left( 0\right) =0\) and \(\beta \left( x\right) \le \frac{ 23}{64}x\) for all \(x\in \left[ 0,c\right] ,\) we have \(\beta ^{\prime }\left( 0\right) \le \frac{23}{64}\) or \(\frac{\mathrm{d}(\beta ^{-1} ) }{\mathrm{d}x} (0)\ge \frac{64}{23}>\frac{32}{23}.\) Because \(\beta \) is continuously differentiable, there exists \(d\le c\) such that \(\frac{\mathrm{d}(\beta ^{-1} ) }{\mathrm{d}x} (x)>\frac{32}{23}\) for all \(x\in \left[ 0,d\right] \); part (i) implies that \(\delta \left( x\right) =\theta \left( x\right) \) for all \(x\in \left[ 0,d\right] .\)\(\square \)
Proof of Lemma 3
By Lemma 2, we know that for all \(x\in [ 0,d] ,\) we have \(\beta ( x) \in \left[ 0,\frac{23}{64}x\right] \) and \( \delta \left( x\right) =\theta \left( x\right) \). Let us define the net utility of a buyer with value \(x\in [ 0,d] \) when he is a seller in the resale stage:Footnote 19
First, if \(s'( x) >0\) then we have \( \theta ( x) =\beta ( x)\). This is because whenever \( s'(x) \) is positive, a bidder with value x becomes strictly better off by increasing his second and third bids by \(\varepsilon \), and doing this would be feasible if \(\beta \left( x\right) >\theta \left( x\right) \).
Next, by method of contradiction, suppose that there exists no \(e\in (0,1]\) such that for all \(x\in \left[ 0,e\right] ,\)\(\beta \left( x\right) =\delta \left( x\right) =\theta \left( x\right) .\) This means there exists \(f>0\) such that we have \(\beta \left( x\right) >\theta \left( x\right) \) for all \( x\in (0,f]\). Note that Lemma 1 implies \(\frac{23}{32}\beta ^{-1}(\theta (x))>2\theta (x)\) and \(\frac{5}{12}\beta ^{-1}(\theta (x))>\theta (x)\). As a result, \(s(x)>0\). This implies that \(s'(y)>0\) for some \(y\in (0,f]\) since \(s(0)=0\). Therefore, we have \(\theta (y) =\beta ( y)\). \(\square \)
Proof of Lemma 4
Consider a bidder with value \(x\in \left( 0,e\right) \) who bids as if his value is z (which is very close to x.) His expected utility is given by
where \(R\left( x,z\right) \), first, is his expected utility from the resale stage when he is a buyer and, second, is given by
where k, l and m denote the realizations for the highest, the second highest, and the third highest values among the competitors, respectively; the first two terms in the summation represent the cases in which the bidder with value x pays the third highest value; and the last two terms in the summation represent the cases in which the bidder with value x pays the reserve price.
A necessary condition for an equilibrium is \( \left. \frac{\partial u\left( x,z\right) }{\partial z}\right| _{z=x}=0\). Note that
The necessary condition can be rewritten as
This differential equation will have a unique solution, which is \(\beta \left( x\right) =\frac{3}{8}x\). \(\square \)
Rights and permissions
About this article
Cite this article
Hafalir, I., Kurnaz, M. Discriminatory auctions with resale. Econ Theory Bull 7, 173–189 (2019). https://doi.org/10.1007/s40505-018-0152-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40505-018-0152-9