Next Article in Journal
A Review of Theoretical Studies on Indirect Reciprocity
Previous Article in Journal
Switching Competitors Reduces Win-Stay but Not Lose-Shift Behaviour: The Role of Outcome-Action Association Strength on Reinforcement Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Note on Buyers’ Behavior in Auctions with an Outside Option

Department of Economics, Finance and Quantitative Analysis, Kennesaw State University, 560 Parliament Garden Way, Kennesaw, GA 30144, USA
Games 2020, 11(3), 26; https://doi.org/10.3390/g11030026
Submission received: 17 April 2020 / Revised: 15 July 2020 / Accepted: 17 July 2020 / Published: 18 July 2020

Abstract

:
In this note I show that the equilibrium in cutoff strategies observed in auctions with a buy-it-now price may also arise in markets where objects are sold simultaneously by auctions and posted prices. However, contrary to auctions with a buy-it-now price where buyers need to know only the total number of players in the market, in the latter environment buyers must also observe the number of active bidders in the auction for the equilibrium to exist in cutoff strategies.
JEL Classification:
C70; D44

1. Introduction

Last decade has witnessed rampant development of ecommerce. One of its salient features is drastic reduction in consumers’ search costs, which further facilitates implementation of different selling mechanisms, e.g., posted prices, auctions, auctions with a buy-it-now price and best offers (first-price sealed-bid auctions). Most online trading platforms allow sellers to list their items using several mechanisms, but the two most prevalent of them are auctions and posted prices.
Online platforms also differ in the structure of supply. Some online markets (primarily in business-to-consumer and business-to-business segments) are characterized by effectively infinite supply, when businesses are able to provide any quantity demanded. Other online markets (primarily in the consumer-to-consumer segment) are depicted by finite supply. On such markets, the supply side is predominantly represented by either very small businesses or ordinary people who are simply reselling previously bought items. eBay is likely the most popular consumer-to-consumer platform, but there are many other platforms, which commonly occupy a particular niche in online retail, e.g., Listia, Catawiki or Shopgoodwill.
When there is an effectively infinite number of homogeneous objects listed by posted prices and auctions, buyers have to choose whether they want to bid in the auction or purchase the same good from the posted price. The major parameters of decision are their valuation for the object and time of arrival. If a buyer places a high value on the object or arrives to the market when the auction has just commenced, he is more likely to buy the good at the posted price rather than bid in the auction. This result is due to [1,2,3] who model a decision of a buyer arriving to a market between buying the good at a posted price and participating in a second-price sealed auction. These papers establish a threshold-type buyer based on arrival time and show that buyers with higher valuations buy the good at the posted price while those with lower valuations—participate in the auction.
When a seller offers unlimited objects at posted prices and open-bid auctions, and bidders are locked into the auction, but are able to observe their bids and even revise them as the auction continues, the equilibrium is still defined in threshold strategies [4]. Finally, another paper considers a model when an infinite number of objects is sold simultaneously by auctions and posted prices and also shows that in the equilibrium there exists a threshold-type buyer separating buyers who choose to buy the good at the posted price and buyers who choose to participate in the auction [5].
As mentioned earlier, consumer-to-consumer markets are different from those analyzed by the literature in that the supply on them is limited. In this note I consider such a market with buyers who can bid dynamically switching between the mechanisms. In contrast to the situation with unlimited supply and “locked-in” buyers, some of them may not be able to purchase the good at all. It creates an incentive for buyers who can afford the object outside to exit the auction before its price matches the price of the good outside. These incentives are intuitive and resonate with the behavior observed in auctions with a buy-it-now (BIN) price. However, I show below that the conditions for them to exist are different.
When implementing a BIN option a seller adds a posted price to an auction-style listing allowing buyers to either buy the item right away or place a bid in the auction. On eBay, it is possible to buy the good at the BIN price before the auction starts or until the auction price reaches a “secret” reserve price set by the seller. Yahoo! design allows to buy the good at the BIN price during the auction1.
In auctions with a Yahoo!-type BIN price, bidders with high valuations have an incentive to end the auction early by buying the good at the BIN price [6]. This mechanism has received much scrutiny, e.g., [6,7,8,9,10]. The focus of the literature is on sellers’ profits and rationale for using the BIN price. It shows that the implementation of the BIN option is viable due to sellers’ or buyers’ risk aversion. Here, I do not attempt to characterize sellers’ equilibrium strategies on markets with auctions and posted prices where the supply is limited.2 The focus of this note is to analyze the differences between auctions with a BIN price and auctions with an outside option from the buyers’ perspective. I show that when the buyout price is posted outside the auction, buyers follow cutoff strategies only when they are able to observe the number of active bidders. As shown by [6], in auctions with a BIN price, this information is not required for buyers to follow cutoff strategies. In other words, in an environment with both an auction and a posted price the necessary condition is that buyers need to not only know the total number of buyers, but also the number of active bidders in the auction for the equilibrium in cutoff strategies to exist.

2. The Model

Consider a market where two homogeneous goods are put up for sale. One of them is offered by an ascending clock auction, the other one is offered at a posted price p. To keep things simple I assume that there are three risk neutral buyers with valuations v i who have unitary demands and independent private values distributed according to a cumulative distribution function F ( · ) with support [ v ¯ , v ¯ ] , where f ( · ) is continuous and positive with v ¯ 0 and v ¯ < p < v ¯ . Reservation price is normalized to zero3.
In the beginning, all buyers decide whether they want to buy the good at the posted price or start bidding in the auction, but have a choice to exit it later at any time and buy the good at the posted price. The auction ends when only one buyer remains. This buyer receives the object and pays the price at the clock. A buyer who decides to exit the auction and buy the good at the posted price gets the good and pays its price p. If several bidders attempt to exit the auction and buy the good at the posted price at the same time, the good is awarded randomly to one of the buyers, and the rest return to the auction4.
Clearly, buyers with valuations less than the posted price outside cannot afford it and thus bid their valuations [12]. They drop out from the auction when the clock moves past their valuations. Buyers with valuations higher than the posted price never have an incentive to drop out from the auction. On the other hand, bidding their valuations cannot be best response as well. To see this, consider three buyers with v i > p bidding in the auction. When the clock reaches p each of them would want to exit and buy the good at p, but only one is randomly permitted to do so. The remaining buyers continue bidding in the auction and eventually receive a lower payoff from either having to pay more (since v j i > p ) or losing the auction. Any buyer can do better by exiting the auction right before the clock matches the price outside. However, other buyers forseeing this may exit even earlier. Hence, there is such a price c [ v ¯ , p ) at which a buyer exits the auction, and there is no loss of generality in looking for an equilibrium in cutoff strategies when valuations are higher than the posted price outside.
A strategy for a buyer with a valuation higher than the posted price (at the start of the auction) is a function z ( · ) , which gives each v ( p , v ¯ ] a cutoff bid price c [ 0 , p ) at which the bidder leaves the auction and buys the good at p. The strategy is defined similarly to auctions with a BIN price. However, if a buyer is allowed to observe the number of buyers, then at price c he is able to update the information on the number of active buyers in the auction and revise his strategy.

3. Comparing Cutoff Strategies

It was previously proved that the equilibrium in cutoff strategies exists in auctions with a BIN price when E ( v x | c x v ) < v B , where x is the first order statistic of all buyers except the buyer with valuation v, and B is the buyout price [6]. In auctions with a BIN price, the expected payoff of a buyer depends only on the realization of the first order statistic among his opponents, because the former buyer’s beliefs about the latter valuation are updated directly via the clock5. In other words, in a BIN setting, if the auction is active, it means that the clock has not yet passed the first order statistic, and a buyer does not need to know the exact number of active bidders. In contrast, when there is an additional object outside the auction (instead of the BIN price), the expected payoff of a buyer also depends on the realization of the second order statistic among his opponents. Whether the auction is active or not does not provide any information on the second order statistic. To see this, consider a buyer who follows a cutoff strategy. In a BIN setting, if the auction ended before the clock reached the price at which this buyer was supposed to use the BIN option, it means that the first order statistic was below this price. In a setting with an outside price, when the clock reaches the exit price of the buyer, if the second order statistic has dropped out, it is no longer profitable to follow a cutoff strategy, because there are only two buyers left in the market, and each of them may get the good at most at p. However, this information may only be received from observing the second order statistic.
First, I allow buyers to observe the number of active bidders in the auction. Consider a buyer with a value v (wlog). Let his opponents have valuations x and y with x > y . In other words, x is the first (highest) order statistic and y is the second order statistic. Then, their joint density is equal to g ( x , y ) = 2 f ( x ) f ( y ) . To calculate the expected payoff of the buyer with valuation v we need to consider all possible realizations of his opponents’ values. There are several cases to consider (Figure 1 is helpful in this analysis):
(a) x , y < c . In this situation, x and y cannot do better but to bid their valuations. Both of the opponents drop out when the auction price reaches their valuations, and the buyer in question wins the auction paying the second highest bid: v ¯ c v ¯ x ( v x ) 2 f ( x ) f ( y ) d y d x .
(b) (i) c < x < p and y < c . In this scenario, when the auction price reaches y, this buyer drops out. At c, the buyer with valuation v observes that one of his opponents has dropped out from the auction and that the good outside is still available, so he no longer exits the auction. It is easy to check that his best response is to bid m a x [ v i , p ] instead. Because x < p , the first order statistic stays in the auction until its price reaches its value. Hence, the buyer in question pays the second highest bid: c p v ¯ c ( v x ) 2 f ( x ) f ( y ) d y d x .
(ii) c < x < p and c < y < x . In this case, when the auction price reaches the exit price of the buyer in question, he leaves the auction and buys the good at the posted price: c p c x ( v p ) 2 f ( x ) f ( y ) d y d x .
(c) (i) p < x < z 1 ( c ) and y < c . This situation is similar to the one described in b(i): the auction continues until the auction price reaches y: second order statistic drops out from the auction, and the remaining bidders play according to m a x [ v i , p ] . Bidding continues until the auction price matches the outside posted price. At p one bidder leaves the auction and buys the good at the posted price, while the other buyer wins the auction and pays the same amount: p z 1 ( c ) v ¯ c ( v p ) 2 f ( x ) f ( y ) d y d x .
(ii) p < x < z 1 ( c ) and c < y < p . In this case, when the auction price reaches c, the buyer in question leaves the auction and buys the good at the posted price: p z 1 ( c ) c p ( v p ) 2 f ( x ) f ( y ) d y d x .
(iii) p < x < z 1 ( c ) and p < y < x . Nothing changes from c(ii) — the buyer in question is still the first to leave the auction and buy the good at the posted price: p z 1 ( c ) p x ( v p ) 2 f ( x ) f ( y ) d y d x .6
(d) (i) z 1 ( c ) < x < v and y < z ( x ) . In this case, y drops out before the exit price of the first order statistic, and the remaining buyers (v and x) bid according to m a x [ v i , p ] . The auction continues until its price matches the outside posted price. At p one bidder leaves the auction and buys the good at the posted price, while the other buyer wins the auction and pays the same amount: z 1 ( c ) v v ¯ z ( x ) ( v p ) 2 f ( x ) f ( y ) d y d x .
(ii) z 1 ( c ) < x < v and z ( x ) < y < x . In this scenario, the first order statistic leaves the auction and buys the good at the posted price. The remaining buyers bid according to m a x [ v i , p ] . When the auction price reaches y, the buyer in question wins the auction and receives a payoff of v y . Since the good outside of the auction is no longer available it is readily seen that the same outcome will also be observed when c < y < x : z 1 ( c ) v z ( x ) x ( v y ) 2 f ( x ) f ( y ) d y d x .
(e) (i) v < x < v ¯ and y < z ( x ) . In this case, the second order statistic drops out from the auction before the exit price of the first order statistic, and the remaining buyers bid according to m a x [ v i , p ] , resulting in both buyers getting the objects at p: v v ¯ v ¯ z ( x ) ( v p ) 2 f ( x ) f ( y ) d y d x .
(ii) v < x < v ¯ and z ( x ) < y < v . In this scenario, the first order statistic leaves the auction and buys the good at the posted price. The remaining buyers bid according to m a x [ v i , p ] . When the auction price reaches y, the buyer in question wins the auction and receives a payoff of v y . Since the good outside of the auction is no longer available, it is readily seen that the same outcome will also be observed when c < y < v : v v ¯ z ( x ) v ( v y ) 2 f ( x ) f ( y ) d y d x .
(iii) When x , y > v the buyer in question gets a payoff of 0.
Summing up all the examined cases produces the following maximization problem:
max c ( v ¯ c v ¯ x ( v x ) Ω + c p v ¯ c ( v x ) Ω + c p c x ( v p ) Ω + p z 1 ( c ) v ¯ x ( v p ) Ω + z 1 ( c ) v v ¯ z ( x ) ( v p ) Ω + z 1 ( c ) v z ( x ) x ( v y ) Ω + v v ¯ v ¯ z ( x ) ( v p ) Ω + v v ¯ z ( x ) v ( v y ) Ω )
where Ω = 2 f ( x ) f ( y ) d y d x .
When a buyer with valuation v is able to observe the number of active bidders, at c, he will continue following his strategy if the number of buyers remains the same. As stated above, if one buyer dropped out from the auction before c, then it is the best response of the buyer with valuation v to bid m a x [ v i , p ] . If one of his opponents left the auction before c and bought the good outside, then the buyer with valuation v simply bids his valuation. Notice that the revision of the strategy is conditional on the observance of the buyer with valuation y (second order statistic among his opponents) when the clock reaches c.
Taking the first-order condition for (1) produces the following differential equation (technical details are delegated to the Appendix A):
z ( v ) = f ( v ) f ( c ) p ( F ( v ) F ( c ) ) c v y f ( y ) d y F ( c ) ( c p ) + c p F ( x ) d x .
For the equilibrium in cutoff strategies to exist two conditions must be met. First, the underlying function z ( v ) must exist, which happens only when c < p . If c p then the denominator is either 0 or undefined. Second, the derivative of the cutoff function needs to be negative. Observe that the denominator of (2) is positive, because F ( c ) ( c p ) + c p F ( x ) d x > F ( c ) ( c p ) + c p F ( c ) d x = 0 . Hence, for the whole fraction to be negative the numerator should also be negative which happens only when p ( F ( v ) F ( c ) ) < c v y f ( y ) d y or p < c v y f ( y ) d y F ( v ) F ( c ) , where the latter term is the expected value of the buyer with valuation y on the interval [ c , v ] . In other words, a buyer with valuation v follows a cutoff strategy only if the valuation of the second order statistic among his opponents is higher than the posted price outside, i.e., E ( v y | z ( v ) y v ) < v p 8.
The result above is intuitive. If all buyers are bidding in the auction, and at price c the number of active bidders did not change, a buyer with valuation v expects the second order statistic among his opponents to be higher than p and follows a cutoff strategy. If the lowest-valuation buyer has dropped out before c, the former buyer is able to observe it and no longer follows a cutoff strategy, but instead bids m a x [ v i , p ] .
Now, consider the objective function of a buyer with valuation v who can no longer observe the number of active bidders. There are two main alterations. When c < x < p and y < c (case b(i)), the buyer with valuation v does not observe that y has dropped out and follows cutoff strategy z ( v ) earning v p instead of v x . Additionally, when x > m a x [ v , z 1 ( c ) ] and y < z ( x ) (cases d(i) and e(i)), the buyer with valuation x does not observe that y has dropped out before his cutoff price and follows the cutoff strategy. The buyer with valuation v now wins the auction and pays v z ( x ) instead of v p :
max c ( v ¯ c v ¯ x ( v x ) Ω + c z 1 ( c ) v ¯ x ( v p ) Ω + z 1 ( c ) v v ¯ z ( x ) ( v z ( x ) ) Ω + z 1 ( c ) v z ( x ) x ( v y ) Ω + v v ¯ v ¯ z ( x ) ( v z ( x ) ) Ω + v v ¯ z ( x ) v ( v y ) Ω )
where Ω = 2 f ( x ) f ( y ) d y d x .
Taking the first-order condition by an analogy with (1) produces:
z ( v ) = f ( v ) f ( c ) p F ( v ) c F ( c ) c v y f ( y ) d y F ( c ) ( p c ) .
Contrary to the previous example, function z ( v ) now exists for any c p , which contradicts the definition of z ( · ) , i.e., z : v i ( p , v ¯ ] c [ 0 , p ) . Hence, the equilibrium in cutoff strategies does not exist when buyers are not able to observe the number of active bidders in the auction.

4. Conclusions

In this note I have compared buyers’ cutoff strategies in auctions with a BIN price and auctions with an outside price. Unlike auctions with a BIN price, in an environment with both an auction and a posted price outside the necessary condition is that buyers need to not only know the total number of buyers, but also the number of active bidders in the auction for the equilibrium in cutoff strategies to exist. If the revision of the strategy conditional on the information obtained from the second highest order statistic is impossible, following cutoff strategies is no longer the equilibrium. One of the requirements for a buyer to follow a cutoff strategy is to observe the second-highest order statistic among his opponents. However, in reality, obtaining information specifically on the second order statistic is hardly alienable from the information on the bids of all other buyers. Hence, the condition is generalized to the observance of all active bidders.
The intuition behind the model developed in this note may be extended to multiple objects outside of the auction. The presence of each additional object outside will require a buyer to observe a lower order statistic. For example, when there is an auction with two objects listed at posted prices outside, a buyer will need to observe if the third highest order statistic among his opponents dropped out from the auction before the clock reached his cutoff price.

Author Contributions

I am the sole author of this manuscript. I have read and agreed to the published version of the manuscript.

Funding

This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.

Acknowledgments

I would like to thank Radovan Vadovič, Aggey Semenov, Jesse Schwartz and two anonymous referees for their thoughtful comments and suggestions. All mistakes are my own.

Conflicts of Interest

The author declares no conflict of interest.

Appendix A. The Derivative of the Cutoff Function

To begin, notice that the first order condition eliminates 2s in (1). Applying the Leibniz Rule to each of the integrals separately produces9:
d d c v ¯ c v ¯ x ( v x ) f ( x ) f ( y ) d y d x = d d c v ¯ c ( v x ) f ( x ) v ¯ x f ( y ) d y d x = d d c v ¯ c ( v x ) f ( x ) F ( x ) d x = ( v c ) f ( c ) F ( c )
d d c c p v ¯ c ( v x ) f ( x ) f ( y ) d y d x = d d c F ( c ) c p ( v x ) f ( x ) d x = f ( c ) c p ( v x ) f ( x ) d x F ( c ) f ( c ) ( v c ) = f ( c ) ( ( v p ) F ( p ) ( v c ) F ( c ) + c p F ( x ) d x F ( c ) ( v c ) ) = f ( c ) ( ( v p ) F ( p ) 2 ( v c ) F ( c ) + c p F ( x ) d x )
d d c c p c x ( v p ) f ( x ) f ( y ) d y d x = ( v p ) d d c c p f ( x ) ( F ( x ) F ( c ) ) d x = ( v p ) d d c ( c p f ( x ) F ( x ) d x F ( c ) c p f ( x ) d x ) = ( v p ) ( f ( c ) F ( c ) d d c F ( c ) ( F ( p ) F ( c ) ) ) = ( v p ) ( f ( c ) F ( c ) f ( c ) ( F ( p ) F ( c ) ) + f ( c ) F ( c ) ) = ( v p ) f ( c ) ( F ( p F ( c ) )
d d c p z 1 ( c ) v ¯ x ( v p ) f ( x ) f ( y ) d y d x = d d c p z 1 ( c ) ( v p ) f ( x ) F ( x ) d x = ( v p ) f ( z 1 ( c ) ) F ( z 1 ( c ) ) z ( z 1 ( c ) )
d d c z 1 ( c ) v v ¯ z ( x ) ( v p ) f ( x ) f ( y ) d y d x = d d c z 1 ( c ) v ( v p ) f ( x ) F ( z ( x ) ) d x = ( v p ) f ( z 1 ( c ) ) F ( c ) z ( z 1 ( c ) )
d d c z 1 ( c ) v z ( x ) x ( v y ) f ( x ) f ( y ) d y d x = f ( z 1 ( c ) z ( z 1 ( c ) ) c z 1 ( c ) ( v y ) f ( y ) d y + z 1 ( c ) v d d c [ f ( x ) z ( x ) x ( v y ) f ( y ) d y ] d x
Notice that d d c [ f ( x ) z ( x ) x ( v y ) f ( y ) d y ] = 0 . Hence, integrating by parts c z 1 ( c ) ( v y ) f ( y ) d y and rearranging gives:
f ( z 1 ( c ) z ( z 1 ( c ) ) [ ( v z 1 ( c ) ) F ( z 1 ( c ) ) ( v c ) F ( c ) + c z 1 ( c ) F ( y ) d y ]
Finally, both d d c v v ¯ v ¯ z ( x ) ( v p ) 2 f ( x ) f ( y ) d y d x and d d c v v ¯ z ( x ) v ( v y ) 2 f ( x ) f ( y ) d y d x are equal to 0, because the integrals do not depend on c.
In equilibrium z 1 ( c ) = v and c = z ( v ) . Hence, the elements with v z 1 ( c ) are equal to 0. Substituting each integral back into the original equation and rearranging produces:
f ( c ) ( F ( c ) ( c p ) + c p F ( x ) d x ) = f ( v ) ( ( v p ) ( F ( c ) F ( v ) ) ( v c ) F ( c ) + c v F ( y ) d y ) z ( v )
Expressing the derivative and further simplifying the numerator results in:
z ( v ) = f ( v ) f ( c ) F ( c ) ( c p ) F ( v ) ( v p ) + c v F ( y ) d y F ( c ) ( c p ) + c p F ( x ) d x
Finally, integrating by parts c v 1 × F ( y ) d y , the numerator can be rewritten as F ( c ) ( c p ) F ( v ) ( v p ) + F ( v ) v F ( c ) c c v y f ( y ) d y or equivalently p ( F ( v ) F ( c ) ) c v y f ( y ) d y , which produces the final equation:
z ( v ) = f ( v ) f ( c ) p ( F ( v ) F ( c ) ) c v y f ( y ) d y F ( c ) ( c p ) + c p F ( x ) d x

References

  1. Etzion, H.; Pinker, E.; Seidmann, A. Analyzing the simultaneous use of auctions and posted prices for online selling. Manuf. Serv. Oper. Manag. 2006, 8, 68–91. [Google Scholar] [CrossRef]
  2. Caldentey, R.; Vulcano, G. Online auction and list price revenue management. Manag. Sci. 2007, 53, 795–813. [Google Scholar] [CrossRef] [Green Version]
  3. Sun, D. Dual mechanism for an online retailer. Eur. J. Oper. Res. 2008, 187, 903–921. [Google Scholar] [CrossRef]
  4. Etzion, H.; Moore, S. Managing online sales with posted price and open-bid auctions. Decis. Support Syst. 2013, 54, 1327–1339. [Google Scholar] [CrossRef]
  5. Hummel, P. Simultaneous use of auctions and posted prices. Eur. Econ. Rev. 2015, 78, 269–284. [Google Scholar] [CrossRef]
  6. Reynolds, S.S.; Wooders, J. Auctions with a buy price. Econ. Theory 2009, 38, 9–39. [Google Scholar] [CrossRef]
  7. Mathews, T.; Katzman, B. The role of varying risk attitudes in an auction with a buyout option. Econ. Theory 2006, 27, 597–613. [Google Scholar] [CrossRef]
  8. Anderson, S.; Friedman, D.; Milam, G.; Singh, N. Buy It Now: A Hybrid Internet Market Institution. J. Electron. Commerce Res. 2008, 9, 137–153. [Google Scholar] [CrossRef] [Green Version]
  9. Chen, J.R.; Chen, K.P.; Chou, C.F.; Huang, C.I. A Dynamic Model of Auctions with Buy-It-Now: Theory and Evidence. J. Ind. Econ. 2013, 61, 393–429. [Google Scholar] [CrossRef] [Green Version]
  10. Anwar, S.; Zheng, M. Posted price selling and online auctions. Games Econ. Behav. 2015, 90, 81–92. [Google Scholar] [CrossRef]
  11. Maslov, A. Competition in Online Markets with Auctions and Posted Prices; KSU Coles College of Business Working Paper Series. Available online: https://coles.kennesaw.edu/research/docs/fall-2019/FALL19-02.pdf (accessed on 19 February 2019).
  12. Vickrey, W. Counterspeculation, auctions, and competitive sealed tenders. J. Financ. 1961, 16, 8–37. [Google Scholar] [CrossRef]
1
In 2000s Yahoo discontinued its services in most of the countries except Japan and Taiwan.
2
This has been done in another paper by [11].
3
The model could be generalized to n risk-averse buyers and include a reserve price, but it does not affect the intuition based on a technically simpler framework used in this paper.
4
The following allocation rule may potentially create discontinuity (also well documented in auctions with a BIN price) in the cutoff function, because some buyers can do better by exiting at the start of the auction rather than bidding in the auction where everyone follows symmetric strategy.
5
If x < c , then x drops out from the auction, and it ends before the clock reaches c. If x > v then the buyout option is used before c, and the auction again ends before the clock reaches c.
6
Note that c(i), c(ii) and c(iii) can be summed up to: p z 1 ( c ) v ¯ x ( v p ) 2 f ( x ) f ( y ) d y d x .
7
Note that z 1 ( c ) may be to the left or right of the “jump-down.” The same pertains to x and y when x , y > z 1 ( c ) . Also, it is easy to show that when p < v < z 1 ( c ) the domains of integration remain the same, i.e., p v v ¯ x ( v p ) 2 f ( x ) f ( y ) + v z 1 ( c ) v ¯ x ( v p ) 2 f ( x ) f ( y ) d y d x = p z 1 ( c ) v ¯ x ( v p ) 2 f ( x ) f ( y ) d y d x . However, when z 1 ( c ) < v < v ¯ domains of integration change conditional on whether v > x or x > v (the figure shows the case when v > x ).
8
Notice that this condition is identical to the one in auctions with a BIN price, except that now it is based on the second order statistic rather than the first order statistic.
9
Note that F ( v ¯ ) = 0 , F ( v ¯ ) = 1 and d d c z 1 ( c ) = 1 z ( z 1 ( c ) ) .
Figure 1. Equilibrium bidding functions7.
Figure 1. Equilibrium bidding functions7.
Games 11 00026 g001

Share and Cite

MDPI and ACS Style

Maslov, A. A Note on Buyers’ Behavior in Auctions with an Outside Option. Games 2020, 11, 26. https://doi.org/10.3390/g11030026

AMA Style

Maslov A. A Note on Buyers’ Behavior in Auctions with an Outside Option. Games. 2020; 11(3):26. https://doi.org/10.3390/g11030026

Chicago/Turabian Style

Maslov, Alexander. 2020. "A Note on Buyers’ Behavior in Auctions with an Outside Option" Games 11, no. 3: 26. https://doi.org/10.3390/g11030026

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop