Free Essay

Game Theory

In:

Submitted By unsalted
Words 9022
Pages 37
American Economic Association

Auctions Versus Negotiations Author(s): Jeremy Bulow and Paul Klemperer Source: The American Economic Review, Vol. 86, No. 1 (Mar., 1996), pp. 180-194 Published by: American Economic Association Stable URL: http://www.jstor.org/stable/2118262 Accessed: 14/10/2008 10:06
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/action/showPublisher?publisherCode=aea. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit organization founded in 1995 to build trusted digital archives for scholarship. We work with the scholarly community to preserve their work and the materials they rely upon, and to build a common research platform that promotes the discovery and use of these resources. For more information about JSTOR, please contact support@jstor.org.

American Economic Association is collaborating with JSTOR to digitize, preserve and extend access to The American Economic Review.

http://www.jstor.org

Auctions Versus Negotiations
By JEREMYBULOW AND PAuL KLEMPERER* Which is the more profitable way to sell a company: an auction with no reserve negotiation with one less bidder? Weshow under price or an optimally-structured reasonable assumptions that the auction is always preferable when bidders' signals are independent. For affiliated signals, the result holds under certain restrictions on the seller's choice of negotiating mechanism. The result suggests that the value of negotiating skill is small relative to the value of additional competition. The paper also shows how the analogies between monopoly theory and auction theory can help derive new results in auction theory. (JEL D44, G34) There are close analogies between standard price theory and the theory of auctions. In an absolute English auction, in which the price rises continuously until only one bidder remains and the seller is required to accept the final bid, the sale price equals the lowest competitive price at which supply equals demand. In the theory of optimal auctions the seller is treated as a monopolist who can choose any mechanism, such as establishing a minimum sale (or reserve) price, to maximize expected profit.As in monopoly theory, optimal auction theory assigns all bargaining power to the seller, subject to the constraint that she does not have access to buyers' private information about an asset's value. This paper shows how the analogies between monopoly theory and auction theory can help derive new results in auction theory. Specifically, we are able to put a fairly tight bound on the value of any seller's bargaining power: a seller with no bargainingpower who can only run an English auction with no reserve price among N + 1 symmetric bidders will earn more in expectation than a seller with all the bargaining power, including the ability to make binding commitments, who can hold an optimal auction with N buyers. This is true under standardassumptionsif buyers have private values, common values, or something intermediate.No amount of bargainingpower is as valuable to the seller as attractingone extra bona fide bidder. Since the informational demands for computing optimal mechanisms are substantial, and the computations involved are complex, this result suggests that it will often be more worthwhile for a seller to devote resources to expanding the market than to collecting the information and making the calculations required to figure out the best mechanism.' Our analysis also has policy implications for when the directorsof a public company should be allowed to privately negotiate its sale. Our result shows that a single extra bidder more than makes up for any diminution in negotiating power. This means that there is no merit in arguments that negotiation should be restricted to one or a few bidders to allow the seller to maintain more control of the negotiating process, or to credibly withdraw the company from the market.2

* Bulow: GraduateSchool of Business, Stanford University, Stanford, California 94305; and Klemperer:Nuffield College, Oxford University OXI 1NF, United Kingdom. We thank colleagues at Oxford University and Stanford Business School, seminar audiences, and especially Preston McAfee, Margaret Meyer, John Roberts, Lawrence Summers, and our referees for valuable comments. 180

' Similarly, in a procurementcontext, competitive bidding by suppliers will yield lower average prices than negotiating with a smaller number of suppliers. See R. Preston McAfee and John McMillan (1987b) for examples. More broadly, our results are supportive of the view that optimal regulation of an industry may be less important than attractingadditional entry. 2 Opening negotiations with additional bidders makes

VOL. 86 NO. I

AUCTIONS VS. NEGOTIATIONS BULOW AND KLEMPERER:

181

Similarly, a seller should not accept any "lock-up" agreement that a buyer is willing to offer in return for the seller not beginning negotiations with additional potential acquirers. For example, in late 1993 Paramount agreed to sell itself to Viacom, knowing that QVC was interestedin bidding for Paramount. Paramount and Viacom agreed to terms that gave Viacom options to buy 24 million shares of Paramountand a $100 million break-upfee in the event that any other company were to purchase Paramount.The boards argued that in return for effectively excluding other bidders, Paramounthad been able to negotiate a higher price than it could have expected in an open auction. QVC contested the terms of the deal, contending thatholding an auction would have been the appropriateway to maximize shareholder value. The Delaware courts subsequently agreed with QVC. Our analysis supports that decision.3 We begin in Section I by developing the intuition for our results, and informally deriving them in the simple and familiar case of buyers with independent private values. We develop our general model in Section II. We extend Bulow and John D. Roberts's (1989) interpretation of auctions, based on marginalrevenues, from their independentprivate values model to this general model. We use this to show (Theorem 1) that an English auction with N + 1 bidders but no reserve yields higher revenue in expectation than an English auction with N bidders, culminating

with a final optimal take-it-or-leave-it offer to the last remaining bidder. Under mild assumptions, this result holds regardless of whether bidders' signals are independent or affiliated.4 We then show (Theorem 2) that with N riskneutral bidders with independent signals, it is optimal for the seller to use the N-bidder mechanism described above, with a final offer that generally depends on the prices at which the low bidders dropped out. With independent signals and risk-neutral bidders, therefore, an auction with N + 1 bidders dominates any negotiation with N bidders. With affiliated (but nonindependent) signals an English auction plus final take-it-orleave-it offer does not maximize expected revenue among all conceivable selling mechanisms, but it does maximize expected revenue subject to some restrictionson the seller's choice of mechanism.' It therefore remains true that an auction with N + 1 bidders beats any standard mechanism for selling to N bidders.6'7

it harderto use negotiating tactics such as credibly threatening not to sell if the bidders' offers are too low. If a board approaches many bidders, it may be legally forced to hold an open auction and cede its power to control the form of negotiations, see e.g., Jesse H. Choper et al. (1989). In any event, the business of a company whose future ownership is thought to be uncertain may be damaged until the question of ownership is resolved so it may be hard to credibly withdraw the company from the market. See, e.g., Andrei Shleifer and Robert W. Vishny (1988). 'Under dominant U.S. takeover law, a company can negotiate its sale to a purchaser and decline to hold an auction if (i) the board is acting in good faith to maximize shareholdervalue and has conducted a reasonable investigation of whether the price is adequate, and (ii) the price attainedthroughnegotiations was high enough to be worth the cost of any lock-up provisions and other prohibitions necessary to secure the offer.

' Signals are affiliated if, as a bidder's signal rises, he expects others' signals to rise as well, in the sense that higher values for other bidders' signals become relatively more likely. See Paul Milgrom and Robert J. Weber (1982). ' Giuseppe Lopomo (1995) shows that the English auction plus reserve price maximizes the seller's expected profit in Milgrom and Weber's (1982) "general symmetric model" among all mechanisms where losers do not pay anything and in equilibrium the winner (if anyone) is the bidder with the highest signal and his payments are weakly increasing in his own signal for any realization of other bidders' signals. 6 The results of the one-shot seller-optimal mechanismdesign literature extend straightforwardly to dynamic games in which the seller's discount rate is at least as high as the buyers', so a seller cannot do better in any multiperiod game than in the one-shot game. (Using delay is simply equivalent to a commitment to not sell with some probability-see, for example, Peter C. Cramton [1985] and Milgrom [1987].) If the seller's discount rate is lower than the buyers', then screening over time can allow the seller to extract a larger surplus than one can obtain from a one-shot mechanism. In the extreme case in which the seller does not discount the future at all and the buyers do, then the seller should run an extremely slow "Dutch" auction, in which the price begins high and is gradually reduced, and this will extract arbitrarilyclose to all surplus. We do, however, ignore any time costs of accumu-

182

THE AMERICANECONOMICREVIEW

MARCH 1996

We also note that if a seller could negotiate with N bidders while maintaining the right to subsequently hold an English auction without a reserve price and with an additional bidder, the seller would always do better to proceed directly to the auction. Thus a seller should generally focus on maximizing the number of bidders, and should refuse to bargainwith bidders who wish to preemptthe auction process.8 Finally we extend our result to multiple units and show that the price-theoretic analogy of this extension gives an interesting result about the value to firms of restricting competition relative to the value of expanding demand.
I. An Example with Independent Private Values

We begin with a simple problem and then generalize. Seller A has one "serious" potential buyer, with a value that is at least as high as the seller's. For example, A's value is zero

lating buyers, and any differences in the costs of running different sales mechanisms. See Ruqu Wang (1993). 'We do not analyze how the number of bidders may be affected by a firm's choice of mechanism. However, a public auction may not only attractextra bidders through the extra publicity, but may also attract more bidders if bidding is costly. For example, with symmetric bidders who simultaneouslydecide whether or not to pay the costs of participatingin an auction before learning their signals, an auction with a reserve price may attractfewer bidders than an auction without reserve. Our analysis will speak directly to this case. On the other hand, with sequential entry of potential bidders who decide in turn whether or not to pay the costs of acquiring a signal and then making a bid, bidders may make preemptive bids to make it unprofitablefor any future bidder to enter. In this case, there is no trade-off between using a reserve price and attracting bidders: a higher reserve price earns more money because it both allows the seller to extract rents and increases the expected numberof buyers who will participateby making a preemptive bid more difficult. See McAfee and McMillan (1987a). For further analysis of optimal seller strategies with costly bidder participation, see Richard Engelbrecht-Wiggans(1993), McAfee and Daniel Vincent (1992), and Shleifer and Vishny (1986). 8 We assume a single seller, interested only in expected revenue, so in the context of selling a company we are abstracting from issues such as shareholders' individual incentives to sell (see, e.g., Sanford J. Grossman and Oliver D. Hart, 1980; David Hirshleifer and Sheridan Titman, 1990; and Bengt Holmstrom and Barry Nalebuff, 1992), or management's interest in retaining control (see, e.g., Milton Harris and Artur Raviv, 1988).

and the buyer's value, which is private information to the buyer, is drawn from a uniform distribution on [0, 1]. Both parties are risk neutral. It is easy to show that the optimal strategy for A in negotiating with her buyer is to offer a take-it-or-leave-it price of .5; the offer will be accepted half of the time, yielding an expected profit of .25. Seller B also has a value of 0, but differs from A in two respects: first, she has two "serious" bidders, each with private values drawn independently on [0, 1]; second, she may hold only an English auction with no reserve.9In this auction, the expected profit to the seller will be the expectation of the lower of the two bidders' values, which is the point in the auction where the lower bidder will drop out. That expected profit is 1/3, so the extra bidder is worth more than the reserve price. How can we generalize this result? The difficulty can be illustrated in our numerical example. It is clear that in some cases (namely those when the first bidder's value is greater than or equal to .5, and the second bidder's value is less than .5 ) the reserve price is worth more ex post than the second bidder, but in all other cases the seller is betteroff with the extra bidder. The question is whether there is some way to group the potential cases so that the seller with two bidders does better in expectation within every subgrouping,and therefore better on the whole. The most naturalthing to try is to divide up the cases into those where the first bidder has a value above the reserve price of .5 and those where the first bidder's value is below .5. At first glance, this methodology does not work, even in our simple numerical example. Contingent on the firstbidderhaving a value below .5, of course the seller with two bidders and no reserve price will earn more than the seller

9Throughout the paper, an English auction is an auction in which the price rises continuously until only one bidderremains. At every price all biddersknow how many other bidders remain active. A reserveprice is a minimum price below which the object will not be sold. (In an auction with a reserve price the seller makes a final take-itor-leave-it offer equal to the reserve price to the final bidder, if the final bid is below the reserve price.) An absolute auction is an auction with no reserve price; that is, the seller is requiredto accept the final bid.

VOL. 86 NO. I

BULOW AND KLEMPERER: AUCTIONS VS. NEGOTIATIONS v(tj) MR(t,)

183

with one bidder (who will earn zero). But contingent on the first bidder having a value between .5 and 1, expected revenue will be .5 with the reserve price and 11/24 with the extra bidder.10 Clearly, we need to use something other than expected values to establish superiority for the auction. What we do is borrow a trick from monopoly theory. Consider a seller with constant marginal costs of zero, and a linear demand curve of p = 1 -q , How do we know that .5 is the optimal price and quantityfor the seller? If the seller chooses a quantityof .4 and a price of .6, for example, she will earn more revenue from the .4 buyers who actually purchase than if she only charges .5, so there is no direct dominance. Similarly, if a price of .4 is chosen the seller earns less from the first .5 customers, but there is that extra revenue from the last .1. The way we establish superiority for the quantity of .5 over the alternativesis by looking at marginal revenues instead of prices. Marginal revenue equals zero at a quantity of .5. By selling .5 units, the seller earns the same positive marginalrevenues on the first .4 units as a seller of only .4, plus some extra positive marginalrevenues on the next .1 sales. Selling .5 is better than selling .6, because by selling .5 you earn the same positive marginal revenues on the first .5 units, and eliminate the negative marginal revenues on the last .1. By looking at something like marginal revenues we can establish the superiority of the twobidder auction in our initial problem.1" Assume that bidderj receives a private signal tj which is distributedwith a densityf(tj) and a cumulative density F(tj), independent of other bidders' signals, and implies a private value of v(tj). Graph value, v(tj), against 1 - F(tj). In terms of our "quantity," q(tj) numerical example, the picture produced is an "inverse-demand curve" of p = 1 - q. As Figure 1 shows, the quantity of (expected)

MR(t,)

-

\

q= 1 -F(t,)

FIGURE

1.

DEMAND AND MARGINAL REVENUE CURVES FOR ONE BIDDER IN OUR EXAMPLE

sales will be zero at a price of v(tj) = 1, increasing linearly to one (expected) sale at a price of v(tj) = 0. Defining revenue as price times quantity,we can also derive marginal revenue in the usual way,

d MR (tj) dq( t) [v(tj) q(tj)
-1 d = f(j) d~ [v(tj)[1 - F(tj)]], and graph marginal revenue against quantity of expected sales. In our example, the marginal revenue curve from our demand curve is MR = 1 - 2q. Note that the sales probability that is optimal for the seller with one bidder (and the optimal take-it-or-leave-it price) can be found where MR equals zero, at q = .5 and p = .5.

'?The expectation of the lower of two values, one of which is known to exceed 1/2, is 11/24. " The interpretationof auctions in terms of marginal revenues follows Bulow and Roberts (1989). The current paper shows how to extend this interpretationfrom the independent private values model to the general case.

Why? Just as the revenue from a take-it-orleave-it price can be calculated by multiplying that price by the probability of sale at that price, expected revenue can also be found by taking the area under the MR curve for all the values in excess of the take-it-or-leave-itprice. Obviously, the optimal take-it-or-leave-itprice

184 v(tj) MR(tj)

THE AMERICANECONOMICREVIEW

MARCH 1996

1

v(tj).

X~~~~~~v(j
MR(tj)

O

l-F(tj)\

~

1 q ~~~~~~ -F(ti)

FIGURE 2. THE EXPECTATION OF MR(tj), CONDITIONAL ON tj 2 t,, EQUALS THE AREA UNDER THE MR(tj) CURVE FROM q = 0 TO q = 1 - F(tj), DIVIDED BY 1 -F(tj: THIS MUST EQUAL v(ti)

must be equal to her selling price. For example, in our numerical example, if v ( ti ) = .6 the MR of the winner might be anywhere from .2 to 1, but on average it will be .6. This implies that for any v ( ti), the expected revenue of the seller can be described as the expected MR of the winning bidder. Averaging over all possible values for v ( ti ), therefore, the seller' s expected revenue equals the expected MR of the winning bidder. Now add a conventional auction theory/monopoly theory/mechanism design assumption: assume that the MR curve is downward sloping. This implies that the buyer with the higher value, who is the one who will actually win the auction, is also the buyer with the higher MR. If the seller's expected revenue is the expected MR of the winning bidder, and the winning bidder always has the higher MR of the two bidders, then the expected revenue from the auction can be written as the expectation of the maximum of the marginal revenues of the two bidders, call it Expected Revenue (auction with two)

is where MR = 0. The seller may be thought of as receiving, in expectation, the MR of the buyer when it is positive, and zero when the buyer's MR is negative. Put slightly differently, expected revenue may be thought of as the expectation of the maximum of the MR of the bidder and zero. Now let's move on to the problem of seller B, who holds an auction between two bidders. Assume that the "underbidder" has a value of v ( ti ) and the eventual winner has a value v ( tj). We do not learn the value of v(tj) in the auction, but it is greater than or equal to v(ti). Consider the graph with the same demand curve and marginal revenue curve as before, and mark a point on that curve as v(ti ) (see Figure 2). Contingent on the underbidder's value being v ( ti ), we know that the seller will earn exactly v(ti ) in the auction, but it will be more useful to express the seller's winnings in terms of marginal revenue. What is the expected MR associated with the winning buyer, conditional on the selling price being v ( ti ) ? It is obviously v(ti,), by the same simple math as we use to show that the average marginal revenue associated with a monopolist' s customers

= Et max(MR(tl), MR(t2)) } .
This may be compared with the expectation from the one-bidder mechanism, Expected Revenue (optimal mechanism with one) = E { max(MR(tl), 0) }. Now compare the right-hand sides of the two expressions above in the cases where the first bidder's value exceeds the optimal reserve price, so that MR(tj) 2 0. It is obvious that contingent on that, the first expression is larger.12 But what about if MR(tj) < O?Here
12 Of course, as demonstratedabove, it does not follow that contingent on MR(t,) 2 0,

Expected Revenue (auction with two)
> Expected Revenue (optimal mechanism with one).

Likewise, a monopolist's actual revenue from a subset of the buyers sold to does not equal the sum of the marginal revenues of these buyers.

VOL. 86 NO. I

BULOW AND KLEMPERER: AUCTIONS VS. NEGOTIATIONS

185

is where our "serious-bidder" assumption, thatboth potential biddershave a value at least equal to the seller's value of zero, comes in to play. What is the expectation of MR(t2)? Since the lowest possible value of v (t2) is zero, it must be that the expectation of MR(t2) equals zero. In demand-curve terms, if we set a price of zero, then total revenue, and therefore also the average MR of all buyers, must be zero. So if MR(tj) < 0, then the second expression is zero, while the first expression is the expectation of the maximum of two terms, one of which has an expected value of zero. Again, therefore, the first expression is larger, so we have now established the auction's dominance. The need for our serious-bidderassumption should be quite clear. Assume that there is a probability 1 - p that the second bidder values the asset below zero, and that the second bidder is otherwise drawn from the same distribution as the first bidder.1"Then the second bidder will be worth only p times as much to the auction seller as if it were certain that the second bidder had a value above zero.14 In the limit where p approacheszero, the extra bidder would be of virtually no use, and a reserve price would dominate. In our numerical example, we would require p 2 .75 for the auction to be at least as good as the reserve price.15 It is easy to extend the analysis to compare a seller with N (symmetric) bidders in an auction and a reserve price to one with N + 1 bidders and no reserve price. By exactly the same analysis as in the one- and two-bidder

We could also assume that there is a probability of p that the first bidder has a value below zero to maintain symmetry, but since neither sales mechanism yields any profitwhen the firstbidder'svalue is below zero, we can restrictourcomparisonto cases wherethe first-bidder's value is at least zero. 14 We assume that the seller who runs an auction can demand a minimum price of zero. '5 Without the serious-bidder assumption, if there are enough extra bidders that in expectation the secondhighest extra bidder has a value of at least zero (and their MRs are downward sloping), then it follows that the expectation of the highest MR of the extra bidder is at least zero, so that the extra bidders are more valuable than the reserve price in expectation, even if the seller is not allowed to insist on any minimum price, and may therefore be sometimes obligated to sell at a loss.
'3

-

case, the expected revenue from an auction with N bidders and an optimal reserve price is equal to the expectation of the maximum of (MR(tj), MR(t2), ... , MR(tN), 0) while the expected revenue from an auction with N + 1 bidders is equal to the expectation of the maximum of (MR(tj), MR(t2), ... , MR(tN+ l)). Since the expectation of MR(tN+ I) is equal to zero, it is clear that the auction with the extra bidder yields a higher expected revenue. We have now gone pretty far while relying on only elementary mathematics.Since it is a standardresult that an auction with an optimal reserveprice is an optimalmechanismif bidders are symmetric and risk neutral and have independent private values and downward sloping MRs (John G. Riley and William F. Samuelson, 1981; and Roger B. Myerson, 1981), we have alreadyshown that,underthese assumptions,an auction with N + 1 bidders is superiorto any mechanisminvolving N buyers. The above discussion assumed that bidders have independent private values. In fact, the argument that the expected revenue from an absolute English auction equals the expected MR of the winning bidder applies very generally. Similarly it is a very general result that the expected revenue from an English auction with an optimal reserve price equals the expectation of the maximum of the highest bidder's MR and zero. The difficulty is that in a general model bidders' values and MRs are not independent of other bidders' private signals. Conditional on the first N bidders having low MRs, the expected MR of the (N + 1) st bidder is also low. Furthermoresince, we will show, to compute an English auction's expected revenue each bidder's MR must be calculated based on the information that the auction will reveal, a bidder's relevant MR in an N-bidder auction is differentthan in an N + 1 bidder auction. Nevertheless the method of proof outlined above can be developed to show that an extra bidder is worth more than an optimal reserve price if either bidders' values are private or bidders' signals are affiliated."6It then follows easily that an auction

16 See note 4 for an informal definition of affiliation, and the proof of Theorem 1 for the relevant implications

186

THE AMERICANECONOMICREVIEW

MARCH 1996

with N + 1 bidders and no reserve price is more profitable than any standardmechanism with N bidders. II. The GeneralModel In our general model, bidders' private signals need not be independent, and bidders' values may be either private or common, or something intermediate."7 Let tj be bidderj's private signal about the value of the asset. Without loss of generality, normalize so that 0 c tjc 1 Vj, and normalize the seller's value of the object to zero. We write T to representthe vector (tl, ... , tN +?l T_j to representall of the elements of T other than tj, and define T T-(N+ 1), and T_j as all the elements of T other than tj. We writef( tjIT_j) for the conditional density of tjgiven T_ j, and F(tj IT_j) for the probability that the jth signal is less than or equal to tj given T_j. More generally, we write f (x Iy) for the conditional density of x given y, and F(x Iy) for this conditional distribution. We assume f(tj IT_j) is positive and finite for all tj and T_j. Let vj(T) be the value of the asset to bidder j as a function of the vector of signals T, and let vj(T) - Et+,{vj(T)} = vj(T )f(tN?+ I T )dtN+ I be the expectation of vj(T) conditional on T. Higher signals imply higher expected values, so &vj(T)/0tj > 0, &vi )/Otj 2 O, and tj > ti = vj(T ) 2 vi (T ) (T Vi, j, T. In the special case of private values,

vi (T) is a function only of ti, while in the special case of pure common values vi (T) = vj(T ) Vi, j, T. So that seller revenue is bounded, we assume vj(T) c v* < ooVj, T. While tj is private information to bidder], the functions vj(T ) andf(tj IT-j) are common knowledge. We assume that all agents are risk neutral, though this is not necessary for Lemma 1 or Theorem 1. Finally, we define MRj(T)
-

f( IT 1) yd [vj(T)[1 -F(tjlTj)]]

-1

d

and MRj(T) -1 d

f (tj; T_j) dtj v()[1Ft|T_j]] The interpretations the marginalrevenues of MRj and MRj are exactly as in Section I: graphically, if we plot vj(T) against quantity 1 - F(tjI T_j) for any bidder, varying only tj, we will have a downward-sloping demand curve. If we think of that graph as the demand curve of buyer j, with the quantity being the probabilitythat the buyer would accept a takeit-or-leave-it offer at any given price if he knew the signals of all the other bidders, then the MRj curve is just the marginal-revenue curve derived from that demand curve. Similarly, the MRj curve is derived from the graph of ivj(T) against 1 - F(tj IT_j), for a buyer who knows the signals of all the other buyers except the N + 1st.'8 We maintain the following assumptions throughout: (A.1) Downward-Sloping MR: tj > ti MRj(T) > MRi (T) and MRj(T) > MRi (T). (A.2) Serious Bidders: v1(T) 2 0 Vj, T.

for our model. For the private values auction-with-two vs. reserve-price-with-one case the argument is easily extended to affiliated signals: the seller's revenue from the auction equals the lower of the two values, which equals the average of the values minus half their difference. Affiliation leaves the average the same but reduces the difference, so it further increases expected seller revenue above the expected revenue from a single bidder plus a reserve price. In the general case, if the extra bidder's signal is affiliated with other bidders' signals, this effectively reduces the amount of private information available to each bidder, thus reducing the "information rent" earned by the winning bidder, and so increasing the value to the seller of the additional bidder, relative to the value of a reserve price. " Our model is essentially that of Milgrom and Weber (1982), although we do not always impose their affiliation assumption.

8 Note that MR,(T) is not in general the expectation of MR,(T) unless bidders' signals are independent.

VOL. 86 NO. I

BULOWAND KLEMPERER: AUCTIONS VS. NEGOTIATIONS

187

(A.3) Symmetry: Bidders' value functions are symmetric, so vi (t,, ..., ti, ..., ti, ... ) = vj(t,, ... , tj, ...,I ti ..)Vi, j, T, bidders' signals are symmetrically distributed,and bidders choose symmetric strategies.19 Assumption (A.1) is a standard regularity condition in auction theory, analogous to an assumption a downward-sloping of marginalrevenue curve in monopoly theory. Assumption (A.2) ensures that every bidder is willing to make an opening offer of zero, the seller's value, in an absolute English auction. Assumption (A.3) ensures that the bidder with the highest signal always wins such an auction.20 A. Expected Revenuefrom Auctions We now follow the strategy used in Section I to develop our main theorem. All proofs are provided in the Appendix. LEMMA 1: The expected revenue from an absolute English auction with N + 1 bidders equals ET{max(MR, (T), MR2(T), MRN 1(T)) }. + LEMMA 2: The expected revenue from an English auction with N risk-neutral bidders followed, after the N - 1 low bidders have quit, by an optimally chosen take-it-or-

leave-it offer to the remaining bidder, equals ET{max(MR, (T), MR2(T), ..., MRN(T),
0)
}.

The proofs of these two lemmas straightforwardly follow the arguments of Section I; as with independent private values, the optimal take-it-or-leave-it final offer is the maximum of the price at which the last losing bidder quits, and the price at which the winner's marginal revenue would equal zero.2' In the general case, however, each bidder's marginal revenue depends on all other bidders' signals, so the optimal final offer can only be determined after all the losing bidders' signals have been inferred from the prices at which they quit the auction. This can explain why it is common for a seller to announce a reserve price only at the end of the auction.22 THEOREM 1: Expected revenue from an absolute English auction with N + I bidders exceeds expected revenue from an English auction with N biddersfollowed by a take-itor-leave-it offer to the last remaining bidder if either (i) bidders' values are private; or (ii) bidders' signals are affiliated.23 Just as for our independent private values example, the proof considers separately the

'9 That is, in an absolute English auction each bidder's equilibrium strategy is to drop out of the bidding at the price he would just be willing to pay given the actual signals of the bidders who have alreadydroppedout (in equilibrium their signals can be inferred from where they dropped out) and assuming all the remaining active bidders (whose signals he does not know) have signals equal to his own. (To see this, observe that if all other bidders follow this rule, a bidder is happy (unhappy) to find himself the winner at any price below (above) this stopping price; in the special case of pure privatevalues each bidder just drops out at his own value.) Note that Sushil Bikhchandani and Riley (1993) show that there may be other (asymmetric) equilibria. 20 If bidder signals are negatively correlated,then (A. 1) is less likely to hold than with independent signals. (A.2) is less likely to apply in a common-values setting thanwith private values. For furtherdiscussion of the importanceof the assumptions see sections 9 and 10 of our working paper, Bulow and Klemperer (1994a).

2' Strictly, bidders with very low signals may be indifferent about participatingsince they might know that they would never meet the seller's take-it-or-leave-it price. However, the seller can induce all bidders to participate at an arbitrarilysmall cost in expected revenue by committing to foregoing the take-it-or-leave-it offer with a probability approachingzero and to always accepting the highest bid in this event. Note also that, strictly speaking the rule by which the seller's final take-it-or-leave-itoffer will be determined must be precommitted to before the bidding. Otherwise there is in theory the possibility of other symmetric equilibria that are less profitable for the seller. For example, it is a sequential equilibrium that every bidder drops out at a certain price; if any bidder stays, that bidder is believed to have the highest possible signal and is offered a very high final price. 22 Of course, a seller should also not commit to a reserve price until the end of the auction. Many auction houses seem to commit to secret reserve prices before auctions, but there are often further subsequent negotiations if an object is unsold at its reserve price. 23 Note that independent signals are affiliated.

188

THE AMERICANECONOMICREVIEW

MARCH 1996

cases in which the highest of the first N bidders, say bidder j, has a positive or negative MRj, that is his value exceeds or does not exceed the optimal reserve price (i.e. take-it-orleave-it offer) that would be set contingent on the other N - 1 of the first N signals. As before, when there would be no sale the expectation over tN+ I of MRN+I equals bidder N + I's lowest possible value, which equals or exceeds zero by the "serious bidder" assumption. When there would be a sale, affiliation implies that the expectation (over tj and tN+ 1) of MRj is greater than or equal to the expectation (over tj) of MRj, contingent on the other N - 1 signals and on a sale. With either sale or no sale, then, the expectation of the maximum of MRJand MRN+ exceeds in expectation the maximum of MRj and 0. The difference between MRj and MRj, which means that affiliation reinforces our result that auctions beat negotiations, is exactly the difference that implies that with three or more bidders an open ascending English auction is more profitable than a sealed-bid second-price auction (see Milgrom and Weber, 1982).24

B. Auctions versus Optimal Mechanisms Lemma 3 extends to general value functions Myerson's (1981) theorem, that with independent signals and risk-neutralbidders, any two mechanisms that always result in the same winning bidder are revenue equivalent. (Myerson considers only common values in which players' values are additive functions of signals.) We also reinterpretMyerson's "virtual utilities" as marginal revenues.25 LEMMA 3: With independent signals and N risk-neutral bidders, the expected revenue from any sales mechanism equals the expectation of the marginal revenue of the winning bidder, provided any bidder with the lowestpossible signal expects zero surplus; the marginal revenue of the winning bidder is MRj(T) if j is the winner and is taken to be zero if the good is retained by the seller. Clearly no sales procedure with voluntary participationcan earn greater profits than one in which bidders with the lowest possible signals ex'pect zero surplus.26A corollary of Lemma 3, therefore, is that the mechanism of Lemma 2-which always sells to the bidderj for whom MRj(T) is largest if that value is greater than zero and makes no sale otherwise- is optimal with risk-neutralbidders and independent signals, under our assumptions (A.1)-(A.3): THEOREM 2: Withindependentsignals and N risk-neutralbidders, an optimal mechanism for a risk-neutral seller is an English auction followed by an optimally-chosen take-it-orleave-it offer to the last remaining bidder. Theorems 1 and 2 together imply the main point of our paper:

24 In the sealed-bid auction with three bidders the bidder with the second-highest signal, who determines the price, bids his expected value assuming that he is tied with the highest signal, and estimates the distribution of the third signal based on this assumption. This bid equals the lowest-possible expected value of the winner, say j, that is, equals the expectation (over t,) of MR,. In an open auction the second-highest bidder chooses his dropout price by assuming that he is tied with the highest signal and based on the actual third signal which he infers assuming equilibrium behaviour-see note 19. His final bid therefore equals the lowest-possible actual value of the winner, that is, the expectation (over t,) of MR,, and affiliation implies the expectation of this bid exceeds the sealed bid. In our context, the expectation (over tj) of MR, equals the lowest expected value j could have, and ifj has the lowestpossible signal he will estimate the distribution of tN+ X based on this. However the expectation (over t, and tN+ I) of MR, equals the expectation (over tN+ ,) of the lowest value j could have given the actual tN+ ,. Affiliation implies the distributionof the actual tN+I stochastically dominates the distribution of tN+ I contingent on j having the lowest possible signal, so the expected MR exceeds the expected MR1.

25 Special cases of Lemma 3 and Theorem 2 have been independently obtained by Fernando Branco (1994) and Lopomo (1995). 26 No sales procedure can give any type of any bidder a negative surplus, and giving the lowest type a positive surplus would require raising all other types' surpluses. See the proof of Lemma 3.

VOL 86 NO. I

AUCTIONS VS. NEGOTIATIONS BULOW AND KLEMPERER:

189

COROLLARY: Withindependentsignals and risk-neutralbidders, an absolute English auction with N + 1 bidders is more profitable in expectation than any negotiation with N bidders. Of course, to the extent that it is unrealistic to expect a seller to be able to commit as firmly as is needed for the optimal mechanism, and to compute the optimal reserve price, the Corollary's statement about the auction's superiority is conservative. When buyers' signals are nonindependent, the mechanism described in Theorem 2 is not optimal, and a seller who can choose any mechanism can generally extract all bidders' surplus (see Jacques Cremer and Richard McLean, 1985; McAfee et al., 1989; and McAfee and Philip J. Reny, 1992). When a seller can extract all surplus from N bidders, it is not hard to show that this will always dominate an absolute auction with N + 1 bidders. However, Lopomo (1995) has shown that with affiliated signals and risk-neutral bidders expected revenue from the mechanism of Theorem 2 is higher than from any other mechanism in which (i) losers do not pay and (ii) in equilibriumthe winner, if anyone, is the bidder with the highest signal and his payments are weakly increasing in his own signal for any realization of other bidders' signals.27 Thus it remains true that an absolute auction with N + 1 bidders is better than any standard mechanism for selling to N bidders. C. Negotiations Followed by an Auction A final question is: if a seller has N + 1 riskneutral bidders with independent signals, can she benefit by first negotiating with N of the bidders only, reserving the right to hold an absolute auction among all N + 1 bidders if the negotiations failed to produce a sale? The answer is no. The reason is that if the seller has the option of resorting to the auction, it will be obvious
27 So, for example, the mechanism of Theorem 2 is better than any of the English, Dutch, first-price sealed bid or second-price sealed bid auctions together with a reserve price. See Vijay Krishna and John Morgan (1994) for an analysis of auctions in which all bidders pay.

to all that if negotiations fail, there will be an auction. Viewing the two-stage process as a whole, then, the seller is constrainedto choose among mechanisms that always lead to a sale. But clearly any optimal mechanism that always sells must always sell to the buyer with the highest signal. Therefore, it will not be optimal to sell in the negotiation stage unless it is certain that the buyer's signal is greaterthan or equal to the signal of the (N + 1) th bidder. Therefore the seller should insist on a price in the negotiation phase that will only be accepted when a buyer gets the maximum signal of 1, which occurs with probability zero. Therefore, under our assumptions, the seller should not accept any high "lock-up" bid that a buyer may be willing to offer in return for not holding an auction with an additional buyer.28 D. Multiple Units Our model extends easily to a seller with K goods to sell and N 2 K symmetric bidders each interested in buying one unit. With independent signals, the optimal sales mechanism is to sell to the K bidders with the highest signals, provided MRi (T ) 2 0 for K or more bidders. Otherwise, sell only to those bidders for whom MRi (T) 2 0.29 The optimal mechanism yields expected revenue equal to the expected sum of the K highest values among MR, (T), ... ,MRN(T) and K zeros. It is not

28 This result would be unaffected by other bidders having costs of entering the auction. However, the presence of such costs can explain why bidders may jump bid to deter competitors from entering; see Michael J. Fishman (1988) and Hirshleifer and Ivan P. L. Png (1989). See also Christopher Avery (1993), Kent Daniel and Hirshleifer (1993), and Nils Henrik von der Fehr (1994) for related discussion. 29 Optimal negotiation is in general more complex than in the single-unit case since determiningany bidder's MR requires knowing all other bidders' signals. One way to achieve optimal negotiation is (i) ask each bidder i to independently report his signal t, (in equilibrium all reports will be honest), and let i be the (K + 1)st highest signal reported;(ii) for each i who reports a signal in the top K signals, compute ti such thatMRi(t, . .. , ti - ,,t,, t, +,. . . .. = 0 and sell -to this bidder if t, 2 t,, at the maximum tN) of v-,(t,I .1 ..,1 t,_ ,,1 lt, t+ ,, . . . , tN) andvi(t ,, . . .,1 ti_ t,l -,, See our paper, Bulow and Klemperer t, + ,, . . ., tN). (1994b), for a furtheranalysis of multiple-unit auctions.

190 MR

THE AMERICANECONOMICREVIEW

MARCH 1996

0 M K N+K

I

c

3. FIcGURE MARGINALREVENUEIF DEMAND IS EXPANDED

hard to extend our earlier arguments to show that this is less than the expected revenue from an absolute auction with N + K bidders with independentsignals (in which the final K bidders pay the price at which the last excess bidder quits). The analogue of this argumentin traditional price theory is informative. Consider an industry with total capacity K at some constant marginal cost c which we normalize to zero. Demand at a price of zero is N 2 K. The industry has the ability to do one of two things: invest in a monitoring programwhich will enable it to collude perfectly, or invest in an advertising campaign which will proportionally increase demand by a factor of (N + K)IN. In the latter case, the industry will be perfectly competitive and will sell K units. Which option is more profitable? Assuming that the industryhas a downward sloping MR curve, the answer is that increasing demand and remaining competitive is more valuable than colluding. The result follows directly from our auction-theory model, with K units and independent private values. However, if N and K large enough that there is no aggregate uncertainty about valuations, the argumentcan be made even more simply. Figure 3 shows marginal revenue for the demand curve. Colproportionately-expanded lusive profits on this demand curve equal area

[A] (the integral of marginal revenue up to the monopoly quantity M), so collusion on the original demand curve would yield profits of (N/(N + K))[A]. Competitive profits on the expanded demand curve are the integral of marginal revenues up to K, that is, [A] [B ]. However, downward-sloping MR implies [B] ' ((K - M)/((N + K) - M))([B] + [C]), and total marginal revenue equals zero at price zero so ([B] + [C]) = [A]. So competitive profits equal [A] - [B] 2 [A] ((K - M)/((N + K) - M))[A] = (N/(N + K - M)) [A], which exceeds collusive profits. Ill. Conclusion A simple competitive auction with N + 1 bidders will yield a seller more expected revenue than she could expect to earn by fully exploiting her monopoly selling position against N bidders. When a company is approachedby a potential buyer or buyers, its options may be either to negotiate or to put the company up for auction. Our analysis implies that if the board expects at least one extra serious bidder to appear in an auction, then it should generally not negotiate and should directly begin an auction. Of course, institutional considerations may make any given situation more complex. For example, if allowing many bidders access to

VOL. 86 NO. I

AUCTIONS VS. NEGOTIATIONS BULOWAND KLEMPERER:

191

confidential financial informationwould cause the company's value to be diminished to the eventual buyer, then one might wish to restrict bidding. But remember that our analysis assumed that a seller could negotiate optimally, making credible commitments of the sort that might not be possible in real life, and we also as-

sumed that bidders had no bargaining power in a negotiation. We thereforebelieve that our basic result does not overstate the efficacy of auctions relative to negotiations. Certainly a firm that refused to negotiate with a potential buyer, and instead put itself up for auction, should be presumed to have exercised reasonable business judgment.

APPENDIX tN+ ), that is, for the vector T but with the jth element replaced by x, and Write (x, T_,) for (t , tj_ I, x, tj + . write (x, T_,) for the vector T with the jth element replaced by x.

PROOF OF LEMMA 1: If bidder ] has the highest signal and bidder i has the second-highest signal, then bidder j will win the auction at the price v, (t,, T_j), that is, the value i would have, if j's signal were t, ."?But by symmetry, v, (t,, T_j) equals vj(ti, T_j), and v(t,,
1-F(T)I

MRj(T ) f(tj ITj)dtj = Et,{MR,(T)Itj

2

t,,

which is to say thatthe sales price equals the expectedMR of the winningbidder,contingenton all the other signals. Because the winning bidderhas the highest MR, the resultfollows. PROOF OF LEMMA 2: (t,, As in the absolute auction, the next-to-last bidder i leaves at price vi, T_j) equals (ti, T_j). Let the seller choose a take-it-or-leave-it offer for the last bidder,j, of 'U.t, T_j), where t 2 t, . (The seller infers T_, from the points where the low bidders quit.) If ex post tj 2 t then the seller will receive
=

iiU(t, Tj)

Et1

T)f(tjlT-j)dtj

=

If tj < t, then the seller will receive zero. That is, revenue equals, in expectation, MRj(T) when tj 2 t, and zero when t,< t. Since MRJ(T) is increasing in tj, the seller maximizes expected profit by choosingt so that MRj(t, T_,) = 0 if MR(ti, T_,) < 0, and chooses t = t, otherwise. Since the winning bidder has the highest MR, the result follows. PROOF OF THEOREM 1: Conditional on any T_j, and on the jth signal being the highest of the first N signals, let t be such thatij(t, T_j) is the seller's optimal take-it-or-leave-it final offer (computed as in the proof of Lemma 2) when selling to the N bidders. If tj < t, max(MR, (T ). MRN(T ), 0) = 0 vN+I(0, T )=

{ MRN+I(T)f(tN+ I IT)dtN+, = EtN+, MRN+ (T)}2

If t, 2 t, max(MR,(T),, max(MR, (T ), ..., MRN(T ), 0)

MRN(T), 0) = MRj(T), so conditional on tj

t and T-j, the expectation of

30 See note 19 for a full description of the equilibrium-biddingstrategies.

192

THE AMERICANECONOMICREVIEW

MARCH 1996

1 - F(t, T_,) I,~
= v,(,

'

MRj(T )fI(t,

)dt

T_,). t and T-j

However, the expectation of MRj(T ) conditional on t,

= fJ t+ 1=

J t=0 MRJ(T)f@(t,,

|t,I I

t,

T-j)dtjdtN+ I

=fJ t+1=?(JK
=JtN0

(T)f(t1It1t, t=0 MR
2

T1L, tN+

I))f(tN+

I

2

Itj

t,

T-j)dtldtN+

I

(J

MRi(T) 1

f(tT

)

dt)f(tN+

It

T,)dtN+ I

=fJ. t+ 1=0
1=?

v,(t, T.,)f

(tN+ I It, 2 t, T-J)dtN+

I

2

f

0v,(t, T-j)f(tN+

I

=

t, T-J)dtN+I = i6(t, T_,).

The inequality applies if signals are affiliated, because then the distribution of tN+ I conditional on t t and T, stochastically dominates the distribution of tN+ I conditional on = t and T,. (With independent signals the inequality holds with equality.) With private values, vj(t, T-j) is independent of tN+ , so the inequality always holds with equality. So conditional on any lowest N - 1 of the first N signals, T-j, and either on any tj < t or on tj 2 t, the expectation of max(MR, (T), .. MRN(T ), 0) is (weakly) less than the expectation of max(MR (T ). MRN+I(T)). Since the inequalities are strict for a set of T-J that occurs with positive probability, ET{max(MRI(T),MR2(T),...,MRN(T),O)} and the result follows by Lemmas 1 and 2. The above proof assumedrisk-neutral bidders.If biddersare risk averse the expected revenuefrom the absoluteauctionis unchanged,but the expectedrevenuefrom the N-biddermechanismis reduced,increasingthe advantage the absoluteauction. of PROOF OF LEMMA 3: Let p, (T ) be the probability that i will receive the object, in equilibrium, let S, (t, ) be the equilibrium expected surplus to bidder i, and since we have independent signals, writef(t, ) and F(t, ) forf(t, IT-,) and F(t, IT-,). For pi ( ) to be an equilibrium, it must be incentive compatible. In particular,the ith bidder, with signal t', cannot gain by deviating to the strategy he would use if he had signal ti so, with independent signals, Si (t') 2 S(t,) + ET V{( (t', T-,) -vi (ti, T-,))pi (T)}. So S, (t, ) has derivative dSi (t, )Idt, (t, E, {IS, )} = S, (0) +
f

Similar Documents

Premium Essay

Game Theory

...Through visionary thought and understanding, a creative strategy increases the outcome of success in a given situation or variable. In many cases, strategy is understood as a plan that chooses an individual’s future possible position. Speaking with respect to Game Theory within the Healthcare field, there are many ways to move forward with creating this ideal insightful approach. Learning through class discussions, it’s clear the topic of the discussion with Game Theory is very evolved, diverse, and dynamic with all different observations. All games share an interdependence meaning the result for each individual is dependent on the option they primarily choose. For myself, this is definitely considered an everyday normalcy working in the Healthcare Industry. Whether Game Theory is applied in all of society is only understood through the participants as all situations are different and unique, but all equally share the mindset of increasing their individual outcome of achievement. The analysis of Game Theory within Healthcare is spread across an increasingly strategy-prone competitive market. Governmental changes alone within healthcare laws create challenges for decision makers to compete within this highly-regulated domain. Creating governmental regulation lessens efficiency for providers who serve society to collaboratively work together, and in addition, diminishes their likelihood of optimal standing within the environment. Turning the hand in reference to my current position...

Words: 946 - Pages: 4

Premium Essay

Game Theory

...Is Game Theory the Right Kind of Game? Game theory is an analysis of a conflict of interest to find optimal choices that will lead to desired outcome under given conditions. It’s a study of ways to win in a situation given the conditions of the situation. Game theoretic concepts apply whenever the actions of several agents are interdependent. These agents may be individuals, groups, firms, or any combination of these. The concepts of game theory provide a language to formulate structure, analyze, and understand strategic scenarios. Game theory provides a nice conceptual or theoretical framework for thinking about multi-agent learning. It is most appropriate provided that the game is stationary and fully specified, other agents are also game theorists, it can solve equilibrium coordination problem. Given the said conditions, it is rarely hold in real applications because firms think differently from each other. We can say that game theory is the right kind of game if we are able to make use of it properly to win in a given situation. This game theory can provide insight into the strategic options and likely outcomes available to participants in particular situations. From this insight, decision-makers can better assess the potential effects of their actions, and can make decisions that will more likely produce the desired goals and avoid conflict. Considering the situation as a game would lead you to think that everyone is a participant which in reality not all participates...

Words: 499 - Pages: 2

Premium Essay

Game Theory

...GAME THEORY & ASYMMETRIC INFORMATION LITERATURE REVIEW NATHALIA PALOMINO ID# 0501605 MARCH 1, 2014. FACILITATOR: SHELLEY WHITTLE Introduction This paper will firstly address game theory, Prisoners Dilemma which is a very prominent game and Bargaining. Asymmetric Information is also discussed along with a few examples of how asymmetric information relates to the business environment. The writer gives the reader a basic understanding of game theory and asymmetric information uses in a logical manner. As many opinions are combined to critically analyse the aforementioned. Game Theory A definition of Game Theory or something that appears to be a definition may be applied as such: An analytical or mathematical approach of examining strategic interaction when dealing with competitive situations in business decisions. As Keat, Young & Stephen (2014) did not give a clear definition of Game Theory. This definition stated business decision however, Martin (1978) stated that Game theory has proved useful in only war and economic. He states, “I see that at least three ways in which game theory has proved ‘useful’. First, it has led to practical advice on tactical decision-making in certain well defined situations, especially in military areas involving missile tracking and similar task (where the theory of differential games has led to results equivalent to control theory). Second, it has provided an occupation and amusement for thousands of government bureaucrats...

Words: 2354 - Pages: 10

Premium Essay

Game Theory

...Game Theory Game A game is a formal description of a strategic situation. Game Theory Game theory is the formal study of decision-making where several players must make choices that potentially affect the interests of the other players. Mixed Strategy A mixed strategy is an active randomization, with given probabilities, that determines the player’s decision. As a special case, a mixed strategy can be the deterministic choice of one of the given pure strategies. Nash Equilibrium A Nash equilibrium, also called strategic equilibrium, is a list of strategies, one for each player, which has the property that no player can unilaterally change his strategy and get a better payoff. Pay-Off A payoff is a number, also called utility, that reflects the desirability of an outcome to a player, for whatever reason. When the outcome is random, payoffs are usually weighted with their probabilities. The expected payoff incorporates the player’s attitude towards risk. Perfect information A game has perfect information when at any point in time only one player makes a move, and knows all the actions that have been made until then. Player A player is an agent who makes decisions in a game. Rationality A player is said to be rational if he seeks to play in a manner which maximizes his own payoff. It is often assumed that the rationality of all players is common knowledge. Strategic form A game in strategic form, also called normal form, is a compact representation of a game...

Words: 13523 - Pages: 55

Premium Essay

Game Theory

...Game Theory On Gallerie Apex Vs Bata Submitted to Abu Reza Mohammad Muzareba Lecturer Department of Marketing University of Dhaka Submitted by Group: Gamers Section: A Batch: 17th Department of Marketing University of Dhaka Submission date: 21th April, 2012 AbuReza Mohammad Muzareba Lecturer University of Dhaka Dept. of Marketing Subject: Letter of transmittal Dear Sir, Enclosed is a report on the Game theory Between Gallerie Apex and Bata. This report is about the internal and external business strategies of the pioneer footwear company Gallerie Apex and Bata. We were assigned to submit this report in 21th April 2012 to be submitted as a term paper for our Business Mathematics 2 course in the 3rd semester of our BBA program, from the department of Marketing of University of Dhaka. We have completed it whilst trying to meet all its broad and specific objectives within the allotted time. We are submitting the report to you only, as our course instructor and will be keeping a copy for any future references. We have organized our findings about the business strategies of the above mentioned trading companies. This paper includes an introduction to the company in focus, in terms of their business strategies and an analysis of those processes with some possible recommendations. It has been completed with a conclusion. At the end of the report...

Words: 3169 - Pages: 13

Premium Essay

Game Theory

...Game Theory∗ Theodore L. Turocy Texas A&M University Bernhard von Stengel London School of Economics CDAM Research Report LSE-CDAM-2001-09 October 8, 2001 Contents 1 What is game theory? 2 Definitions of games 3 Dominance 4 Nash equilibrium 5 Mixed strategies 6 Extensive games with perfect information 7 Extensive games with imperfect information 8 Zero-sum games and computation 9 Bidding in auctions 10 Further reading 4 6 8 12 17 22 29 33 34 38 This is the draft of an introductory survey of game theory, prepared for the Encyclopedia of Information Systems, Academic Press, to appear in 2002. ∗ 1 Glossary Backward induction Backward induction is a technique to solve a game of perfect information. It first considers the moves that are the last in the game, and determines the best move for the player in each case. Then, taking these as given future actions, it proceeds backwards in time, again determining the best move for the respective player, until the beginning of the game is reached. Common knowledge A fact is common knowledge if all players know it, and know that they all know it, and so on. The structure of the game is often assumed to be common knowledge among the players. Dominating strategy A strategy dominates another strategy of a player if it always gives a better payoff to that player, regardless of what the other players are doing. It weakly dominates the other strategy if it is always at least as good. Extensive game An extensive game (or extensive...

Words: 13879 - Pages: 56

Premium Essay

Game Theory

...21/01/09 Start with a brief timeline, including when applications to different areas were first used. Game Theory (i) Game Theory Introduction We begin with a simple, informal example of a game. Rousseau, in his Discourse on the Origin and basis of equality among men, comments: “If a group of hunters set out to take a stag, they are fully aware that they would all have to remain faithfully at their posts in order to succeed, but if a hare happens to pass near one of them, there can be no doubt that he pursued it without qualm, and that once he had caught his prey, he cared very little whether or not he had made his companions miss theirs” To make this into a game, we need to fill out a few details. Suppose that there are only two hunters, and that they must decide simultaneously whether to hunt for a stag or for hare. Each player has a choice between two strategies: (hunt stag, hunt hare). If both hunt stag, each gets half a stag If both hunt hare, each gets one hare If one hunts for hare while the other tries to take a stag, the former will catch a hare and the latter will catch nothing. If we suppose that the utility of catching a stag is 4 and for a hare is 1, then the payoff matrix for the players can be summarised as follows: Stag Hare (2,2) (0,1) (1,0) (1,1) Game theory is concerned with what outcomes arise in equilibrium. An equilibrium outcome is one which consists...

Words: 2617 - Pages: 11

Premium Essay

Game Theory

...Rachel Dillie SOS-360 Final Project March 25, 2014 Game Theory “Game theory is the study of strategic interaction among rational players in an interactive setting” (Stevens, Lecture 1). Elements of a game consist of common knowledge, the players, strategies and payoffs. Every other Friday night my wife and I play cards at our friend’s house and it generally gets more intense as the game and the drinks progress. We mainly play a card game called spades and we play as partners. Common knowledge in this game is every player knows that in order to win you have to bid the correct number of books, meaning you have to guess how many rounds you and your partner can win based off what cards you are holding and what you think the other players are holding in their hands. Each player also is assumed to be an experienced player unless otherwise stated and even if they are it’s easier to guess how the hand will play out. In this card game there is not strictly a pure strategy at play, meaning it doesn’t not involve an act of randomness but a game of mixed strategy. Mixed strategy means using a pure strategy with acts of randomness. I have an idea what the other players will do when it is their turn in the card game but sometimes to force their hand, it is necessary to randomly sacrifice one of your cards to make them display their higher ranked cards. The payoff to a player reflects what that player cares about, not what another player thinks they should care about. Being rational...

Words: 2875 - Pages: 12

Premium Essay

Game Theory

...Situations economists and mathematicians call games psychologists call social situations. While game theory has applications to "games" such as poker and chess, it is the social situations that are the core of modern research in game theory. Game theory has two main branches: Non-cooperative game theory models a social situation by specifying the options, incentives and information of the "players" and attempts to determine how they will play. Cooperative game theory focuses on the formation of coalitions and studies social situations axiomatically. This article will focus on non-cooperative game theory. Game theory starts from a description of the game. There are two distinct but related ways of describing a game mathematically. The extensive form is the most detailed way of describing a game. It describes play by means of a game tree that explicitly indicates when players move, which moves are available, and what they know about the moves of other players and nature when they move. Most important it specifies the payoffs that players receive at the end of the game. Strategies Fundamental to game theory is the notion of a strategy. A strategy is a set of instructions that a player could give to a friend or program on a computer so that the friend or computer could play the game on her behalf. Generally, strategies are contingent responses: in the game of chess, for example, a strategy should specify how to play for every possible arrangement of pieces on the board. An alternative...

Words: 1678 - Pages: 7

Premium Essay

Game Theory

...Game Theory Themes 1. Introduction to Game Theory 2. Sequential Games 3. Simultaneous Games 4. Conclusion Introduction to Game Theory Game theory is the branch of decision theory concerned with interdependent decisions. The problems of interest involve multiple participants, each of whom has individual objectives related to a common system or shared resources. Because game theory arose from the analysis of competitive scenarios, the problems are called games and the participants are called players. But these techniques apply to more than just sport, and are not even limited to competitive situations. In short, game theory deals with any problem in which each player’s strategy depends on what the other players do. Situations involving interdependent decisions arise frequently, in all walks of life. A few examples in which game theory could come in handy include: ● Friends choosing where to go have dinner ● Parents trying to get children to behave ● Commuters deciding how to go to work ● Businesses competing in a market ● Diplomats negotiating a treaty ● Gamblers betting in a card game All of these situations call for strategic thinking – making use of available information to devise the best plan to achieve one’s objectives. Perhaps you are already familiar with assessing costs and benefits in order to make informed decisions between several options. Game theory simply extends this concept to interdependent decisions, in which the options being evaluated are functions of...

Words: 3051 - Pages: 13

Premium Essay

Game Theory

...“Planning and Playing a Game” Objectives: * Learn how individuals contribute to teamwork. * Experience some of the features of group work and teamwork. * Understand what managers and organizational developers do to transform groups into teams. * Articulate the tangible benefits (both quantitative and qualitative) of high-performing teams. * Finish with an interest in learning more about these concepts and techniques to apply what you learn. Background: In game theory, there are non-cooperative and cooperative games. A non-cooperative zero-sum game has a definite winner and loser. For one to win, one must lose. A cooperative game is where everyone who plays is better off for having played than not having played the game. That is not to say that everyone is equally well off, but simply better off than they were before playing. Hence, even in a cooperative game, some people will likely benefit more than others. To understand why individuals make the decisions they do in a game it is important to consider the personality of the player. Personality is a term used to describe a great many feelings and behaviors. Literally hundreds of personality dimensions or traits have been identified by psychologist over the last 100 years. However, within the past 25 years or so, a consensus has emerged that, for the most part, the human personality can be described by five dimensions or factors. The Big Five personality dimensions include: extroversion, emotional...

Words: 1747 - Pages: 7

Premium Essay

Game Theory

...Managerial Economics 2010 1. A. Design a simple two-company game that illustrates why it might have been in economic interests of the cigarette companies to support the ban. In designing the game, assume that there is no regulation and that the two firms simultaneously choose between advertising and not advertising. Display your hypothetical payoffs in strategic form (see Figure 9.1) and highlight the Nash equilibrium. Explain the intuition for why the firms in your example would favor regulation to ban advertising. Winston |Advertise |Not Advertise | |fff | | | | | |100/100 |160/60 | | | | | | | | | | |160/60 |150/150 | Profits – Advertising Cost from TV (In millions) Advertise Tareyton Not Advertise During the 1960’s, numerous reports started to surface connecting cancer to smoking...

Words: 2724 - Pages: 11

Premium Essay

Game Theory

...Assignment 3 ------------------------------------------------- 1. Some games of strategy are cooperative. One example is deciding which side of the road to drive on. It doesn’t matter which side it is as long as everyone chooses the same side. Otherwise, everyone may get hurt. Driver 2 Left Right Driver 1 Left 0, 0 -1000 -1000 Right -1000, -1000 0, 0 a. Does either player have a dominant strategy? Explain. They both don’t have a dominant strategy. Nobody has a strategy that results in the best outcome or highest payoff to a given player no matter what action or choice the other player makes. b. Is there Nash equilibrium in this game? Explain Nash Equilibrium is a set of strategies from which all players are choosing their best strategy, given the actions of the other players. The Nash equilibrium in this game is the point LL and RR c. Why this game is called a cooperative game? A cooperative game is a game where groups of players ("coalitions") may enforce cooperative behavior; hence the game is a competition between coalitions of players, rather than between individual players. In this case, if both drivers cooperate, they are both better off. 2. a. What is the firm’s Total Revenue? TR= E * A or Area A, J, O, E b. What is the Total Cost...

Words: 276 - Pages: 2

Free Essay

Game Theory

...choose between open or sealed bid auctions and justify why you are using it. Alpen Bank should utilize open auction. The value of Alpen’s credit card corporation is largely composed with common value, which is dispersed among bidders. Assuming all four bibbers are risk neutral and are experienced bidders, they could adjust their pricing strategy in response to rival’s latest bidding price in an open auction. Such new information will positively affect bidder’s next pricing. Owing to the fierce competition and strong willingness of corporation, the price may be bid up beyond their real value, but to a small extent because of winner’s curse concern. Yet, for the case of sealed bid auction, bidders are more rational since it is a simultaneous game and one could not observe the actions of rivals. To avoid winner’s...

Words: 339 - Pages: 2

Premium Essay

Game Theory

...extends two-sided matching models with and without money and certain auction models. * The key to the analysis is to extend two concepts of demand theory to models with or without prices. The first concept to be extended is the notion of substitutes. * Our definition ap-plies essentially the Roth-Sotomayor substitut-able preferences condition to a more general class of contracts: contracts are substitutes if, whenever the set of feasible bilateral contracts expands, the set of contracts that the firm rejects also expands. * We show that (a) our definition coincides with the usual demand theory condi-tion when both apply, (b) when contracts are substitutes, a stable collection of contracts ex-ists, and (c) if any hospital or firm has prefer-ences that are not substitutes, then there are preferences with single openings for each other firm such that no stable allocation exists. * We further show that when the substitute condition applies, (a) both the doctor-offering and hospi-tal-offering Gale-Shapley algorithms can be represented as iterated operations of the same operator (starting from different initial condi-tions), and (b) starting at a stable allocation from which a doctor retires, a natural market dynamic mimics the Gale-Shapley process to find a new stable allocation. * The second relevant demand theory concept is the law of demand, which we extend both to include heterogeneous inputs and to encompass models with or without prices. * The law of ag-gregate...

Words: 677 - Pages: 3