Common Value Auctions with Return Policies

Size: px
Start display at page:

Download "Common Value Auctions with Return Policies"

Transcription

1 Common Value Auctions with Return Policies Ruqu Wang Jun Zhang October 11, 2011 Abstract This paper eamines the role of return policies in common value auctions. In second-price auctions with continuous signals and discrete common values, we characterize the unique symmetric equilibrium for any given (linear) return policy. We find that, surprisingly, a more generous return policy actually hurts the buyers. We then eamine the optimal linear return policy that maimizes the seller s revenue, and find that it must be in the form of a fied fee, and no percentage fee should be charged for returns. This resembles many real life refund policies with which the sellers refund the full purchasing prices minus some shipping and handling charges. In general, the seller s revenue is the difference between the social welfare and the consumer surplus. With a more generous return policy, the latter is always lower and the former can be lower or higher. We characterize the optimal linear return policy in second-price auctions and then etend the analysis to first-price auctions with a simpler setup. Given the same return policy, second-price auctions generate more revenue than first-price auctions. Keywords: auctions, return policies, common value JEL classification: D44, D72, D82 We thank Bram Cadsby, Rene Kirkegaard, and seminar participants at University of Guelph, Boston University, Tsinghua University, Yonsei University, the 2009 CEA conference in Toronto, and the 2009 Canadian Economic Theory Conference in Montreal for helpful comments. Wang s research is supported by the Social Sciences and Humanities Research Council of Canada. Economics Department, Queen s University, Kingston, Ontario, K7L 3N6, Canada. Phone: +1(613) , wangr@queensu.ca. School of International Business Administration, Shanghai University of Finance and Economics. Phone: +1(613) , zhangjunqueens@gmail.com. 1

2 1 Introduction Traditional auctions have a history of thousands of years and could date back to the fifth century B.C. However, refunds are rarely allowed. Recently, the rapid growth of internet commerce makes online auctions etremely popular. These auctions create a problem for both the buyers and the sellers. As a buyer is unable to personally eamine the good before bidding, bidders are usually facing a lot of uncertainty. Nevertheless, consumers could learn more information after receiving and inspecting the object upon winning. Such situations make online auctions significantly different from traditional ones, and bring an active role for return policies. A casual survey on ebay.com and Amazon.com shows that more than half of the sellers provide a refund policy for returns. How would a return policy affect buyers behavior? Would the sellers (and the buyers) benefit from such a return policy? How should a revenue maimizing seller select the proper return policy? These are some of the issues we will investigate in this paper. In a private-value auction, return policies do not affect a buyer s bidding strategy, since he never bids more than his valuation. In contrast, with interdependent or common values, which captures many real life applications, return policies induce bidders to bid more aggressively. Returns could happen with positive probability after the winning bidder receives the good and learns more information about its true value. In this paper, we focus on the common-value model in Wilson [13], since it is the simplest model accounting for interdependent and correlated values. 1 This model is widely used to analyze oil, gas and mineral rights auctions. In this paper, buyers receive independent signals conditional upon the true value of the object in our common-value auction models with return policies. To make the analysis as simple as possible, this common value is assumed to take discrete values, while the signals are continuously distributed. We mainly analyze the behavior of bidders in second-price auctions, even though we also consider first-price auctions in a simpler setup. We focus on linear refund policies where the seller could charge a percentage fee in addition to a fied fee. The popularity of linear return policies is because they, just like linear pricing, are easy to implement in practice. Results from the literature on return policies in retailer stores, such as Che [1], predict that consumers are better off with a more generous return policy if there is no competition among buyers. It turns out that, surprisingly, a more generous return policy actually hurts consumers in auctions. This counter intuitive result is from the fact that a more generous return policy not only protects consumers from bad shocks, but also induce buyers to bid more aggressively in the competition, which lowers the consumer surplus. 1 Resale can introduce common value components to a good of private value in nature. (See Haile [3], for eample.) Milgrom and Weber [11] have characterized the equilibria in a very general model of correlated values, but with return policies, it is difficult to characterize the equilibria. Nevertheless, the qualitative results should remain valid. 2

3 We also eamine how return policies affect the seller s revenue. The phenomenon, known as the winner s curse, is well recognized in the auction literature. Winning could mean that the winner has overestimated the object value, since his bid is higher than those from other bidders. As the number of bidders increases, the winner s curse becomes more severe and bidders bid even more cautiously. However, if a return policy is in place, buyers will bid more aggressively, since the winner can get a refund by returning the object. A return policy acts as an insurance against overestimation and overcomes some of the winner s curse. In fact, a return policy can do more than mitigating the winner s curse. When the return policy is generous enough, bidders may bid more than the unconditional estimates of the object value. For eample, if the seller implements the full refund policy, then it is obvious that bidders will bid very high in the auction. Of course, returns could negatively impact the seller s revenue as well as the efficiency of trading, as the seller usually has a lower value for keeping the object. By selecting a proper return policy, the seller can achieve a higher revenue by balancing the trade off between higher bids and efficiency losses. We find that the optimal linear return policy must be in the form of a fied fee, and no percentage fee should be charges. This eplains the widely adopted return policies in reality: the seller refunds the full purchasing price minus some fied shipping and handling fees. In general, the seller s revenue is the difference between the social surplus and the consumer surplus. As we mentioned above, with a more generous return policy, the consumer surplus is always lower. However, the social surplus could go either way. If the social surplus is higher, which happens if and only if the lowest common value of the object is low, the seller s revenue is unambiguously higher. In this case, a full refund policy is optimal. If the social surplus is lower, then there is no clear cut solution. In this case, we characterize the optimal return policy. We then etend our model to first-price auctions in a simpler setup, where the social surplus remains constant regardless of the return policies. We find that a more generous return policy induces a higher revenue and a lower consumer surplus as in second-price auctions. In addition, second-price auctions dominates first-price auctions in terms of the seller s revenue. There is a huge traditional literature on auctions. However, few papers consider return policies. Zhang [15] considers private values which are subject to shocks after transaction, and illustrates how return policies can be part of the optimal mechanism. Hafalir and Yektas [?] consider second-price auctions under a special case of the information structure in Zhang [15], and compare the revenues among spot auctions, forward auctions, and forward auctions with full return policy. Huang, Qiu, and Matsubara [4] recently consider an algorithm for multi-unit auctions with partial refund for bid withdrawals that are caused by eogenous reasons. The paper provides an analysis from the perspectives of artificial intelligence, and bidders strategic behaviors are not the focus. In theory, there eist optimal mechanisms for sellers to maimize revenue. 2 However, 2 The optimal auction with independent values has been established by Myerson [12]. Matthews [9] and Maskin and Riley [8] characterize the optimal mechanism with risk averse buyers and independent values. 3

4 those optimal mechanisms are not commonly observed in reality, partly because too much detail regarding the underlining environment is required for the seller to design an optimal mechanism. The discrepancy between theory and common practice prompts the claim that a set of simplicity and robustness criteria should be imposed on the trading mechanisms. 3 Our auction model with return policies satisfies those simplicity criteria, and the return policies do not depend on much of the detail of the environment. As we shall show in this paper, return policies, while being simple instruments, are effective in revenue improving under certain circumstances. The rest of this paper is organized as follows. In Section 2, we set up the model. In Section 3, we characterize the bidders equilibrium strategies in second-price auctions and perform some preliminary analysis. In Section 4, we characterize the optimal linear return policy in second-price auctions. In Section 5, we characterize the bidders equilibrium strategies in first-price auctions and establish the revenue ranking among different auction formats. In Section 6, we conclude. All proofs are relegated to an appendi. 2 The model Suppose that there are two bidders, bidders 1 and 2, bidding for one object. The object value is the same to both bidders. Let V denote this common value. Assume that V = v H with probability µ H, and V = v L with probability µ L = 1 µ H, where v H > v L. The distribution for V is common knowledge. Before the bidding starts, bidder i receives a private signal i, i = 1, 2. This signal is correlated to V. However, it is independently distributed across the bidders conditional on V. If V = v H, then i follows a distribution with p.d.f. f H ( ) and c.d.f. F H ( ). If V = v L, then i follows a distribution with p.d.f. f L ( ) and c.d.f. F L ( ). Assume that F H ( ) and F L ( ) have a common support, [, ]. Assume that ρ() = f H() is increasing in, i.e., F f L () H dominates F L in likelihood ratio. This will ensure that a higher signal implies a higher probability of V = v H. The lemma below lists a few properties implied by this assumption; its proof is standard and is thus omitted. Lemma 1 Suppose that F H dominates F L in likelihood ratio, i.e., ρ() = f H() f L () in. Then is increasing 1. F H dominates F L in hazard rate, i.e. f H () 1 F H () f L() 1 F H (),. With correlated values, (almost) full surplus etraction can be achieved using the mechanism in Cremer and Mclean [2] and McAfee and Reny [10]. 3 Hurwicz [5] illustrates the need for mechanisms that are independent of the parameters of the model. Wilson [14] points out that a desirable property of a trading rule is that it does not rely on features of the agents. Lopomo [6] [7] restricts to mechanisms with simplicity and robustness. 4

5 2. F H dominates F L in reversed hazard rate, i.e. 3. F H() F L () is increasing,. f H () f L(),. F H () F L () Now we describe the return policy in our model. Let p be the transaction price (i.e., the price the winning bidder pays) in the auction. If the winning bidder returns the object, the seller charges a fee c = a + γp. Here, we restrict our analysis to linear fees since, besides simplicity of calculations, we are not aware of any return policies beyond linear structure in reality. Note that a is the fied fee, such as handling charges or service charges, and γ is the percentage fee, such as restocking fees. In addition, we assume that there is a transaction cost (such as shipping cost) for the winning bidder to return the object, and it is denoted by c B. We will put some restrictions on the return policy to ensure an interesting equilibrium. We assume that γ 0 and a c B. If γ < 0, then it is a weakly dominant strategy for a buyer to bid an infinitely large amount to win and then return the object for refund. In this case, the seller will lose an infinite amount, and it cannot occur in equilibrium. If γ = 0 and a < c B, then a buyer can still win and return the object for refund, ending up with a positive surplus. These restrictions are in place to make sure that a buyer cannot make money by using the win-and-return strategy. 4 The game proceeds in three stages: 1. Nature selects V = v H or V = v L. Conditional on V, each bidder receives an independent signal. 2. A second-price auction (or a first-price auction) with return policy c = a + γp is held. The winner pays accordingly and obtains the object. 3. The winner learns the true V and decides whether or not to return the object to the seller for a refund. Here, we assume that the winner learns costlessly the true value of V after he obtains the object. (The analysis is similar if he learns more but imperfect information about V.) This assumption is motivated by the fact that in online auctions, after a buyer receives the object, he will usually learn more about its value. In auctions for oil, gas and mineral rights, for eample, the winners usually learn more information by doing more tests and analysis after winning. 4 When γ = 0 and a = c B, there are multiple equilibria, including those where every bidder bids an amount greater than or equal to v H and then the winner always returns the object. In these equilibria, the buyers have zero surplus and the seller makes zero profit. As we shall show later, when γ converges to zero from above and a converges to c B from above, the equilibrium converges to the equilibrium where each bidder bids v H and the object is returned only when V = v L. 5

6 In the following analysis, we will focus on the symmetric perfect Bayesian equilibrium with strictly increasing bidding function in the auction. We will start by analyzing the last stage of the game, where the winner makes the return decision. In the following section, we will eamine the second-price auctions. We will then eamine the first-price auctions in a later section. 3 Second-price auctions Suppose that a second-price auction with a return policy is held in Stage 2 of the game. The transaction price is then equal to the second highest bid in the auction. Suppose that in the symmetric perfect Bayesian equilibrium, both bidders adopt B( ), a strictly increasing bidding function, in the auction stage. We restrict our attention to bidding functions taking values in [v L, v H ]. We can do so because a buyer should not bid more than v H ; bidding more than v H sometimes gives him a negative surplus and it is dominated by bidding v H ; if the lowest type bidder bids less than v L, then by increasing his bid to v L he wins with a positive probability and thus receives a positive epected surplus. 3.1 Equilibrium analysis In this subsection, we shall characterize the buyers equilibrium bidding function. We first consider Stage 3, the return stage. Suppose that buyer 1 receives signal, bids B( ), and wins the object. Since it is a second-price auction, he pays B( 2 ), the bid of buyer 2. If he learns that V = v H, he will not return the object since his payment is less than v H. If he learns that V = v L, he returns the object for refund when v L < B( 2 ) [a + γb( 2 )] c B, i.e., when B( 2 ) > v L+a+c B. Otherwise, he keeps the object. As a result, there can only be three different situations in the return stage. Case 1: B() v L+a+c B, and the winner keeps the object all the time. Case 2: B() v L+a+c B, and the winner returns the object whenever V = v L. Case 3: B() < v L+a+c B < B(), and the winner returns the object based on a cutoff rule when V = v L : return when B( 2 ) is high and not return otherwise. Given the winner s strategies in Stage 3 (the return stage), we net eamine Stage 2 (the auction stage). We focus on symmetric strictly increasing bidding functions. In a two-bidder, second-price, common-value auction with no return policies, from Milgrom and Weber [11], a bidder with signal bids E(V, ), the epected object value conditional on the other bidder having the same signal, where E(V, ) = µ Hv H ρ() 2 + µ L v L µ H ρ() 2 + µ L. 6

7 Define Γ() E(V, ). In later analysis, the values of Γ() and Γ() play an important role in characterizing the equilibrium bidding function. The properties of the equilibrium we will characterize depend partially on the value of v L +a+c B. As is shown in the proof of Proposition 1 in the appendi, if v L+a+c B is lower than Γ(), the winning bidder would always return the object when V = v L. If v L+a+c B is higher than Γ(), the winning bidder would never return the object when V = v L. If v L +a+c B is intermediate, the winning bidder would sometimes return the object when V = v L. Furthermore, the intervals for v L+a+c B in the above three cases do not overlap with each other and they cover the entire positive real space. Thus we can conclude that a unique symmetric perfect Bayesian Nash equilibrium eists for any value of v L+a+c B. Define as the solution to v L+a+c B = Γ( ) if v L+a+c B [Γ(), Γ()]. Since Γ() is strictly increasing, is unique and in [, ]. These results are characterized in the following proposition. Proposition 1 In the second-price common value auction with return policy a + γp, the unique symmetric perfect Bayesian equilibrium is characterized in three cases as follows: Γ(), each bidder adopts the follow- Case 1 (No return equilibrium): If v L+a+c B ing strictly increasing bidding function: B() = B 1 () Γ() µ Hv H ρ() 2 + µ L v L µ H ρ() 2 + µ L. Γ(), each bidder adopts the fol- The winning bidder never returns the object. Case 2 (Always return equilibrium): If v L+a+c B lowing strictly increasing bidding function: B() = B 2 () µ Hv H ρ() 2 (a + c B )µ L µ H ρ() 2 + γµ L. The winning bidder always returns the object whenever V = v L. Case 3 (Partial return equilibrium): If Γ() < v L+a+c B the following strictly increasing bidding function: B 1 (), if ; B() = B 2 (), if. < Γ(), each bidder adopts The winning bidder returns the object when V = v L if he pays more than v L+a+c B. 7

8 In Case 1 of the above proposition, since the return policy is never eecuted, the bidding function coincides with the one with no return policy. Obviously, a very strict return policy is equivalent to a no return policy. In Case 2, the bidding function B 2 () is in fact the equilibrium bidding function for a game where the winner is forced to return the object if the realized value of V is v L. It is equal to the price that the bidder will break even if he pays that price (i.e., when the other bidder also has signal ) and receives v H when V = v H, and pays γ percent of that price plus a + c B and gets 0 when V = v L. That is, B 2 () is the solution to (v H B)µ H f H () 2 + ( γb a c B )µ L f L () 2 = 0. In Case 3, whether the winning bidder returns the object or not depends on how much he pays. It is easy to show that B 1 () B 2 () for and B 1 () B 2 () for, with equality at the cutoff. Therefore, the bidding function is the maimum of the two functions in Cases 1 and 2. However, as we shall show in a later section, this pattern is not valid for first-price auctions. Given any return policy a + γp, there eists a unique symmetric equilibrium. When γ 0 and a c B, we have B() v H. We know that when γ = 0 and a = c B, there eist many equilibria. First, bidding v H and the winner always returns the object when V = v L and keeps the object when V = v H is an equilibrium. Second, bidding any amount more than v H and the winner returns the object all the time is also an equilibrium. However, bidding more than v H is weakly dominated by bidding v H. Thus, for simplicity and continuity, we select the equilibrium with B() = v H and the winner always returns the object whenever V = v L and keeps the object whenever V = v H as the equilibrium for γ = 0 and a = c B. This is captured in Case 2 with γ = 0 and a = c B. We call the return policy with γ = 0 and a = c B the full refund with full cost reimbursement policy, as the seller gives out full refund of the transaction price plus reimbursing the winning buyer s cost of shipping back the object. 3.2 The effects of return policies In this section, we shall study how return policies affect buyers epected surplus (i.e., consumer surplus) and the epected gain from trade (i.e., social welfare). We shall defer our analysis on the effects of return policies on the seller s profit (i.e., producer surplus) to the net subsection, where we characterize the optimal return policy for the seller. Denote the consumer surplus as CS(a, γ), and the total surplus as W (a, γ), respectively. Let v 0 be the seller s reservation value for the object, which is also the salvage value for the seller when the winner returns the object. 5 We assume that v 0 < v H ; otherwise, the seller will have no incentive to sell the object. Meanwhile, we do not impose restrictions on the relationship between v 0 and v L. In the following analysis, we treat the three different cases separately. 5 We can also assume that the salvage value is different from the reservation value, but it would not affect the analysis. 8

9 3.2.1 Case 1: No return equilibrium In the no return equilibrium, the object always goes to the buyer with the higher signal, and he never returns the object. The consumer surplus CS(a, γ) can be calculated using the second order statistics of the two signals. When V = v H, its c.d.f is given by 2F H ( ) F H ( ) 2 ; when V = v L, it is given by 2F L ( ) F L ( ) 2. One buyer s epected surplus (which is half of the consumer surplus) is 1 CS(a, γ) 2 = µ H [v H B 1 ( 2 )](1 F H ( 2 ))f H ( 2 )d 2 +µ L [v L B 1 ( 2 )](1 F L ( 2 ))f L ( 2 )d 2 = µ H v H + µ L v L Meanwhile, the social welfare is Γ( 2 )[µ H (1 F H ( 2 ))f H ( 2 ) + µ L (1 F L ( 2 ))f L ( 2 )]d 2. (1) W (a, γ) = µ H v H + µ L v L v 0 In this case, within the range of this no return equilibrium, the consumer surplus and the social welfare do not depend on the return policy, since the object is never returned and the buyers strategies are not affected by the return policy. We have the following lemma. Lemma 2 In the range of no return equilibrium, the consumer surplus and the social welfare do not depend on a and γ Case 2: Always return equilibrium Within the range of the always return equilibrium, the winning bidder (i.e., the buyer with the higher signal) keeps the object if V = v H and always returns it if V = v L. Therefore, a buyer s epected surplus is 1 CS(a, γ) 2 = µ H [v H B 2 ( 2 )][1 F H ( 2 )]f H ( 2 )d 2 +µ L [ a γb 2 ( 2 ) c B ][1 F L ( 2 )]f L ( 2 )d 2 (2) Note that c B is the winner s cost of shipping back the object. 9

10 We first consider how the fied fee a affects the consumer surplus. 1 CS(a, γ) 2 a B 2 ( 2 ) = µ H [1 F H ( 2 )]f H ( 2 )d 2 a [a + γb 2 ( 2 )] µ L [1 F L ( 2 )]f L ( 2 )d 2 a { µ L µ H = [1 F µ H ρ( 2 ) 2 H ( 2 )]f H ( 2 ) + γµ L γµ L µ L [1 + = ][1 F µ H ρ( 2 ) 2 L ( 2 )]f L ( 2 ) } d 2 + γµ L µ L µ H f H ( 2 ) 2 { 1 F L ( 2 ) µ H ρ( 2 ) 2 + γµ L f L ( 2 ) 1 F H( 2 )} d2 0 (3) f H ( 2 ) The inequality at the end follows from the first part of Lemma 1. Therefore, we can conclude that the consumer surplus is increasing in a. Now we eamine how the percentage fee affects the consumer surplus. 1 R(a, γ) 2 γ B 2 ( 2 ) = µ H [1 F H ( 2 )]f H ( 2 )d 2 γ [γb 2 ( 2 )] µ L [1 F L ( 2 )]f L ( 2 )d 2 = = = γ { µ H v H ρ( 2 ) 2 µ L [µ H ρ( 2 ) 2 + γµ L ] µ H[1 F 2 H ( 2 )]f H ( 2 ) + µ Hv H ρ( 2 ) 2 µ H ρ( 2 ) 2 µ [µ H ρ( 2 ) 2 + γµ L ] 2 L [1 F L ( 2 )]f L ( 2 ) } d 2 µ H v H ρ( 2 ) 2 µ H µ { L ρ(2 ) 2 [1 F [µ H ρ( 2 ) 2 + γµ L ] 2 L ( 2 )]f L ( 2 ) [1 F H ( 2 )]f H ( 2 ) } d 2 µ 2 Hµ L v H ρ( 2 ) 2 f H ( 2 ) 2 { 1 F L ( 2 ) 1 F H( 2 ) [µ H ρ( 2 ) 2 + γµ L ] 2 f L ( 2 ) f H ( 2 ) Again, the consumer surplus is increasing in γ. The social welfare in this equilibrium is given by W (a, γ) = µ H (v H v 0 ) µ L c B, } d2 0 (4) since the winning bidder returns the object to the seller when V = v L and no gain is generated in this case. Because this event is not affected by the return policy in this equilibrium, the 10

11 social welfare does not change with γ or a. We have the following lemma. Lemma 3 In the range of always return equilibrium, a more generous return policy (lower a or lower γ) induces lower consumer surplus, while the social welfare is unaffected by the return policy. This result is more or less counter intuitive. Usually, as in the case of return policies in retailer store, when a more generous return policy is provided, it protects the consumers better when bad shock happens and they should be better off. However, in an auction, buyers are competing with each other. A more generous return policy induces buyers to bid more aggressively, and thus lowers consumer surplus. In our model, the first effect is always less than the second one. This is because bidders always have a higher estimate of the probability of returns in their equilibrium strategy calculation than what actually happens. In their equilibrium calculation, because it is a second-price auction, a bidder assumes (correctly) that the other bidder has the same signal when calculating his breakeven bid. But this bid is paid to the seller only when the other buyer has a higher signal and wins. This higher signal reduces the probability of having V = v L (in which case the winner will return). Note that the return policy does not affect the social welfare simply because it does not alter the final allocation of the object Case 3: Partial return equilibrium In a partial return equilibrium, after learning that V = v L, the winning bidder returns the object when the price (i.e., the bid of the other bidder) he pays is high, and keeps the object otherwise. In this case, a buyer s epected surplus is given by: 1 CS(a, γ) 2 { = µ H [v H B 1 ( 2 )][1 F H ( 2 )]f H ( 2 )d 2 + [v H B 2 ( 2 )][1 F H ( 2 )]f H ( 2 )d 2 { +µ L [v L B 1 ( 2 )][1 F L ( 2 )]f L ( 2 )d 2 + [ a γb 2 ( 2 ) c B ][1 F L ( 2 )]f L ( 2 )d 2 Note that is a function of a and γ. We first consider the effect of the fied fee a. 1 CS(a, γ) 2 a } }. (5) 11

12 = µ H {[v H B 1 ( )] [v H B 2 ( )]}[1 F H ( )]f H ( ) d }{{} da =0 B 2 ( 2 ) µ H [1 F H ( 2 )]f H ( 2 )d 2 a [a + γb 2 ( 2 )] µ L [1 F L ( 2 )]f L ( 2 )d 2 a +µ L [[v L B 1 ( )] + a + γb 2 ( ) + c B ][1 F L ( )]f L ( ) d }{{} da =0 µ L µ H f H ( 2 ) 2 = { 1 F L ( 2 ) µ H ρ( 2 ) 2 + γµ L f L ( 2 ) 1 F H( 2 )} d2 0 (6) f H ( 2 ) Therefore, the consumer surplus is increasing in a. Now consider the effect of the percentage fee γ. 1 CS(a, γ) 2 γ = µ H {[v H B 1 ( )] [v H B 2 ( )]}[1 F H ( )]f H ( ) d }{{} dγ =0 B 2 ( 2 ) µ H [1 F H ( 2 )]f H ( 2 )d 2 γ [γb 2 ( 2 )] µ L [1 F L ( 2 )]f L ( 2 )d 2 γ +µ L [[v L B 1 ( )] + a + γb 2 ( ) + c B ][1 F L ( )]f L ( ) d }{{} dγ µ 2 = Hµ L v H ρ( 2 ) 2 f H ( 2 ) 2 { 1 F L ( 2 ) [µ H ρ( 2 ) 2 + γµ L ] 2 f L ( 2 ) Therefore, the consumer surplus is increasing in γ. =0 In this equilibrium, the social welfare is: Therefore, W (a, γ) = µ H (v H v 0 ) +µ L [ ( c B )d[2f L ( 2 ) F L ( 2 ) 2 ] + 1 F H( 2 )} d2 0 (7) f H ( 2 ) (v L v 0 )d[2f L ( 2 ) F L ( 2 ) 2 ] ]. (8) W (a, γ) a = µ L (v L + c B v 0 ) a 2f L( )[1 F L ( )], (9) 12

13 W (a, γ) γ = µ L (v L + c B v 0 ) γ 2f L( )[1 F L ( )]. (10) As a result, the social welfare is increasing in a and γ if v L + c B v 0, and decreasing in a and γ if v L + c B v 0. These properties are summarized in the following lemma. Lemma 4 Within the range of the partial return equilibria, with a more generous return policy (i.e., a lower a or γ) the consumer surplus is lower, and the social welfare is higher if v L + c B v 0 and is lower if v L + c B v 0. The intuition behind this lemma is similar to Lemma 3. The etra effect a more generous return policy has in this lemma on the consumer surplus is that the winner will return the object more often. However, this does not affect the consumer surplus at the margin. In contrast, it does affect the social welfare. Combining Lemmas 2-4, we conclude that the following properties are valid for any of the three types of equilibria in the game. Proposition 2 With a more generous return policy (lower a or γ), buyers surplus is lower, and the social welfare is higher if v L + c B v 0 and is lower if v L + c B v 0. 4 The optimal return policy In this section, we will eamine the effect of the return policy on the seller s revenue and characterize the optimal linear return policy for the seller. For epositional purpose, in what follows, define the revenue maimizing return policies within the three different cases as the optimal return policy for the no return equilibrium, the optimal return policy for the full return equilibrium, and the optimal return policy for the partial return equilibrium, respectively. We define the best return policy among these three policies as the overall optimal return policy. Denote the seller s revenue as R(a, γ). It is obvious that R(a, γ) = W (a, γ) CS(a, γ). According to Proposition 2, if v L + c B v 0, then a more generous return policy reduces the consumer surplus and at the same time increases the social welfare. Therefore, the most generous return policy, i.e., the full return with full cost reimbursement policy will maimize the seller s revenue. Proposition 3 Suppose that v L + c B v 0. Then the seller s optimal linear return policy is the full refund with full cost reimbursement policy. In the rest of the analysis in this section, we will focus on the case where v L +c B > v 0. In this case, both the social welfare and the consumer surplus are lower when the return policy 13

14 becomes more generous. This means that the seller s revenue may not change monotonically with the return policy. Depending on the parameter values in a return policy, from the earlier section, we know that there are three cases of equilibria. In what follows, we will eamine the return policies inducing each case of equilibrium separately and characterize the optimal policy for each case of equilibrium. Then the overall optimal return policy must be the best policy among the three case-specific optimal policies: the optimal policy for the no-return equilibrium, the optimal policy for the full-return equilibrium, and the optimal policy for the partial-return equilibrium. According to Lemma 2 and Lemma 4, any policy inducing the no-return equilibrium is an optimal policy for the no-return equilibrium. The optimal policy to induce full return is a = c B, γ = 0, i.e., the full refund with full cost reimbursement policy. Below, we first make a comparison between these two optimal policies. In the optimal policy inducing full return in equilibrium, both bidders bid v H, and the seller s revenue is µ H v H + µ L (v 0 c B ). Comparing this with the seller s revenue from an optimal policy inducing no return in equilibrium, we have the following proposition. Proposition 4 The optimal policy inducing no return in equilibrium is better than the optimal policy inducing full return in equilibrium if and only if 2 E(V 2, 2 )[µ H (1 F H ( 2 ))f H ( 2 ) + µ L (1 F L ( 2 ))f L ( 2 )]d 2 µ H v H + µ L (v 0 c B ). Given this proposition, the remaining analysis is to characterize the optimal policy that induces partial return in equilibrium. How a partial return policy affects the revenue depends on the parameter values. Since R(a, γ) = W (a, γ) CS(a, γ), by eamining Equations (6), (7), (9), and (10), there is no clear conclusion about how a and γ would affect the revenue. We proceed as follows using an indirect method. In a policy inducing partial return, the seller can choose a and γ, which then uniquely determine the cutoff through Γ( ) = v L +a+c B. Alternatively, if we allow the seller to choose γ and directly, it is equivalent to allowing the seller to choose γ and a indirectly, where a = (1 γ)γ( ) v L c B. Therefore, we can rewrite the seller s revenue as a function of γ and : 1 2 R(γ, ) { = µ H B 1 ( 2 )[1 F H ( 2 )]f H ( 2 )d 2 + { +µ L B 1 ( 2 )[1 F L ( 2 )]f L ( 2 )d 2 + +µ L B 2 ( 2 )[1 F H ( 2 )]f H ( 2 )d 2 [a + γb 2 ( 2 )][1 F L ( 2 )]f L ( 2 )d 2 v 0 [1 F L ( 2 )]f L ( 2 )d 2. (11) } } 14

15 We first eamine how γ affects the revenue. 1 R(γ, ) 2 γ [ B 2 ( 2 ) = µ H + B2 ( 2 ) a γ { a γ + [γb2 ( 2 )] γ ] a [1 F H ( 2 )]f H ( 2 )d 2 γ } + γ B2 ( 2 ) a [1 F L ( 2 )]f L ( 2 )d 2 a γ +µ L [ B 2 ( 2 ) [γb 2 ] ( 2 )] = µ H [1 F H ( 2 )]f H ( 2 ) + µ L [1 F L ( 2 )]f L ( 2 ) d 2 γ γ { B 2 [ ] } ( 2 ) + µ H [1 F H ( 2 )]f H ( 2 ) + µ L 1 + γ B2 ( 2 ) a [1 F L ( 2 )]f L ( 2 ) a a γ d 2 [ µ L [µ H v H ρ() 2 µ L (a + c B )] = µ H [1 F [µ H ρ() 2 + γµ L ] 2 H ( 2 )]f H ( 2 ) µ H ρ() 2 [µ H v H ρ() 2 ] µ L (a + c B )] +µ L [1 F [µ H ρ() 2 + γµ L ] 2 L ( 2 )]f L ( 2 ) d 2 { µ L + µ H [1 F µ H ρ() 2 H ( 2 )]f H ( 2 ) + γµ L µ H ρ() 2 } a +µ L [1 F µ H ρ() 2 L ( 2 )]f L ( 2 ) + γµ L γ d 2 µ L µ H [µ H v H ρ() 2 µ L (a + c B )]f H ( 2 ) 2 = { 1 F L ( 2 ) 1 F H( 2 )} d2 [µ H ρ( 2 ) 2 + γµ L ] 2 f L ( 2 ) f H ( 2 ) µ H µ L f H ( 2 ) 2 { 1 F L ( 2 ) 1 F H( 2 )} Γ( )d [µ H ρ( 2 ) γµ L ] f L ( 2 ) f H ( 2 ) µ L µ H {µ H v H ρ() 2 µ L [(1 γ)γ( ) v L ] [µ H ρ( 2 ) 2 + γµ L ]Γ( )} f H ( 2 ) 2 = [µ H ρ( 2 ) 2 + γµ L ] 2 { 1 F L ( 2 ) 1 F H( 2 )} d2 f L ( 2 ) f H ( 2 ) µ L µ H f H ( 2 ) 2 { = µh ρ() 2 [v [µ H ρ( 2 ) 2 + γµ L ] 2 H Γ( )] µ L [Γ( ) v L ] } { 1 F L ( 2 ) 1 F H( 2 )} d2 f L ( 2 ) f H ( 2 ) µ L µ H f H ( 2 ) 2 [µ L µ H (v H v L )][ρ() 2 ρ( ) 2 ] = { 1 F L ( 2 ) 1 F H( 2 )} d2 [µ H ρ( 2 ) 2 + γµ L ] 2 µ H ρ( ) 2 + µ L f L ( 2 ) f H ( 2 ) 0 (12) This means the seller s revenue is decreasing in γ if is fied. This implies the following proposition. Proposition 5 Given a fied, among all policies inducing partial return, the seller s 15

16 revenue is decreasing in γ, implying that the optimal policy inducing partial return must have γ = 0 (i.e., no percentage fee). The intuition behind this proposition is as follows. Given cutoff, the seller can choose a combination of a fied fee and a percentage fee to fit this cutoff. However, using a percentage fee diminishes the seller revenue since it distorts the bids downward (as higher winning bids are punished more in the case of returning the object). In contrast, a fied fee is a lump sum transfer and does not have this distortion. Therefore, to maimize the seller s revenue, a percentage fee is inferior. Now we eamine the optimal cutoff level of. 1 R(γ, ) 2 = µ H [B 1 ( ) B 2 ( )][1 F H ( )]f H ( ) d }{{} dγ =0 B 2 ( 2 ) a +µ H a [1 F H( 2 )]f H ( 2 )d 2 [ ] +µ L 1 + γ B2 ( 2 ) a a [1 F L( 2 )]f L ( 2 )d 2 +µ L [B 1 ( ) a γb 2 ( )][1 F L ( )]f L ( ) µ L v 0 [1 F L ( )]f L ( ) }{{} =v L +c B = µ L (v L + c B v 0 )[1 F L ( )]f L ( ) }{{} social welfare effect 0 µ H µ L f H ( 2 ) 2 { 1 F H ( 2 ) 1 F L( 2 ) } a [µ H ρ( 2 ) 2 + γµ L ] f H ( 2 ) f L ( 2 ) d 2 }{{} consumer surplus effect 0 (13) From earlier analysis, we conclude that γ = 0 in the optimal policy inducing partial return. At γ = 0, we have 1 R(γ, ) 2 = µ L (v L + c B v 0 )[1 F L ( )]f L ( ) }{{} social welfare effect 0 2(v H v L )µ H µ L ρ( )ρ S ) µ (µ H ρ( ) 2 + µ L ) 2 L f L ( 2 ) { 2 1 F H ( 2 ) 1 F L( 2 )} d2 f H ( 2 ) f L ( 2 ) }{{} consumer surplus effect 0 (14) In the above epression, either the consumer surplus effect or the social welfare effect could dominate. One observation is that if v H v L is very small, then the overall sign is positive 16

17 and the optimal policy inducing partial return is the no return policy (as a limiting case of policies inducing partial return). This is summarized in the following lemma. Lemma 5 When v 0 < v L + c B and v H v L is small enough, the optimal policy inducing partial return is a = Γ() v L c B and γ = 0, such that the cutoff =. This result is true because when v H v L is very small, providing a more generous return policy cannot increase the bids much and the consumer surplus effect is actually quite small. As a result, the social welfare effect dominates. Therefore, the optimal policy should be the least generous, inducing the least return, i.e., no return. Meanwhile, Proposition 4 implies that the optimal policy inducing no return is better than the optimal policy inducing full return; in the case of v L converging to v H, the revenue from a policy inducing no return converges to v H and the revenue from a policy inducing full return converges to µ H v H. We have the following proposition: Proposition 6 When v 0 < v L + c B and v H v L is small enough, the overall optimal return policy is a policy that induces no return. Propositions 3 and 6 cover the situation where the overall optimal return policy is a corner solution. If the overall optimal return policy is an interior solution, then it must be a policy inducing partial return and satisfy the first order condition implied by (14). We have the following proposition. Proposition 7 If the overall optimal return policy is an interior solution, then it must be a policy inducing partial return and satisfy the following condition: 2(v H v L )µ H µ L ρ( )ρ S ) (µ H ρ( ) 2 + µ L ) 2 µ L f L ( 2 ) { 1 F L ( 2 ) 1 F H( 2 )} d2 f L ( 2 ) f H ( 2 ) +µ L (v L + c B v 0 )[1 F L ( )]f L ( ) = 0. (15) The proposition below characterizes some of the properties of an interior overall optimal return policy. Proposition 8 The optimal cutoff is increasing in v H v L, v 0 and decreasing in v L, c B. The intuition behind this proposition is that v H v L changes only the consumer surplus. A higher v H v L means a stronger consumer surplus effect and implies a more generous return policy. v 0, v L, c B only changes the social welfare effect (when keeping v H v L constant). Eample: Suppose that v 0 = 0, v H = v L, v L to be specified later, and µ H = µ L = 0.5, c B = 0. We set γ = 0 as this is always optimal for the seller, and eamine how the seller s 17

18 revenue is affected by the return policy by changing, which then uniquely determines the value of a. For [0, 1], F H () = 2, F L () = 2 2, f H () = 2, f L () = 2 2. Then ρ() = f H() = f L. Note that ρ() is indeed strictly increasing as previously assumed. () 1 Note also that with the above specifications, the case of always return equilibrium vanishes. Furthermore, no return equilibrium is revenue equivalent to the partial return equilibrium with = 1. Thus, the optimal policy inducing partial return will be the overall optimal return policy. We will vary the value of v L and let it take the values of 0.01, 0.15, 0.25, and 0.4, respectively. The results are shown in Figure 4. When v L = 0.01, the seller s revenue is decreasing in ; the overall optimal return policy is = 0, i.e., the full refund with full cost reimbursement policy a = c B = 0. When v L = 0.15, the seller s revenue first increases, then decreases, and then increases in ; the overall optimal return policy is a partial refund policy with = When v L = 0.25, the seller s revenue first increases, then decreases, and then increases in ; the overall optimal return policy is the no refund policy. When v L = 0.4, the seller s revenue is increasing in ; the no refund policy is optimal again. This eample also illustrates the difficulties in determining the condition for an interior overall optimal return policy as the revenue function is not well behaved. However, as predicted, as v L increases, the overall optimal return policy becomes less generous. 5 First-price auctions In this section, we eamine return policies in a first-price auction. Since it is a first-price auction, the transaction price is the winning bid. Again, we focus on an equilibrium where every bidder adopts the same strictly increasing bidding function B F ( ). Similarly to the second-price auctions, we can establish that the range of the bidding function is a subset of [v L, v H ]. We first eamine the winning bidder s return decision. Suppose that a bidder has signal but bids B F ( ). If he wins, he pays B F ( ) for the object. When the realization of the object value is V = v H, he will keep the object, since he pays less than v H. When V = v L, he will return the object if v L < ()B F ( ) a c B, i.e., > (B F ) 1 ( v L+a+c B only be three different situations in the return stage. Case 1: (B F ) 1 ( v L+a+c B this case the winner always keeps the object. Case 2: (B F ) 1 ( v L+a+c B ). As a result, there can ), and in ), and in this case ) <, and the winner always returns the object when V = v L. Case 3: < (B F ) 1 ( v L+a+c B in this case the winner returns the object when V = v L if and only if > (B F ) 1 ( v L+a+c B We first define two functions: L 1 (α ) = e α L 2 (α ; γ) = e α µ H f H (s) 2 +µ L f L (s) 2 µ H f H (s)f H (s)+µ L f L (s)f L (s) ds, µ H f H (s) 2 +γµ L f L (s) 2 µ H f H (s)f H (s)+γµ L f L (s)f L (s) ds. ). 18

19 Lemma 6 L 1 (α ) and L 2 (α ; γ) are both proper c.d.f. s of α with support [, ]. In a two-bidder first-price common-value auction without any return policy, according to Milgrom and Weber [11], all bidders would bid according to the same strictly increasing function: Γ F () = E(V α, α)dl 1 (α ) = µ H v H ρ(α) 2 + µ L v L µ H ρ(α) 2 + µ L dl 1 (α ). Note that Γ F () = Γ(). As in the second-price auctions, there are two cutoffs for γ that are important in the characterization of the bidders equilibrium bidding function: Γ F () and Γ F (). As in the second-price auctions, the value of v L+a+c B plays an important role in the return decision. Define F as the solution to v L+a+c B = Γ F ( F ) for v L+a+c B (Γ F (), Γ F ()). Since Γ F () is strictly increasing, F is unique and belongs to (, ). Also define A = v L + a + c B 1 γ F µ H v H ρ(α) 2 µ L V L µ H ρ(α) 2 + γµ L dl 2 (α F ; γ). Similarly to the second-price auctions, we have the following proposition. Proposition 9 In a first-price common-value auction with return policy c = a + γp, the unique symmetric equilibrium can be characterized as follows in three cases. Case 1: When γ Γ F (), each bidder adopts the following strictly increasing bidding function: B F () = B F 1 () = Γ F µ H v H ρ(α) 2 + µ L v L () = dl µ H ρ(α) 2 1 (α ). + µ L The winning bidder never returns the object. Case 2: When γ Γ F (), each bidder adopts the following strictly increasing bidding function: B F () = B F 2 v H µ H ρ(α) 2 µ L (a + c B ) () = dl µ H ρ(α) 2 2 (α ; γ). + γµ L The winning bidder always returns the object when V = v L. Case 3: When Γ F () < γ < Γ F (), each bidder adopts the following strictly increasing bidding function: B F 1 (), if F, B F () = B F 2 () + AL 2 ( F ; γ), if F. 19

20 The winning bidder returns the object if he pays more than B F ( F ) when V = v L. In Case 1 of the above proposition, since the return policy is never eecuted, the bidding function coincides with the one with no return policy. A very strict return policy is equivalent to not allowing returns. The bidding function B F 1 () corresponds to the one in Milgrom and Weber [11]. In Case 2, the function B 2 () is in fact the equilibrium bidding function for the auction when the winner is forced to return the object if the realized value is v L. In Case 3, however, the bidding function is no long the maimum of the two individual bidding functions in Cases 1 and 2 as in the second-price auctions. For the same reason as in the second-price auctions, when γ = 0 and a = c B, there are multiple equilibria and we choose the equilibrium where B F () = v H and where the winner always returns the object whenever V = v L and keeps the object whenever V = v H. This is captured by Case 2 using γ = 0 and a = c B in the above proposition. Due to the compleity of the equilibrium bidding function in a first-price auction, we will eamine only the special case where v L = 0, a = c B below. In this case, the object is either in perfect condition (high common value), or totally useless (zero common value). The winner always keeps the object when the realized common value is high, and always returns it when the realized common value is zero, regardless of value of γ. Because the return policy does not alter the allocation of the object, the social welfare is the same among different return policies. Therefore, the effect of return policies on revenue is the opposite of consumer surplus effect. Here we keep the value of a unchanged and vary the value of γ, as this is the only way to keep the social welfare unchanged. In what follows, we can make use of a generalized version of the linkage principle to show how the return policy affects the revenue, and thus simplify the analysis greatly. 6 Let M(, ) be the epected payment from a bidder who has signal but reports. We have the following proposition. Proposition 10 Let A and B be two auctions with return policies. In both auctions, the bidder with the highest bid wins. Furthermore, the winner always keeps the object if V = v H, and always returns it if V = v L. Suppose that in each auction, there is a symmetric and strictly increasing equilibrium bidding function with the properties that (i) for all, M A 2 (, ) M B 2 (, ), where subscripts denote the derivatives; (ii) M A (, ) = M B (, ) = 0. Then the seller s epected revenue from A is at least as large as the epected revenue from B. Given any return policy and auction format, the winner with the highest bid wins. The winner always returns the object when V = v L and always keeps the object when V = v H. Thus, both first-price and second-price auctions with any return policy can be regarded as 6 Unfortunately, if v L 0 or a c B, the allocation of the object is affected by the return policy and thus the linkage principle does not apply to this case. 20

21 a proper mechanism in the above proposition. Note that the equilibrium strategy for a first-price auction is characterized by Case 2 in Proposition 9 if v L = 0, a = c B. Similarly to the second-price auctions, ranking in the first-price auctions with different percentage fees can also be obtained. We have the following proposition. Proposition 11 Suppose that v L = 0 and a = c B. A more generous return policy (with a lower γ) generates more revenue in the first-price auctions. The intuition here is the same as in second-price auctions. The following proposition compares the revenues generated from the first-price and the second-price auctions given the same return policy. Proposition 12 Suppose that v L = 0 and a = c B. Given the same return policy, a second-price auction generates at least as much revenue as a first-price auction. This proposition shows that the result in Milgrom and Weber [11] that second-price auctions generates weakly more revenue than first-price auctions can be generalized to auctions with return policies. In Milgrom and Weber [11], the result can be derived directly from the linkage principle. In contrast, the linkage principle cannot be applied directly to auctions with return policies. This is because for the linkage principle to work, the difference between the two epected payment functions must be increasing in a bidder s reported type. This property is satisfied among second-price auctions with different γs, as well as among first-price auctions with different γs. But when we compare a first-price auction with a second-price auction with the same γ, the property is no longer valid. (See the proof of Proposition 12 for details.) Nevertheless, revenue ranking is still possible here. This is because in a second-price auction, the seller receives the bid of a bidder only when the other bidder has a higher signal, and this higher signal makes V = v H more likely to happen than the first bidder originally thought. That is, the object gets returned less often in the seller s revenue calculation than in a bidder s surplus calculation. However, this effect is absent in the first-price auction. Therefore, the total epected revenue for the seller is higher in the second-price auction. 6 Conclusion This paper investigates how return policies affect buyers bidding strategies in auctions and the respective seller s revenue. We mainly focus on second-price auctions and analyze firstprice auctions in a simpler setup. Providing a return policy undoubtedly induces buyers to bid more aggressively, and thus, hurts the consumer surplus. Nevertheless, a more generous return policy improves the social welfare if and only if the low common value is high. Since the seller s revenue is difference between the social welfare and the consumer surplus, designing 21

22 the optimal return policy is a more delicate issue. When the low common value is high, the more generous a return policy is, the more epected revenue the auction generates for the seller. Another surprising result is that the overall optimal refund policy should have no percentage fee. Furthermore, the standard results in Milgrom and Weber [11] that secondprice auction generate more revenue than first-price auctions in common value auctions can be etended to the case of return policies. Auctions with return policies are more complicated to analyze than standard auctions, as the winning bidder may return the object when he obtains more information regarding the object value. Therefore, a higher bid induced by a more generous return policy may not be beneficial to the seller. This paper shows that when the efficiency losses from the returns are not significant, a more generous return policy helps the seller. Since a seller can also use return policies to signal the quality of the object, we should epect to see return policies in many auctions as we have witnessed in online auctions, where buyers have less confidence in the quality of the objects. 7 Appendi Proof for Proposition 1 Case 1: Never return We first characterize the symmetric equilibrium bidding function in the case where the winning bidder never returns the object after winning. Let B 1 ( ) denote the bidding function in this case. Consider buyer 1. Suppose that buyer 1 s signal is and he pretends to have signal and bids B 1 ( ). Given that when the realization of the value is v L, bidder 1 will keep the object if he wins, his epected surplus in the auction is given by: where Π 1 (, ) = P r(v = v H 1 = )E{[V B 1 ( 2 )]I{ 2 < } 1 =, V = v H } +P r(v = v L 1 = )E{[V B 1 ( 2 )]I{ 2 < } 1 =, V = v L } = µ H () [v H B 1 ( 2 )]df H ( 2 ) + µ L () [v L B 1 ( 2 )]df L ( 2 ), (16) µ H () Pr(V = v H 1 = ) = Pr( 1 = V = v H ) Pr(V = v H ) Pr( 1 = V = v H ) Pr(V = v H ) + Pr( 1 = V = v L ) Pr(V = v L ) = f H ()µ H, f H ()µ H + f L ()µ L (17) and where µ L () = Pr(V = v L 1 = ) = 1 µ H (). It is important to note that µ H () is 22

Job Market Paper. Auctions with Refund Policies as Optimal Selling Mechanisms

Job Market Paper. Auctions with Refund Policies as Optimal Selling Mechanisms Job Market Paper Auctions with Refund Policies as Optimal Selling Mechanisms Jun Zhang November 8, 2008 Abstract Many sellers in online auctions such as ebay.com provide refund policies. This paper investigates

More information

Interdependent Value Auctions with an Insider Bidder 1

Interdependent Value Auctions with an Insider Bidder 1 Interdependent Value Auctions with an Insider Bidder Jinwoo Kim We study the efficiency of standard auctions with interdependent values in which one of two bidders is perfectly informed of his value while

More information

The Revenue Equivalence Theorem 1

The Revenue Equivalence Theorem 1 John Nachbar Washington University May 2, 2017 The Revenue Equivalence Theorem 1 1 Introduction. The Revenue Equivalence Theorem gives conditions under which some very different auctions generate the same

More information

Second Price Auctions with Differentiated Participation Costs

Second Price Auctions with Differentiated Participation Costs Second Price Auctions with Differentiated Participation Costs Xiaoyong Cao Department of Economics Texas A&M University College Station, TX 77843 Guoqiang Tian Department of Economics Texas A&M University

More information

Symmetric Separating Equilibria in English Auctions 1

Symmetric Separating Equilibria in English Auctions 1 Games and Economic Behavior 38, 19 27 22 doi:116 game21879, available online at http: wwwidealibrarycom on Symmetric Separating Equilibria in English Auctions 1 Sushil Bihchandani 2 Anderson Graduate School

More information

Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions

Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions Matthew O. Jackson September 21, 2005 Forthcoming: Review of Economic Design Abstract A simple example shows that equilibria

More information

Second-Price Auctions with Different Participation Costs

Second-Price Auctions with Different Participation Costs Second-Price Auctions with Different Participation Costs Xiaoyong Cao Department of Economics University of International Business and Economics Beijing, China, 100029 Guoqiang Tian Department of Economics

More information

THEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO

THEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO THEORIES ON AUCTIONS WITH PARTICIPATION COSTS A Dissertation by XIAOYONG CAO Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree

More information

Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann

Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Problem Set 0. Auctions and Moral Hazard Suggested Solution: Tibor Heumann 4/5/4 This problem set is due on Tuesday, 4//4..

More information

Information Acquisition in Interdependent Value Auctions

Information Acquisition in Interdependent Value Auctions Information Acquisition in Interdependent Value Auctions Dirk Bergemann Xianwen Shi Juuso Välimäki July 16, 2008 Abstract We consider an auction environment with interdependent values. Each bidder can

More information

Auctions. data better than the typical data set in industrial organization. auction game is relatively simple, well-specified rules.

Auctions. data better than the typical data set in industrial organization. auction game is relatively simple, well-specified rules. Auctions Introduction of Hendricks and Porter. subject, they argue To sell interest in the auctions are prevalent data better than the typical data set in industrial organization auction game is relatively

More information

Deceptive Advertising with Rational Buyers

Deceptive Advertising with Rational Buyers Deceptive Advertising with Rational Buyers September 6, 016 ONLINE APPENDIX In this Appendix we present in full additional results and extensions which are only mentioned in the paper. In the exposition

More information

Online Appendix for "Auctions in Markets: Common Outside Options and the Continuation Value Effect" Not intended for publication

Online Appendix for Auctions in Markets: Common Outside Options and the Continuation Value Effect Not intended for publication Online Appendix for "Auctions in Markets: Common Outside Options and the Continuation Value Effect" Not intended for publication Stephan Lauermann Gabor Virag March 19, 2012 1 First-price and second-price

More information

Robert Wilson (1977), A Bidding Model of Perfect Competition, Review of Economic

Robert Wilson (1977), A Bidding Model of Perfect Competition, Review of Economic Econ 805 Advanced Micro Theory I Dan Quint Fall 2008 Lecture 10 Oct 7 2008 No lecture on Thursday New HW, and solutions to last one, online Today s papers: Robert Wilson (1977), A Bidding Model of Perfect

More information

Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016

Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 1 Modelling incomplete information So far, we have studied games in which information was complete,

More information

Auctions in which losers set the price

Auctions in which losers set the price Games and Economic Behavior 66 2009) 855 864 wwwelseviercom/locate/geb Auctions in which losers set the price Claudio Mezzetti a,, Ilia Tsetlin b a University of Warwick, Department of Economics, Coventry,

More information

Money, Barter, and Hyperinflation. Kao, Yi-Cheng Department of Business Administration, Chung Yuan Christian University

Money, Barter, and Hyperinflation. Kao, Yi-Cheng Department of Business Administration, Chung Yuan Christian University Money, Barter, and Hyperinflation Kao, Yi-Cheng Department of Business Administration, Chung Yuan Christian University 1 Outline Motivation The Model Discussion Extension Conclusion 2 Motivation 3 Economist

More information

Sequential vs. single-round uniform-price auctions

Sequential vs. single-round uniform-price auctions Games and Economic Behavior 62 2008) 591 609 www.elsevier.com/locate/geb Sequential vs. single-round uniform-price auctions Claudio Mezzetti a,, Aleksandar Saša Pekeč b, Ilia Tsetlin c a University of

More information

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS Heng Liu This note considers equilibrium selection in common-value secondprice auctions with two bidders. We show that for each

More information

Mechanism Design: Bayesian Incentive Compatibility

Mechanism Design: Bayesian Incentive Compatibility May 30, 2013 Setup X : finite set of public alternatives X = {x 1,..., x K } Θ i : the set of possible types for player i, F i is the marginal distribution of θ i. We assume types are independently distributed.

More information

Lecture 10: Mechanism Design

Lecture 10: Mechanism Design Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have

More information

Revenue Guarantee Equivalence

Revenue Guarantee Equivalence Revenue Guarantee Equivalence Dirk Bergemann Benjamin Brooks Stephen Morris November 7, 2018 Abstract We revisit the revenue comparison of standard auction formats, including first-price, second-price,

More information

An Ascending Auction with Multidimensional Signals

An Ascending Auction with Multidimensional Signals An Ascending Auction with Multidimensional Signals Tibor Heumann May 11, 2017 Abstract A single-item ascending auction in which agents observe multidimensional Gaussian signals about their valuation of

More information

DISCUSSION PAPER SERIES

DISCUSSION PAPER SERIES DISCUSSION PAPER SERIES IN ECONOMICS AND MANAGEMENT Strategic Incentives for Managers in Contests Matthias Kräkel Discussion Paper No. 01-08 GERMAN ECONOMIC ASSOCIATION OF BUSINESS ADMINISTRATION - GEABA

More information

Lecture 6 Games with Incomplete Information. November 14, 2008

Lecture 6 Games with Incomplete Information. November 14, 2008 Lecture 6 Games with Incomplete Information November 14, 2008 Bayesian Games : Osborne, ch 9 Battle of the sexes with incomplete information Player 1 would like to match player 2's action Player 1 is unsure

More information

Some Notes on Adverse Selection

Some Notes on Adverse Selection Some Notes on Adverse Selection John Morgan Haas School of Business and Department of Economics University of California, Berkeley Overview This set of lecture notes covers a general model of adverse selection

More information

Preliminary notes on auction design

Preliminary notes on auction design Division of the Humanities and Social Sciences Preliminary notes on auction design kcb Revised Winter 2008 This note exposits a simplified version of Myerson s [8] paper on revenue-maximizing auction design

More information

Inefficient Equilibria of Second-Price/English Auctions with Resale

Inefficient Equilibria of Second-Price/English Auctions with Resale Inefficient Equilibria of Second-Price/English Auctions with Resale Rod Garratt, Thomas Tröger, and Charles Zheng September 29, 2006 Abstract In second-price or English auctions involving symmetric, independent,

More information

DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box New Haven, CT

DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box New Haven, CT DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box 208268 New Haven, CT 06520-8268 http://www.econ.yale.edu/ Economics Department Working Paper No. 25 Cowles Foundation Discussion Paper No. 1619 Information

More information

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 Instructor: Chandra Chekuri Scribe: Hannaneh Hajishirzi Contents 1 Sponsored Search Auctions 1 1.1 VCG Mechanism......................................

More information

Interdependent Value Auctions with Insider Bidders

Interdependent Value Auctions with Insider Bidders Interdependent Value Auctions with Insider Bidders Jinwoo Kim November 2003 Abstract I study auctions in which there exists an asymmetry in bidders knowledge about their interdependent valuations. Bidders

More information

CPS 173 Mechanism design. Vincent Conitzer

CPS 173 Mechanism design. Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer conitzer@cs.duke.edu edu Mechanism design: setting The center has a set of outcomes O that she can choose from Allocations of tasks/resources, joint plans, Each

More information

Informed Principal in Private-Value Environments

Informed Principal in Private-Value Environments Informed Principal in Private-Value Environments Tymofiy Mylovanov Thomas Tröger University of Bonn June 21, 2008 1/28 Motivation 2/28 Motivation In most applications of mechanism design, the proposer

More information

Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption *

Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption * ANNALS OF ECONOMICS AND FINANCE 16-1, 231 253 (2015) Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption * Hongkun Ma School of Economics, Shandong University,

More information

Thus far, we ve made four key assumptions that have greatly simplified our analysis:

Thus far, we ve made four key assumptions that have greatly simplified our analysis: Econ 85 Advanced Micro Theory I Dan Quint Fall 29 Lecture 7 Thus far, we ve made four key assumptions that have greatly simplified our analysis:. Risk-neutral bidders 2. Ex-ante symmetric bidders 3. Independent

More information

Data Abundance and Asset Price Informativeness. On-Line Appendix

Data Abundance and Asset Price Informativeness. On-Line Appendix Data Abundance and Asset Price Informativeness On-Line Appendix Jérôme Dugast Thierry Foucault August 30, 07 This note is the on-line appendix for Data Abundance and Asset Price Informativeness. It contains

More information

A Study on Lucas' ``Expectations and the Neutrality of Money. Masayuki Otaki (Institute of Social Science, University of Tokyo)

A Study on Lucas' ``Expectations and the Neutrality of Money. Masayuki Otaki (Institute of Social Science, University of Tokyo) DBJ Discussion Paper Series, No.03 A Study on Lucas' ``Epectations and the Neutrality of Money Masayuki Otaki (Institute of Social Science, University of Tokyo) July 0 Discussion Papers are a series of

More information

Sequential Bidding in the Bailey-Cavallo Mechanism

Sequential Bidding in the Bailey-Cavallo Mechanism Sequential Bidding in the Bailey-Cavallo Mechanism Krzysztof R. Apt 1,2 and Evangelos Markakis 2 1 CWI, Science Park 123, 1098 XG Amsterdam 2 Institute of Logic, Language and Computation, University of

More information

Online Appendix for Dynamic Ex Post Equilibrium, Welfare, and Optimal Trading Frequency in Double Auctions

Online Appendix for Dynamic Ex Post Equilibrium, Welfare, and Optimal Trading Frequency in Double Auctions Online Appendix for Dynamic Ex Post Equilibrium, Welfare, and Optimal Trading Frequency in Double Auctions Songzi Du Haoxiang Zhu September 2013 This document supplements Du and Zhu (2013. All results

More information

Lecture 4. 1 Examples of Mechanism Design Problems

Lecture 4. 1 Examples of Mechanism Design Problems CSCI699: Topics in Learning and Game Theory Lecture 4 Lecturer: Shaddin Dughmi Scribes: Haifeng Xu,Reem Alfayez 1 Examples of Mechanism Design Problems Example 1: Single Item Auctions. There is a single

More information

A Very Robust Auction Mechanism

A Very Robust Auction Mechanism Penn Institute for Economic Research Department of Economics University of Pennsylvania 378 Locust Walk Philadelphia, PA 904-697 pier@econ.upenn.edu http://economics.sas.upenn.edu/pier PIER Working Paper

More information

Strategies under Strategic Uncertainty

Strategies under Strategic Uncertainty Discussion Paper No. 18-055 Strategies under Strategic Uncertainty Helene Mass Discussion Paper No. 18-055 Strategies under Strategic Uncertainty Helene Mass Download this ZEW Discussion Paper from our

More information

A Simple Example to Illustrate the Linkage Principle

A Simple Example to Illustrate the Linkage Principle A Simple Example to Illustrate the Linkage Principle Daniel Quint University of Wisconsin April 06 Abstract. I present a numerical example illustrating the revenue-superiority of an open over a closed

More information

Weak bidders prefer first-price (sealed-bid) auctions. (This holds both ex-ante, and once the bidders have learned their types)

Weak bidders prefer first-price (sealed-bid) auctions. (This holds both ex-ante, and once the bidders have learned their types) Econ 805 Advanced Micro Theory I Dan Quint Fall 2007 Lecture 9 Oct 4 2007 Last week, we egan relaxing the assumptions of the symmetric independent private values model. We examined private-value auctions

More information

Game Theory: Spring 2017

Game Theory: Spring 2017 Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today In this second lecture on mechanism design we are going to generalise

More information

University of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours.

University of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours. University of Warwick, Department of Economics Spring 2012 EC941: Game Theory Prof. Francesco Squintani Final Exam Answer TWO questions. All questions carry equal weight. Time allowed 2 hours. 1. Consider

More information

Motivation. Game Theory 24. Mechanism Design. Setting. Preference relations contain no information about by how much one candidate is preferred.

Motivation. Game Theory 24. Mechanism Design. Setting. Preference relations contain no information about by how much one candidate is preferred. Motivation Game Theory 24. Mechanism Design Preference relations contain no information about by how much one candidate is preferred. Idea: Use money to measure this. Albert-Ludwigs-Universität Freiburg

More information

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign Theory of Auctions Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 23th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1 Formalizing

More information

A technical appendix for multihoming and compatibility

A technical appendix for multihoming and compatibility A technical appendix for multihoming and compatibility Toker Doganoglu and Julian Wright July 19, 2005 We would like to thank two anonymous referees and our editor, Simon Anderson, for their very helpful

More information

A Review of Auction Theory: Sequential Auctions and Vickrey Auctions

A Review of Auction Theory: Sequential Auctions and Vickrey Auctions A Review of Auction Theory: and Vickrey Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 . Vickrey s. Vickrey. Example Two goods, one per bidder Suppose

More information

KIER DISCUSSION PAPER SERIES

KIER DISCUSSION PAPER SERIES KIER DISCUSSION PAPER SERIES KYOTO INSTITUTE OF ECONOMIC RESEARCH Discussion Paper No.945 Sequential Auctions of Heterogeneous Objects Akitoshi Muramoto, Ryuji Sano July 2016 KYOTO UNIVERSITY KYOTO, JAPAN

More information

The ambiguous impact of contracts on competition in the electricity market Yves Smeers

The ambiguous impact of contracts on competition in the electricity market Yves Smeers The ambiguous impact of contracts on competition in the electricity market Yves Smeers joint work with Frederic Murphy Climate Policy and Long Term Decisions-Investment and R&D, Bocconi University, Milan,

More information

An E cient Auction. (First version: October 1998) April 2001

An E cient Auction. (First version: October 1998) April 2001 An E cient Auction Motty Perry The Hebrew University of Jerusalem and Penn State University and Philip J. Reny Department of Economics University of Chicago (First version: October 1998) April 2001 Abstract

More information

Redistribution Mechanisms for Assignment of Heterogeneous Objects

Redistribution Mechanisms for Assignment of Heterogeneous Objects Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept

More information

Position Auctions with Interdependent Values

Position Auctions with Interdependent Values Position Auctions with Interdependent Values Haomin Yan August 5, 217 Abstract This paper extends the study of position auctions to an interdependent values model in which each bidder s value depends on

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Vickrey-Clarke-Groves Mechanisms Note: This is a only a

More information

CHAPTER 3: OPTIMIZATION

CHAPTER 3: OPTIMIZATION John Riley 8 February 7 CHAPTER 3: OPTIMIZATION 3. TWO VARIABLES 8 Second Order Conditions Implicit Function Theorem 3. UNCONSTRAINED OPTIMIZATION 4 Necessary and Sufficient Conditions 3.3 CONSTRAINED

More information

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS Heng Liu This paper considers the problem of equilibrium selection in a commonvalue second-price auction with two bidders. We show

More information

Mechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30

Mechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design II Terence Johnson University of Notre Dame Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design Recall: game theory takes the players/actions/payoffs as given, and makes predictions

More information

Asymmetric common-value auctions with applications to private-value auctions with resale

Asymmetric common-value auctions with applications to private-value auctions with resale Econ Theory (1) 45:53 9 DOI 1.17/s199-9-55-6 SYMPOSIUM Asymmetric common-value auctions with applications to private-value auctions with resale Harrison H. Cheng Guofu Tan Received: 6 January 9 / Accepted:

More information

Vickrey-Clarke-Groves Mechanisms

Vickrey-Clarke-Groves Mechanisms Vickrey-Clarke-Groves Mechanisms Jonathan Levin 1 Economics 285 Market Design Winter 2009 1 These slides are based on Paul Milgrom s. onathan Levin VCG Mechanisms Winter 2009 1 / 23 Motivation We consider

More information

Optimal Mechanism Design with Aftermarket Interactions

Optimal Mechanism Design with Aftermarket Interactions Optimal Mechanism Design with Aftermarket nteractions Jun Zhang December 4, 014 Abstract A revenue maximizing mechanism designer chooses a mechanism in the primary market to sell an object to privately

More information

Second Price Auctions with Valuations and Participation Costs Both Privately Informed

Second Price Auctions with Valuations and Participation Costs Both Privately Informed Second Price Auctions with Valuations and Participation Costs Both Privately Informed Xiaoyong Cao Department of Economics University of International Business and Economics Beijing, China 129 Guoqiang

More information

Chapter 2. Equilibrium. 2.1 Complete Information Games

Chapter 2. Equilibrium. 2.1 Complete Information Games Chapter 2 Equilibrium Equilibrium attempts to capture what happens in a game when players behave strategically. This is a central concept to these notes as in mechanism design we are optimizing over games

More information

Field Exam: Advanced Theory

Field Exam: Advanced Theory Field Exam: Advanced Theory There are two questions on this exam, one for Econ 219A and another for Economics 206. Answer all parts for both questions. Exercise 1: Consider a n-player all-pay auction auction

More information

Chapter 2. Equilibrium. 2.1 Complete Information Games

Chapter 2. Equilibrium. 2.1 Complete Information Games Chapter 2 Equilibrium The theory of equilibrium attempts to predict what happens in a game when players behave strategically. This is a central concept to this text as, in mechanism design, we are optimizing

More information

Crowdsourcing contests

Crowdsourcing contests December 8, 2012 Table of contents 1 Introduction 2 Related Work 3 Model: Basics 4 Model: Participants 5 Homogeneous Effort 6 Extensions Table of Contents 1 Introduction 2 Related Work 3 Model: Basics

More information

Sealed-bid first-price auctions with an unknown number of bidders

Sealed-bid first-price auctions with an unknown number of bidders Sealed-bid first-price auctions with an unknown number of bidders Erik Ekström Department of Mathematics, Uppsala University Carl Lindberg The Second Swedish National Pension Fund e-mail: ekstrom@math.uu.se,

More information

NTU IO (I) : Auction Theory and Mechanism Design II Groves Mechanism and AGV Mechansim. u i (x, t i, θ i ) = V i (x, θ i ) + t i,

NTU IO (I) : Auction Theory and Mechanism Design II Groves Mechanism and AGV Mechansim. u i (x, t i, θ i ) = V i (x, θ i ) + t i, Meng-Yu Liang NTU O : Auction Theory and Mechanism Design Groves Mechanism and AGV Mechansim + 1 players. Types are drawn from independent distribution P i on [θ i, θ i ] with strictly positive and differentiable

More information

Knapsack Auctions. Sept. 18, 2018

Knapsack Auctions. Sept. 18, 2018 Knapsack Auctions Sept. 18, 2018 aaacehicbvdlssnafj34rpuvdelmsigvskmkoasxbtcuk9ghncfmjpn26gqszibsevojbvwvny4ucevsnx/jpm1cww8mndnnxu69x08ylcqyvo2v1bx1jc3svnl7z3dv3zw47mg4fzi0ccxi0forjixy0lzumdjlbegrz0jxh93kfvebceljfq8mcxejnoa0pbgplxnmwxxs2tu49ho16lagvjl/8hpoua6dckkhrizrtt2zytwtgeaysqtsaqvanvnlbdfoi8ivzkjkvm0lys2qubqzmi07qsqjwim0ih1noyqidlpzqvn4qpuahrhqjys4u393zcischl5ujjfus56ufif109veovmlcepihzpb4upgyqgetowoijgxsaaicyo3hxiiriik51hwydgl568tdqnum3v7bulsvo6ikmejsejqaibxiimuaut0ayypijn8arejcfjxxg3pualk0brcwt+wpj8acrvmze=

More information

Algorithmic Game Theory and Applications

Algorithmic Game Theory and Applications Algorithmic Game Theory and Applications Lecture 18: Auctions and Mechanism Design II: a little social choice theory, the VCG Mechanism, and Market Equilibria Kousha Etessami Reminder: Food for Thought:

More information

Optimal Auctions with Correlated Bidders are Easy

Optimal Auctions with Correlated Bidders are Easy Optimal Auctions with Correlated Bidders are Easy Shahar Dobzinski Department of Computer Science Cornell Unversity shahar@cs.cornell.edu Robert Kleinberg Department of Computer Science Cornell Unversity

More information

Chapter 5. Transmission networks and electricity markets

Chapter 5. Transmission networks and electricity markets Chapter 5. Transmission networks and electricity markets 1 Introduction In most of the regions of the world: assumptions that electrical energy can be traded as if all generators were connected to the

More information

Robust Mechanism Design and Robust Implementation

Robust Mechanism Design and Robust Implementation Robust Mechanism Design and Robust Implementation joint work with Stephen Morris August 2009 Barcelona Introduction mechanism design and implementation literatures are theoretical successes mechanisms

More information

Weak Robust (Virtual) Implementation

Weak Robust (Virtual) Implementation Weak Robust (Virtual) Implementation Chih-Chun Yang Institute of Economics, Academia Sinica, Taipei 115, Taiwan April 2016 Abstract We provide a characterization of (virtual) implementation in iterated

More information

Growing competition in electricity industry and the power source structure

Growing competition in electricity industry and the power source structure Growing competition in electricity industry and the power source structure Hiroaki Ino Institute of Intellectual Property and Toshihiro Matsumura Institute of Social Science, University of Tokyo [Preliminary

More information

Lecture Slides - Part 4

Lecture Slides - Part 4 Lecture Slides - Part 4 Bengt Holmstrom MIT February 2, 2016. Bengt Holmstrom (MIT) Lecture Slides - Part 4 February 2, 2016. 1 / 65 Mechanism Design n agents i = 1,..., n agent i has type θ i Θ i which

More information

Design Patent Damages under Sequential Innovation

Design Patent Damages under Sequential Innovation Design Patent Damages under Sequential Innovation Yongmin Chen and David Sappington University of Colorado and University of Florida February 2016 1 / 32 1. Introduction Patent policy: patent protection

More information

Answers to Spring 2014 Microeconomics Prelim

Answers to Spring 2014 Microeconomics Prelim Answers to Spring 204 Microeconomics Prelim. To model the problem of deciding whether or not to attend college, suppose an individual, Ann, consumes in each of two periods. She is endowed with income w

More information

Online Appendix to A search model of costly product returns by Vaiva Petrikaitė

Online Appendix to A search model of costly product returns by Vaiva Petrikaitė Online Appendix to A search model of costly product returns by Vaiva Petrikaitė 27 May A Early returns Suppose that a consumer must return one product before buying another one. This may happen due to

More information

Teoria das organizações e contratos

Teoria das organizações e contratos Teoria das organizações e contratos Chapter 6: Adverse Selection with two types Mestrado Profissional em Economia 3 o trimestre 2015 EESP (FGV) Teoria das organizações e contratos 3 o trimestre 2015 1

More information

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 17th May 2018 Time: 09:45-11:45. Please answer all Questions.

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 17th May 2018 Time: 09:45-11:45. Please answer all Questions. COMP 34120 Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE AI and Games Date: Thursday 17th May 2018 Time: 09:45-11:45 Please answer all Questions. Use a SEPARATE answerbook for each SECTION

More information

Randomized Truthful Auctions of Digital Goods are Randomizations over Truthful Auctions

Randomized Truthful Auctions of Digital Goods are Randomizations over Truthful Auctions Randomized Truthful Auctions of Digital Goods are Randomizations over Truthful Auctions Aranyak ehta Georgia Institute of Technology 802, Atlantic Dr. Atlanta, USA aranyak@cc.gatech.edu Vijay V. Vazirani

More information

Mechanism Design: Basic Concepts

Mechanism Design: Basic Concepts Advanced Microeconomic Theory: Economics 521b Spring 2011 Juuso Välimäki Mechanism Design: Basic Concepts The setup is similar to that of a Bayesian game. The ingredients are: 1. Set of players, i {1,

More information

Bidding Rings Revisited

Bidding Rings Revisited Bidding Rings Revisited Kevin Leyton-Brown Yoav Shoham Moshe Tennenholtz Navin A.R. Bhat Abstract We identify a self-enforcing collusion protocol (a bidding ring ) for first-price auctions. Our work allows

More information

Multi-object auctions (and matching with money)

Multi-object auctions (and matching with money) (and matching with money) Introduction Many auctions have to assign multiple heterogenous objects among a group of heterogenous buyers Examples: Electricity auctions (HS C 18:00), auctions of government

More information

An auction with finite types

An auction with finite types This is a draft; email me with comments, typos, clarifications, etc. An auction with finite types Let s consider the simplest case of an auction with finite types: there are two players i {1, 2} with types

More information

Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility

Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility Michael Albert Department of Computer Science University of Texas at Austin 237 Speedway, Stop D9500 Austin, TX 7872, USA malbert@cs.utexas.edu Maximizing Revenue with Limited Correlation: The Cost of

More information

Fans economy and all-pay auctions with proportional allocations

Fans economy and all-pay auctions with proportional allocations Fans economy and all-pay auctions with proportional allocations Pingzhong Tang and Yulong Zeng and Song Zuo Institute for Interdisciplinary Information Sciences Tsinghua University, Beijing, China kenshinping@gmail.com,cengyl3@mails.tsinghua.edu.cn,songzuo.z@gmail.com

More information

A Rothschild-Stiglitz approach to Bayesian persuasion

A Rothschild-Stiglitz approach to Bayesian persuasion A Rothschild-Stiglitz approach to Bayesian persuasion Matthew Gentzkow and Emir Kamenica Stanford University and University of Chicago December 2015 Abstract Rothschild and Stiglitz (1970) represent random

More information

Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility

Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility Maximizing Revenue with Limited Correlation: The Cost of Ex-Post Incentive Compatibility Michael Albert Department of Computer Science University of Texas at Austin 237 Speedway, Stop D9500 Austin, TX

More information

Multidimensional Private Value Auctions

Multidimensional Private Value Auctions Multidimensional Private Value Auctions Hanming Fang Stephen Morris First Draft: May 2002 This Draft: March 2003 Abstract We consider parametric examples of two-bidder private value auctions in which each

More information

Characterization of equilibrium in pay-as-bid auctions for multiple units

Characterization of equilibrium in pay-as-bid auctions for multiple units Economic Theory (2006) 29: 197 211 DOI 10.1007/s00199-005-0009-y RESEARCH ARTICLE Indranil Chakraborty Characterization of equilibrium in pay-as-bid auctions for multiple units Received: 26 April 2004

More information

REPUTATION IN REPEATED SECOND-PRICE AUCTIONS. Sushil Bikhchandani. Abstract

REPUTATION IN REPEATED SECOND-PRICE AUCTIONS. Sushil Bikhchandani. Abstract REPUTATION IN REPEATED SECOND-PRICE AUCTIONS Sushil Bikhchandani Abstract A model in which two bidders take part in a series of second-price, commonvalue, auctions is examined. The question of an optimal

More information

Bilateral Trading in Divisible Double Auctions

Bilateral Trading in Divisible Double Auctions Bilateral Trading in Divisible Double Auctions Songzi Du Haoxiang Zhu March, 014 Preliminary and Incomplete. Comments Welcome Abstract We study bilateral trading between two bidders in a divisible double

More information

Second Price Auctions with Valuations and Participation Costs Both Privately Informed

Second Price Auctions with Valuations and Participation Costs Both Privately Informed Second Price Auctions with Valuations and Participation Costs Both Privately Informed Xiaoyong Cao Department of Economics University of International Business and Economics Beijing, China 129 Guoqiang

More information

Multidimensional Private Value Auctions

Multidimensional Private Value Auctions Multidimensional Private Value Auctions Hanming Fang Stephen Morris First Draft: May 2002 This Draft: February 2004 Abstract We consider parametric examples of symmetric two-bidder private value auctions

More information

First Price Auctions with General Information Structures: Implications for Bidding and Revenue

First Price Auctions with General Information Structures: Implications for Bidding and Revenue First Price Auctions with General Information Structures: Implications for Bidding and Revenue Dirk Bergemann Benjamin Brooks Stephen Morris August 10, 2015 Abstract This paper explores the consequences

More information

Mechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44

Mechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44 Mechanism Design Terence Johnson University of Notre Dame December 7, 2017 Terence Johnson (ND) Mechanism Design December 7, 2017 1 / 44 Market Design vs Mechanism Design In Market Design, we have a very

More information

First price auctions with general information structures: Implications for bidding and revenue

First price auctions with general information structures: Implications for bidding and revenue First price auctions with general information structures: Implications for bidding and revenue Dirk Bergemann Yale Benjamin Brooks BFI/UChicago Stephen Morris Princeton New York University Abu Dhabi December

More information