Skip to main content
Log in

Identification in english auctions with shill bidding

  • Published:
Quantitative Marketing and Economics Aims and scope Submit manuscript

Abstract

What can we learn from auction data when the seller submits shill bids to inflate the auction price? I study identification in an incomplete model of an English auction with shill bidding in the context of independent private values. I show that the distribution of valuations is partially identified (as is the optimal reserve price), and I provide bounds for the distribution of valuations that hold even when the seller is not engaging in shill bidding. I apply these results to a sample of eBay auctions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. Shill bidding is also considered a riminal fraud in the UK and US (Kauffman & Wood, 2005).

  2. See, for example, “3 Men Are Charged With Fraud In 1,100 Art Auctions on EBay,” The New York Times, March 9, 2001, “Phony Bids Pose Difficulties, Putting eBay on the Defensive,” The Wall Street Journal, May 24, 2000, “Officials Accuse Three in Scam To Drive Up Prices in eBay Bids,” The Wall Street Journal, February 8, 2002, and “How do you catch online auction cheats?,” BBC News, July 5, 2010..

  3. See, e.g., “Lawsuit accuses Auction.com of using ‘shill bidder”’, New York Post, December 25, 2014.

  4. The optimal reserve price can vary with the number of bidders in a number of cases. With independent private values, this may occur whenever the distribution of valuations F(v) is such that \(v - (1-F(v))/F'(v)\) is not monotone increasing (see the discussion in Wang et al. (2001)). With affiliated private values, the valuations may depend on a common factor (e.g., market conditions), which may also affect the seller’s valuation for the object (i.e., the value from a future sale if the object does not sell in the auction).

  5. See, for example, (Hasker & Sickles, 2010) for a survey of the use of eBay data in the economic literature.

  6. These inequalities accommodate the case in which the top two bids differ by less than the minimum bid increment. See Hickman et al. (2017) for a treatment of this case in the context of a complete model of electronic auctions.

  7. Runner-ups are defined as all players except for the one with the highest bid.

  8. The same argument can be used if the legitimate bidders with the top k valuations all have valuations within \(\Delta \) dollars of each other and the bidder with the highest valuation places a bid that is fourth highest or lower.

  9. The proposition resembles theorems 1 and 2 in Haile and Tamer (2003) but must take into account that the shill bidder may win the auction.

  10. Another specification test that relies on properties of order statistics is proposed in Kim and Lee (2014), which requires the econometrician to observe multiple bids. Their test is based on comparing estimates of the distribution of valuations obtained using multiple pairs of order statistics. The test I propose is implementable in settings where the econometrician has more limited data, as it requires observing the winning bid only.

  11. Depending on the dimensionality of the vector of covariates X, the econometrician may prefer to specify a single-index model so that the distribution of valuations only depend on the covariates through an index that depends on X and some vector of parameters \(\beta \) (e.g., \(X'\beta \)). See Paarsch and Hong (2006) for a discussion on single-index models.

  12. Assuming, of course, that the shill bidder draws an exit point from a distribution that is not equal to the legitimate bidders’ distribution of valuations.

  13. The bootstrapped confidence intervals are based on 2,500 replicates.

  14. Haile and Tamer (2003) discuss consistency of bootstrapped confidence intervals in a similar setting.

References

  • Anderson, T.W. (1962). On the distribution of the two-sample Cramer-von Mises criterion. The Annals of Mathematical Statistics, pp.1148–1159.

  • Andreyanov, P., & Caoui, E.H. (2020). Secret reserve prices by uninformed sellers. Technical report, Working paper, University of Toronto.

  • Aradillas-López, A., Gandhi, A., & Quint, D. (2013). Identification and inference in ascending auctions with correlated private values. Econometrica, 81(2), 489–534.

    Article  Google Scholar 

  • Asker, J. (2010). A study of the internal organization of a bidding cartel. American Economic Review, 100(3), 724–762.

    Article  Google Scholar 

  • Athey, S., & Haile, P. A. (2002). Identification of standard auction models. Econometrica, 70(6), 2107–2140.

    Article  Google Scholar 

  • Athey, S., & Haile, P. A. (2007). Nonparametric approaches to auctions. Handbook of Econometrics, 6, 3847–3965.

    Article  Google Scholar 

  • Austin, D., Seljan, S., Monello, J., & Tzeng, S. (2016). Reserve price optimization at scale. In 2016 IEEE International Conference on Data Science and Advanced Analytics (DSAA), (pp. 528–536), IEEE.

  • Baldwin, L., Marshall, R., & Richard, J. F. (1997). Bidder collusion at forest service timber sales. Journal of Political Economy, 105(4), 657–699.

    Article  Google Scholar 

  • Brendstrup, B., & Paarsch, H. J. (2006). Identification and estimation in sequential, asymmetric, English auctions. Journal of Econometrics, 134(1), 69–94.

    Article  Google Scholar 

  • Cesa-Bianchi, N., Gentile, C., & Mansour, Y. (2014). Regret minimization for reserve prices in second-price auctions. IEEE Transactions on Information Theory, 61(1), 549–564.

    Article  Google Scholar 

  • Coey, D., Larsen, B. J., Sweeney, K., & Waisman, C. (2021). Scalable optimal online auctions. Marketing Science, 40(4), 593–618.

    Article  Google Scholar 

  • Coey, D., Larsen, B., & Sweeney, K. (2019). The bidder exclusion effect. The Rand Journal of Economics, 50(1), 93–120.

    Article  Google Scholar 

  • Einav, L., Farronato, C., Levin, J., & Sundaresan, N. (2018). Auctions versus posted prices in online markets. Journal of Political Economy, 126(1), 178–215.

    Article  Google Scholar 

  • Feinstein, J., Block, M., & Nold, F. (1985). Asymmetric information and collusive behavior in auction markets. American Economic Review, 75(3), 441–460.

    Google Scholar 

  • Graham, D. A., Marshall, R. C., & Richard, J.-F. (1990). Phantom bidding against heterogeneous bidders. Economic Letters, 32, 13–17.

    Article  Google Scholar 

  • Grether, D., Porter, D., & Shum, M. (2015). Cyber-shilling in automobile auctions: evidence from a field experiment. American Economic Journal: Microeconomics, 7(3), 85–103.

    Google Scholar 

  • Haile, P. A., & Tamer, E. (2003). Inference with an incomplete model of English auctions. Journal of Political Economy, 111(1), 1–51.

    Article  Google Scholar 

  • Hasker, K., & Sickles, R. (2010). eBay in the economic literature: Analysis of an auction marketplace. Review of Industrial Organization, 37(1), 3–42.

    Article  Google Scholar 

  • Hendricks, K., & Porter, R. H. (2007). An empirical perspective on auctions. Handbook of Industrial Organization, 3, 2073–2143.

    Article  Google Scholar 

  • Hickman, B. R., Hubbard, T. P., & Paarsch, H. J. (2017). Identification and estimation of a bidding model for electronic auctions. Quantitative Economics, 8(2), 505–551.

    Article  Google Scholar 

  • Kauffman, R. J., & Wood, C. A. (2005). The effects of shilling on final bid prices in online auctions. Electronic Commerce Research and Applications, 4, 21–34.

    Article  Google Scholar 

  • Kim, K.l., Lee, J. (2014). Nonparametric estimation and testing of the symmetric IPV framework with unknown number of bidders. Technical report, Michigan State University working paper.

  • Manski, C. F., & Tamer, E. (2002). Inference on regressions with interval data on a regressor or outcome. Econometrica, 70(2), 519–546.

    Article  Google Scholar 

  • Marmer, V., Shneyerov, A.A., Kaplan, U. (2016). Identifying collusion in english auctions. Available at SSRN 2738789.

  • Milgrom, P.R., & Weber, R.J. (1982). A theory of auctions and competitive bidding. Econometrica: Journal of the Econometric Society, pp. 1089–1122.

  • Mohri, M., & Medina, A.M. (2014). Learning theory and algorithms for revenue optimization in second price auctions with reserve. In International conference on machine learning, pp. 262–270, PMLR.

  • OFT (2007) Internet Shopping. An OFT market study.: http://www.oft.gov.uk/shared_oft/reports/consumer_protection/oft921.pdf.

  • Paarsch, H.J., & Hong, H. (2006). An introduction to the structural econometrics of auction data: The MIT Press.

  • Porter, R., & Zona, D. (1993). Detection of bid rigging in procurement auctions. Journal of Political Economy, 101(3), 518–538.

    Article  Google Scholar 

  • Porter, R., & Zona, D. (1999). Ohio school milk markets: An analysis of bidding. RAND Journal of Economics, 30(2), 263–288.

    Article  Google Scholar 

  • Rhuggenaath, J., Akcay, A., Zhang, Y., & Kaymak, U. (2019). Optimizing reserve prices for publishers in online ad auctions. In 2019 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr), pp. 1–8, IEEE.

  • Riley, J. G., & Samuelson, W. F. (1981). Optimal auctions. The American Economic Review, 71(3), 381–392.

    Google Scholar 

  • Rudolph, M.R., Ellis, J.G., & Blei, D.M. (2016). Objective variables for probabilistic revenue maximization in second-price auctions with reserve. In Proceedings of the 25th International Conference on World Wide Web, pp. 1113–1122.

  • Song, U. (2004). Nonparametric estimation of an eBay auction model with an unknown number of bidders.

  • Tang, X. (2011). Bounds on revenue distributions in counterfactual auctions with reserve prices. The Rand Journal of Economics, 42(1), 175–203.

    Article  Google Scholar 

  • Wang, W., Hidvégi, Z., & Whinston, A.B. (2001). Shill bidding in English auctions. Working Paper.

Download references

Acknowledgements

I thank Günter Hitsch (Editor), Jeff Ely, Álvaro Parra, Rob Porter, two anonymous referees, and workshop participants at Northwestern University for helpful comments and suggestions. I am supported in part by funding from the Social Sciences and Humanities Research Council (Canada). The author has no competing interests to declare that are relevant to the content of this article. The data and code that support the findings of this study are available from the author (guillermo.marshall@sauder.ubc.ca). All errors are my own.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guillermo Marshall.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix A: Omitted proofs

Proof of Proposition 2

We first have that by the Glivenko-Cantelli theorem,

$$ \hat{F}^{}_{w,n+1,T}(t)=\frac{1}{T_{n+1}}\sum _{i=1}^T 1\{m_i=n+1; w_i \le t\} \overset{a.s.}{\rightarrow }\ {F}^{}_{w,n+1}(t) $$

uniformly in t, for all \(n+1 \in \Omega \).

Consider \(\hat{L}_{T}(t)\). Since \(\phi _2^{-1}:[0,1] \rightarrow [0,1]\) is a uniformly continuous function for all n, it follows from Lemma 2 that

$$ \phi _2^{-1}(\hat{F}^{}_{n+1,T}(t-\Delta )|n) \overset{a.s.}{\rightarrow }\ \phi _2^{-1}({F}^{}_{n+1}(t-\Delta )|n) $$

uniformly in t, for all \(n+1 \in \Omega \). Since the \(\max \) function is continuous, it follows from the continuous mapping theorem that

$$ \hat{L}_{T}(t) \overset{a.s.}{\rightarrow }\ L(t), \; \forall t. $$

Finally, that the convergence of \(L_{T}(t)\) to L(t) is a.s. uniformly in t, follows from the following inequality

$$ \sup _t |\hat{L}_{T}(t)-L(t)| \le \sum _n \sup _t |\phi _2^{-1}(\hat{F}^{}_{w,n+1,T}(t-\Delta )|n)-\phi _2^{-1}({F}^{}_{w,n+1}(t-\Delta )|n)|. $$

The rest of the proof follows by applying analogous arguments.

Proof of Proposition 3

The proof follows from the arguments provided in the text.

Proof of Proposition 4

The proof follows from arguments that are analogous to those in the proof of Proposition 1.

Proof of Proposition 5

Fix \(n \in \aleph \). Define

$$\begin{aligned} \pi _n(r|v_0)=v_0 F_v(r)^n+n\int _r^{\bar{v}}(F_v(v)+vF_v'(v)-1)F_v^{n-1}(v)dv, \end{aligned}$$

where \(F_v(\cdot )\) is the true but unobserved distribution of valuations, and take

$$ r_n^* \in \arg \max _{r} \pi _n(r|v_0). $$

It is true that

$$\begin{aligned} \pi _n(r_n^*)\ge & {} \sup _{ a \in [\underline{v},\bar{v}]}\pi _n^L(a) \end{aligned}$$
(12)
$$\begin{aligned} \pi _n^U(r_n^*)\ge & {} \pi _n(r_n^*) \end{aligned}$$
(13)

since \(\pi _n^U(t) \ge \pi _n(t)\ge \pi _n^L(t), \forall t\).

Suppose \(r_n^* \notin H[r^*]\). That implies, in particular, that \(r_n^* \notin \left\{ r: \pi _n^U(r)\ge \sup _{ a \in [\underline{v},\bar{v}]}\right. \) \(\left. \pi _n^L(a) \right\} \). If \(r_n^* \notin \{r: \pi _n^U(r)\ge \pi _n^L(r_n^L)\}\), then

$$ \sup _{ a \in [\underline{v},\bar{v}]}\pi _n^L(a) > \pi _n^U(r_n^*). $$

But then by making use of Eqs. 12 and 13, we reach the following contradiction

$$ \sup _{ a \in [\underline{v},\bar{v}]}\pi _n^L(a) > \pi _n^U(r_n^*) \ge \sup _{ a \in [\underline{v},\bar{v}]}\pi _n^L(a). $$

Proof of Proposition 6

Part a) follows from Lemma 4 in Appendix A. Part b) follows from Proposition 5b in Manski and Tamer (2002).

Appendix B: Additional results

Lemma 1

Let \(\phi _1(\cdot |n)\) and \(\phi _2(\cdot |n)\) be the distribution functions of the first- and second-order statistics, defined as

$$\begin{aligned} \phi _1(x|n)=x^{n} \; \;\; \text { and } \; \; \; \phi _2(x|n)=n(n-1) \int _0^{x} u^{n-2}(1-u)du. \end{aligned}$$

The inverse functions \(\phi ^{-1}_1(x|n)\) and \(\phi ^{-2}_1(x|n)\) are increasing in n for \(x \in (0,1)\).

Proof

I first show that \(\phi _2^{-1}(x|n) \le \phi _2^{-1}(x|n+1) \) for \(x\in (0,1]\). Call the left-hand side expression, \(y_{n}\), and the right-hand side expression, \(y_{n+1}\). From the expression for the second-order distribution function, \(\phi _2(\cdot |n)\), we note that \(y_n\) and \(y_{n+1}\) are implicitly defined as

$$\begin{aligned} x= & {} n(y_{n}^{n-1}-y_{n}^{n})+y_{n}^{n}, \\ x= & {} n y_{n+1}( y_{n+1}^{n-1}- y_{n+1}^{n})+y_{n+1}^n. \end{aligned}$$

By setting these expressions equal, and by using the fact that \(x \in [0,1]\), we obtain the following inequality

$$\begin{aligned} n(y_{n}^{n-1}-y_{n}^{n})+y_{n}^{n}= & {} n y_{n+1}( y_{n+1}^{n-1}- y_{n+1}^{n})+y_{n+1}^n \\\le & {} n( y_{n+1}^{n-1}- y_{n+1}^{n})+y_{n+1}^n, \end{aligned}$$

where the inequality follows from \(y_{n+1} \in (0,1]\). The inequality can be rewritten as

$$ \phi _2(y_{n}|n) \le \phi _2(y_{n+1}(t)|n). $$

Since \(\phi _2(\cdot |n)\) is a strictly increasing function, the result follows.

Consider next \(\phi ^{-1}_1(x|n)\). By taking the derivative of \(\phi _1^{-1}(x|n) = x^{1/n}\), one can show that the function is increasing in n for \(x \in (0,1)\). \(\square \)

Lemma 2

Take a sequence of functions \(\{g_T(\omega ,\theta )\}\), \(g_T:X \rightarrow Y\), that converges to \(g(\theta )\) a.s. uniformly in \(\theta \in \Theta \), that is,

$$ \Pr \left[ \lim _{T \rightarrow \infty } \sup _{\theta \in \Theta } | g_n(\theta )-g(\theta )|=0 \right] =1. $$

Take a uniformly continuous function \(\psi :Y \rightarrow Y\). Then \(\{\psi (g_T(\omega ,\theta ))\}\) converges to \(\psi (g(\theta ))\) a.s. uniformly in \(\theta \in \Theta \).

Proof

Fix any \(\varepsilon >0\). By uniform continuity of \(\psi \), \(\exists \delta >0\) such that for any \(x,y \in X\), \(|x-y|<\delta \) implies \(|\psi (x)-\psi (y)|<\varepsilon \).

By convergence a.s. uniformly of \(g_T\),

$$ \lim _{T \rightarrow \infty } \sup _{\theta \in \Theta } | g_T(\theta )-g(\theta )|=0 \; \; \text { a.e. }, $$

that is, \(\exists \, T_{\delta }\) such that \(\forall \, m \ge T_{\delta }\)

$$ \sup _{\theta } |g_m(\theta )-g(\theta )| <\delta \; \; \text { a.e. }. $$

By uniform continuity of \(\psi \), we conclude that \(\forall m \ge T_{\delta }\)

$$ \sup _{\theta } |\psi (g_m(\theta ))-\psi (g(\theta ))| <\varepsilon \; \; \text {a.e. }. $$

Since this holds for any \(\varepsilon >0\),

$$ \lim _{T \rightarrow \infty } \sup _{\theta \in \Theta } | g_T(\theta )-g(\theta )|=0 \; \; \text { a.e. } \; \; \Rightarrow \lim _{T \rightarrow \infty } \sup _{\theta \in \Theta } | \psi (g_T(\theta ))-\psi (g(\theta ))|=0 \; \; \text { a.e. }. $$

The result follows since

$$ 1=\Pr \left[ \lim _{T \rightarrow \infty } \sup _{\theta \in \Theta } | g_T(\theta )-g(\theta )|=0\right] \le \Pr \left[ \lim _{T \rightarrow \infty } \sup _{\theta \in \Theta } | \psi (g_T(\theta ))-\psi (g(\theta ))|=0 \right] . $$

\(\square \)

Lemma 3

\(\pi _{T,n}(r) \overset{a.s.}{\rightarrow }\pi _n(r)\) uniformly in r.

Proof

Note that

$$\begin{aligned} \sup _r |\pi _{T,n}(r)-\pi _n(r)|= & {} \sup _r \left| (v_0-r)(F_{T}(r)^n-F(r)^n)\right. \\{} & {} \left. -\int _r^{\bar{v}}\left( F_T(v)^{n-1}[n(1-F_T(v))+F_T(v)]\right. \right. \\{} & {} \left. \left. -F(v)^{n-1}[ n(1-F(v))+F(v)] \right) dv\right| \\\le & {} |K_1|\cdot \sup _r|F_{T}(r)^n-F(r)^n|\\{} & {} + \sup _r \left| \int _r^{\bar{v}}\left( F_T(v)^{n-1}[n(1-F_T(v))+F_T(v)]\right. \right. \\{} & {} \left. \left. -F(v)^{n-1}[n(1-F(v))+F(v)] \right) dv \right| \\\le & {} |K_1|\cdot \sup _r|F_{T}(r)^n-F(r)^n|+|K_2| \cdot \sup _v \left| F_T(v)^{n-1}[n(1-F_T(v))\right. \\{} & {} \left. +F_T(v)]-F(v)^{n-1}[n(1-F(v))+F(v)] \right| \\= & {} |K_1|\cdot \sup _r|\psi _1(F_{T}(r))-\psi _1(F(r))|\\{} & {} +|K_2| \cdot \sup _v|\psi _2(F_{T}(r))-\psi _2(F(r))|, \end{aligned}$$

where \(K_1\) and \(K_2\) are constants, and \(\psi _1:[0,1] \rightarrow [0,1]\) and \(\psi _2:[0,1] \rightarrow [0,1]\) are uniformly continuous functions. Since \(F_T(x) \overset{a.s.}{\rightarrow }F(x)\) uniformly in x, the result follows from Lemma 2. \(\square \)

Lemma 4

\(Q_{T}(t) \overset{a.s.}{\rightarrow }Q(t)\) uniformly in t.

Proof

Note that

$$\begin{aligned} \sup _t \left| Q_{n,T}(t)-Q_n(t) \right|\!=\! & {} \sup _t \left| 1\{\sup _a \pi _{T,n}^L(a)-\pi _{T,n}^U(t)>0\}(\sup _a \pi _{T,n}^L(a)-\pi _{T,n}^U(t)) \right. \\{} & {} \left. -1\{\sup _a \pi _n^L(a)-\pi _n^U(t)>0\}(\sup _a \pi _n^L(a)-\pi _n^U(t)) \right| \\\le & {} \sup _t \left| (\sup _a \pi _{T,n}^L(a)-\pi _{T,n}^U(t))-(\sup _a\pi _n^L(a)-\pi _n^U(t)) \right| \\\le & {} \left| \sup _a \pi _{T,n}^L(a)-\sup _a \pi _n^L(a) \right| + \sup _t \left| \pi _n^U(t)-\pi _{T,n}^U(t) \right| \\\le & {} \sup _a \left| \pi _{T,n}^L(a)- \pi _n^L(a) \right| + \sup _t \left| \pi _n^U(t)-\pi _{T,n}^U(t) \right| . \end{aligned}$$

Since \(\pi _{T,n}(r) \overset{a.s.}{\rightarrow }\pi _n(r)\) uniformly in r, the result follows from Lemma 2. \(\square \)

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Marshall, G. Identification in english auctions with shill bidding. Quant Mark Econ 22, 193–222 (2024). https://doi.org/10.1007/s11129-023-09274-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11129-023-09274-9

Keywords

JEL Classification

Navigation