13.5: Search

Learning Objectives

• How should a consumer go about finding the lowest price when available prices are random?

In most communities, grocery stores advertise sale prices every Wednesday in a newspaper insert, and these prices can vary from week to week and from store to store. The price of gasoline can vary as much as 15 cents per gallon in a one-mile radius. Should you decide that you want to buy a specific Sony television, you may see distinct prices at Best Buy and other electronics retailers. For many goods and services, there is substantial variation in prices, which implies that there are gains for buyers to search for the best price.

The theory of consumer search behavior is just a little bit arcane, but the basic insight will be intuitive enough. The general idea is that, from the perspective of a buyer, the price that is offered is random and has a probability density function f (p). If a consumer faces a cost of search (e.g., if you have to visit a store—in person, telephonically, or virtually—the cost includes your time and any other costs necessary to obtain a price quote), the consumer will set a reservation price, which is a maximum price that he or she will pay without visiting another store. That is, if a store offers a price below p*, the consumer will buy; otherwise, he or she will visit another store, hoping for a better price.

Call the reservation price p*, and suppose that the cost of search is c. Let J(p*) represent the expected total cost of purchase (including search costs). Then J must equal \(J(p*)=c+ ∫ 0 p* pf(p)dp + ∫ p* ∞ J(p*)f(p)dp\).

This equation arises because the current draw (which costs c) could either result in a price less than p*, in which case observed price, with density f, will determine the price paid p; or the price will be too high, in which case the consumer is going to take another draw, at cost c, and on average get the average price J(p*). It is useful to introduce the cumulative distribution function F, with \(F(x)=\int 0 \times f(p) d p\). Note that something has to happen, so F(∞) = 1.

We can solve the equality for \(J(p*), J(p*)= ∫ 0 p* pf(p)dp +c F(p*) \).

This expression has a simple interpretation. The expected price J(p*) is composed of two terms. The first is the expected price, which is \(\int 0 \mathrm{p}^{*} \mathrm{p} \mathrm{f}(\mathrm{p}) \mathrm{F}\left(\mathrm{p}^{*}\right) \mathrm{dp}\). This has the interpretation of the average price conditional on that price being less than p*. This is because f(p) F(p*) is, in fact, the density of the random variable which is the price given that the price is less than p*. The second term is c F(p*) . This is the expected search cost, and it arises because 1 F(p*) is the expected number of searches. This arises because the odds of getting a price low enough to be acceptable is F(p*). There is a general statistical property underlying the number of searches. Consider a basketball player who successfully shoots a free throw with probability y. How many balls, on average, must he throw to sink one basket? The answer is 1/y. To see this, note that the probability that exactly n throws are required is \((1-y)^{n-1}\) y. This is because n are required means that n – 1 must fail (probability (1 – y)^n–1) and then the remaining one goes in, with probability y. Thus, the expected number of throws is

\[y + 2(1-y)y + 3 (1-y) 2 y + 4 (1-y) 3 y+…=y(1 + 2(1-y) + 3(1-y) 2 + 4 (1-y) 3 +…)=y( (1 + (1-y) + (1-y) 2 + (1-y) 3 +…)+(1−y)(1 + (1-y) + (1-y) 2 + (1-y) 3 +…)= (1−y) 2 (1 + (1-y) + (1-y) 2 + (1-y) 3 +…)+ (1−y) 3 (1 + (1-y) + (1-y) 2 +…)+…=y( 1 y +(1−y) 1 y + (1−y) 2 1 y + (1−y) 3 1 y +… )= 1 y . \nonumber \]

Our problem has the same logic—where a successful basketball throw corresponds to finding a price less than p*.

The expected total cost of purchase, given a reservation price p*, is given by \( J(p*)= ∫ 0 p* pf(p)dp +c F(p*) .\)

But what value of p* minimizes cost? Let’s start by differentiating

\[J ′ (p*)=p* f(p*) F(p*) − f(p*) ∫ 0 p* pf(p)dp +c F (p*) 2= f(p*) F(p*) ( p*− ∫ 0 p* pf(p)dp +c F(p*) )= f(p*) F(p*) ( p*−J(p*) ). \nonumber \]

Thus, if p* < J(p*), J is decreasing, and it lowers cost to increase p*. Similarly, if p* > J(p*), J is increasing in p*, and it reduces cost to decrease p*. Thus, minimization occurs at a point where p* = J(p*).

Moreover, there is only one such solution to the equation p* = J(p*) in the range where f is positive. To see this, note that at any solution to the equation p* = J(p*), J ′ (p*)=0 and

\[J ″ (p*)= d dp* ( f(p*) F(p*) ( p*−J(p*) ) )=( d dp* f(p*) F(p*) )(p*−J(p*))+ f(p*) F(p*) (1− J ′ (p*))= f(p*) F(p*) > 0 \nonumber \]

This means that J takes a minimum at this value, since its first derivative is zero and its second derivative is positive, and that is true about any solution to p* = J(p*). Were there to be two such solutions, J ′ would have to be both positive and negative on the interval between them, since J is increasing to the right of the first (lower) one, and decreasing to the left of the second (higher) one. Consequently, the equation p* = J(p*) has a unique solution that minimizes the cost of purchase.

Consumer search to minimize cost dictates setting a reservation price equal to the expected total cost of purchasing the good, and purchasing whenever the price offered is lower than that level. That is, it is not sensible to “hold out” for a price lower than what you expect to pay on average, although this might be well useful in a bargaining context rather than in a store searching context.

Example (Uniform): Suppose that prices are uniformly distributed on the interval [a, b]. For p* in this interval,

\[J(p*)= ∫ 0 p* pf(p)dp +c F(p*) = ∫ a p* p dp b−a +c p*−a b−a= ½(p * 2 − a 2 )+c(b−a) p*−a =½(p*+a)+ c(b−a) p*−a . \nonumber \]

Thus, the first-order condition for minimizing cost is \(0=J^{\prime}\left(p^{*}\right)=1 / 2-c(b-a)\left(p^{*}-a\right) 2\), implying \(p^{*}=a+2 c(b-a)\).

There are a couple of interesting observations about this solution. First, not surprisingly, as c → 0, p* → α; that is, as the search costs go to zero, one holds out for the lowest possible price. This is sensible in the context of the model, but in real search situations delay may also have a cost that isn’t modeled here. Second, p* < b, the maximum price, if 2c < (b – a). In other words, if the most you can save by a search is twice the search cost, then don’t search, because the expected gains from the search will be half the maximum gains (thanks to the uniform distribution) and the search will be unprofitable.

The third observation, which is much more general than the specific uniform example, is that the expected price is a concave function of the cost of search (second derivative negative). That is, in fact, true for any distribution. To see this, define a function \(H(c)=\min p^{*} J\left(p^{*}\right)=\min p^{*} \int 0 p^{*} p f(p) d p+c F\left(p^{*}\right)\). Since \(\mathrm{J}^{\prime}\left(\mathrm{p}^{*}\right)=0, \mathrm{H}^{\prime}(\mathrm{c})=\partial \partial \mathrm{c} \mathrm{J}\left(\mathrm{p}^{*}\right)=1 \mathrm{F}\left(\mathrm{p}^{*}\right)\)

From here it requires only a modest effort to show that p* is increasing in c, from which it follows that H is concave. This means that there are increasing returns to decreasing search costs in that the expected total price of search is decreasing at an increasing rate as the cost of search decreases.

Key Takeaways

• For many goods, prices vary across location and across time. In response to price variation, consumers will often search for low prices.
• In many circumstances the best strategy is a reservation price strategy, where the consumer buys whenever offered a price below the reservation price.
• Consumer search to minimize cost dictates setting a reservation price equal to the expected total cost of purchasing the good, and purchasing whenever the price offered is lower than that level.

EXERCISE

1. Suppose that there are two possible prices, one and two, and that the probability of the lower price one is x. Compute the consumer’s reservation price, which is the expected cost of searching, as a function of x and the cost of search c. For what values of x and c should the consumer accept two on the first search or continue searching until the lower price one is found?