Skip to main content
Log in

Flow auctions

  • Original Paper
  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

Flow goods (like electricity) are sold through auctions in a dynamic framework. An important design question is the frequency of such auctions. We use a simple dynamic auction model in continuous time to answer this question. We focus on the relationship between the persistency of bidders’ valuations and the optimal choice of frequency. If the seller focuses on the equilibrium in which bidders follow a repeated static Nash strategy, then the frequency of auctions should typically increase when persistency declines. However, accounting for the fact that bidders can follow different equilibria that are collusive in nature, the comparative statics are reversed, forcing the seller to reduce the frequency when bidders’ valuations are less persistent. The argument builds on the fact that high frequency auctions are more conducive to collusion among bidders.

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.

Similar content being viewed by others

Notes

  1. A notable exception is a recent important paper by Athey and Bagwell (2008), who obtain a numerical solution for a model with persistence in types.

  2. We are not adopting a general mechanism design approach here as we wish to maintain the format of flow-auction environments such as in the electricity industry.

  3. This condition implies that the number of bidders is at least three, as we assumed earlier.

References

  • Abreu D, Pearce D, Stachetti E (1990) Toward a theory of discounted repeated games with imperfect monitoring. Econometrica 58:1041–1063

    Article  Google Scholar 

  • Athey S, Bagwell K (2008) Collusion with persistent cost shocks. Econometrica 76(3):459–677

    Article  Google Scholar 

  • Ausubel LM, Cramton P (1998) Auctioning securities, working paper. University of Maryland, Maryland

  • Cramton P, Stoft S (2007) Why we need to stick with uniform-price auctions in electricity markets. Electr J 20(1):26–37

    Article  Google Scholar 

  • Congressional Budget Office paper (2001) http://www.cbo.gov/showdoc.cfm?index=3062&sequence=0. Accessed 1 Apr 2016

  • McAfee RP, McMillan J (1992) Bidding rings. Am Econ Rev 82(3):579–599

  • Skrzypacz A, Hopenhayn H (2004) Tacit collusion in repeated auctions. J Econ Theory 114(1):153–169

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eyal Winter.

Appendix

Appendix

Proof of Lemma 1

We need to prove that

\(\Pi (k,a)\!=\!\sum _{i=0}^\infty e^{-irk}\int _0^k \big ( x_{n-1} e^{-at}+\bar{{x}}(1-e^{-at}) \big )e^{-rt}dt \) decreases with k.

By taking the integral we get

$$\begin{aligned} \Pi (k,a)=\sum _{i=0}^\infty {e^{-irk}\left( {x_{n-1} \frac{1-e^{-(a+r)k}}{a+r}+\bar{{x}}\left( {\frac{1-e^{-rk}}{r}-\frac{1-e^{-(a+r)k}}{a+r}} \right) } \right) } \end{aligned}$$

and by taking the sum this expression can be rewritten as \(\Pi (k,a)=\frac{x_{n-1} -\bar{{x}}}{a+r}\cdot \frac{e^{rk}-e^{-ak}}{e^{rk}-1}+\frac{\bar{{x}}}{r}\); in order to study this expression as a function of k we should concentrate on the following (here we use the assumption that \(x_{n-1} -\bar{{x}}>0)\): \(\frac{d}{dk}\frac{e^{rk}-e^{-ak}}{e^{rk}-1}=\frac{e^{-ak}\left( {-a+e^{rk}(a+r-re^{ak})} \right) }{\left( {e^{rk}-1} \right) ^{2}}\). The sign of this expression is determined by \(-a+e^{rk}(a+r-re^{ak})\). This expression can be also written as \(-a+e^{rk}(a+r-re^{ak})=(a+r)(e^{rk}-1)+r(1-e^{(r+a)k})\). By replacing the exponents with their Taylor series we obtain

$$\begin{aligned} (a+r)(e^{rk}-1)+r(1-e^{(r+a)k})= & {} (a+r)\sum _{i=1}^\infty {\frac{(kr)^{i}}{i!}} -r\sum _{i=1}^\infty {\frac{(k(a+r))^{i}}{i!}} \\= & {} \sum _{i=1}^\infty {\frac{rk(a+r)}{i!}\left( {(kr)^{i-1}-(k(a+r))^{i-1}} \right) } \!<\!0 \\ \end{aligned}$$

\(\square \)

Proof of Lemma 2

Consider first the special case in which the price is constant; that is, the two highest types bid some price \(p\ge 0\). In this case we will argue that condition (1) is not only necessary but also sufficient. Consider what the incentives of the second-highest type from deviating are. According to the collusive scheme his payoff from a single auction in the future, conditional on receiving it (i.e., having the highest value \(\hbox {x}_\mathrm{n})\) is

$$\begin{aligned} X(x_n ,a,k)-p \end{aligned}$$

in each interval in which he has the highest type at the beginning of this interval and zero otherwise. His payoff in a static Nash in future intervals is given by

$$\begin{aligned} X(x_n ,a,k)-X(x_{n-1} ,a,k) \end{aligned}$$

This leads to a difference of

$$\begin{aligned} X(x_{n-1} ,a,k)-p \end{aligned}$$

for all auctions starting with the second auction. To get the present value we multiply by the probability of having the highest value and discount to the present.

Hence, we conclude that the benefit from following the collusive scheme as compared to the payoff from deviation is given by

$$\begin{aligned} \left( {X(x_{n-1} ,a,k)-p} \right) \frac{1}{n}\sum _{i=1}^\infty {(1-e^{-ika})e^{-rik}} \end{aligned}$$

We compare this to the current profit from deviation that is given by

$$\begin{aligned} X(x_{n-1} ,a,k)-p \end{aligned}$$

Hence, we conclude that (1) is both necessary and sufficient. Since this condition does not depend on p, (ii) also follows. To complete the proof for part (i) we need to show that if (1) does not hold then we cannot support a scheme with non-negative prices. So we assume by contradiction that \(\frac{1}{n}\sum _{i=1}^\infty {(1-e^{-ika})e^{-rik}} =1-\Delta \hbox { for some }\Delta \ge 0\) and that there exists a price scheme in which the price in interval i is given by \(p_i\). For this to be an equilibrium it must be that for each i we have that

$$\begin{aligned} X(x_{n-1} ,a,k)-p_i \le \frac{1}{n}\sum _{j=1}^\infty {(1-e^{-jka})e^{-rjk}} \left( {X(x_{n-1} ,a,k)-p_{i+j} } \right) \end{aligned}$$
(3)

Otherwise at time \(t=ik\) there is an incentive to deviate. We consider a weighted average of future prices at time \(t=ik\); let

$$\begin{aligned} \hat{{P}}_i =\frac{\sum _{j=1}^\infty {(1-e^{-jka})e^{-rjk}} p_{i+j} }{\sum _{j=1}^\infty {(1-e^{-jka})e^{-rjk}} } \end{aligned}$$

Using this notation we can rewrite (3) as

$$\begin{aligned} X(x_{n-1} ,a,k)-p_i \le \frac{1}{n}\left( {X(x_{n-1} ,a,k)-\hat{{P}}_i } \right) \sum _{j=1}^\infty {(1-e^{-jka})e^{-rjk}} \end{aligned}$$

This implies that

$$\begin{aligned} X(x_{n-1} ,a,k)-p_i \le \left( {X(x_{n-1} ,a,k)-\hat{{P}}_i } \right) \left( {1-\Delta } \right) \end{aligned}$$
(4)

Note that also

$$\begin{aligned} \hat{{P}}_i =\alpha p_i +(1-\alpha )\hat{{P}}_{i+1} \end{aligned}$$
(5)

where \(\alpha =\frac{(1-e^{-ka})e^{-rk}}{\sum _{j=1}^\infty {e^{-jk(a+r)}} }\). Using (4) and (5) we conclude that

$$\begin{aligned} X(x_{n-1} ,a,k)-P_i \le \left( {X(x_{n-1} ,a,k)-\hat{{P}}_{i+1} } \right) (\alpha \left( {1-\Delta } \right) +(1-\alpha )) \end{aligned}$$

Since \((\alpha \left( {1-\Delta } \right) +(1-\alpha ))<1\) we conclude that \(\lim _{i\rightarrow \infty } X(x_{n-1} ,a,k)-P_i =\infty \) which implies that \(\lim _{i\rightarrow \infty } P_i =-\infty \), and so we contradict our assumption of non-negative prices. \(\square \)

Proof of Theorem 1

Let

$$\begin{aligned} f(k,a)\equiv \frac{1}{e^{kr}-1}-\frac{1}{e^{k(r+a)}-1} \end{aligned}$$

One can easily verify that

  1. a.

    f is continuous,

  2. b.

    \(\lim _{k\rightarrow 0} f(k,a)=\infty ,\lim _{k\rightarrow \infty } f(k,a)=0,\) and

  3. c.

    f is positive.

  4. d.

    \(\frac{\partial }{\partial a}f(k,a)>0\)

We will show that

  1. e.

    \(\frac{\partial }{\partial k}f(k,a)<0\)

Both parts (i) and (ii) follow from the above properties. To see that item e indeed holds note that

$$\begin{aligned} \frac{\partial f(k,a)}{\partial k}=\frac{e^{k(r+a)}(a+r)}{(1-e^{k(r+a)})^{2}}-\frac{e^{kr}r}{(1-e^{kr})^{2}} \end{aligned}$$

Define \(g(x)\equiv \frac{e^{kx}x}{(1-e^{kx})^{2}_{}}\); we will argue that for every k, g(x) is a decreasing function of x. We note that

$$\begin{aligned} g'(x)= & {} \frac{e^{kx}}{(e^{kx}-1)^{2}}-\frac{2e^{2kx}kx}{(e^{kx}-1)^{3}}+\frac{e^{kx}kx}{(e^{kx}-1)^{2}}\\= & {} \frac{e^{kx}}{(e^{kx}-1)^{3}}\left( {e^{kx}-1-2e^{kx}kx+kx(e^{kx}-1)} \right) \end{aligned}$$

Denote y=kx; then the parenthesis can be written as

$$\begin{aligned} h(y)\equiv e^{y}-1-2e^{y}y+y(e^{y}-1)=e^{y}-1-e^{y}y-y \end{aligned}$$

To complete the proof we need to show that \(h(y)<0\) for all \(y>0\). To see this note that \(h(0)=0\) and that \(h'(y)=-e^{y}y-1<0\).\(\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kremer, I., Wiener, Z. & Winter, E. Flow auctions. Int J Game Theory 46, 655–665 (2017). https://doi.org/10.1007/s00182-016-0549-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00182-016-0549-3

Keywords

JEL Classification

Navigation