Essays on Dynamic Matching Markets by Chi Leung Wong B.Soc.Sci., The Chinese University of Hong Kong, 2000 M.Phil., The Chinese University of Hong Kong, 2002 A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF Doctor of Philosophy in The Faculty of Graduate Studies (Economics) The University of British Columbia (Vancouver) September, 2009 c Chi Leung Wong 2009 ° Abstract This dissertation studies dynamic matching and bargaining games with two-sided private information bargaining. There is a market in which a large number of heterogeneous buyers and sellers search for trading partners to trade with. Traders in the market are randomly matched pairwise. Once a buyer and a seller meet, they bargain following the randomproposer protocol: either the buyer or the seller (randomly chosen) makes a take-it-orleave-it oﬀer to the other party. The traders leave once they successfully trade, and the market is continuously replenished with new-born buyers and sellers who voluntarily choose to enter. We study the steady state with positive entry. There are (except the asymmetric information) two kinds of frictions: time discounting and explicit search costs. Chapter 2 addresses existence and uniqueness of equilibrium. It provides a simple necessary and suﬃcient condition for the existence of a nontrivial steady-state equilibrium. The equilibrium is unique if the discount rate is small relative to the search costs. This chapter also analyzes how the composition of frictions aﬀects the patterns of equilibria. It shows that if the discount rate is small relative to the search costs, in equilibrium every meeting results in trade. If the discount rate is relatively large, some meetings do not result in trade. Chapter 3 shows that private information typically deters entry. Because of search externalities, this entry-deterring eﬀect may be socially desirable or undesirable. We provide and interpret a simple condition under which private information improves welfare. Chapter 4 studies the convergence properties of equilibria as frictions vanish. It not only shows that, as frictions vanish, the equilibrium price range collapses to the Walrasian price and the equilibrium welfare converges to the Walrasian welfare level, but also provides the rate of convergence. Under random-proposer bargaining, welfare converges at the fastest possible rate among all ii Abstract bargaining mechanisms. If we assume double auction instead of random-proposer bargaining, equilibria might converge at a slower rate or even not converge at all. These results also hold under full information bargaining. It suggests that private information does not aﬀect asymptotic eﬃciency, but bargaining protocol might. iii Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii Table of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Abstract 1.1 Dynamic matching and bargaining games . . . . . . . . . . . . . . . . . . . 1 1.2 Baseline model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.4 Other related literature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2 Dynamic Matching and Two-sided Private Information Bargaining . . 7 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 The model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.3 Nontrivial steady-state equilibria . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 Basic equilibrium properties . . . . . . . . . . . . . . . . . . . . . . . . . . 15 2.5 Full-trade equilibria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 2.6 Uniqueness of equilibrium . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 2.7 Necessary and suﬃcient condition for existence . . . . . . . . . . . . . . . . 37 2.8 Concluding remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 . . . . . 48 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 3 Role of Information Structure in Dynamic Matching Markets 3.1 Introduction iv Table of Contents 3.2 Private information model . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 3.3 Full information (Mortensen-Wright) model . . . . . . . . . . . . . . . . . . 53 3.3.1 Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 3.3.2 Basic equilibrium properties . . . . . . . . . . . . . . . . . . . . . . 56 3.3.3 Necessary and suﬃcient condition for existence . . . . . . . . . . . . 61 3.3.4 Full-trade equilibrium . . . . . . . . . . . . . . . . . . . . . . . . . . 62 3.4 No-discounting case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64 3.5 Full-trade equilibria and bargaining eﬃciency . . . . . . . . . . . . . . . . . 68 3.6 Entry eﬀect of private information . . . . . . . . . . . . . . . . . . . . . . . 70 3.7 Concluding remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 . . . . . . . . . . . . 80 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 4 Rate of Convergence towards Perfect Competition 4.1 Introduction 4.2 The baseline model 4.3 Rate of convergence of trading prices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 84 4.3.1 Convergence of full-trade equilibria . . . . . . . . . . . . . . . . . . 85 4.3.2 General convergence theorem . . . . . . . . . . . . . . . . . . . . . . 85 4.3.3 Proof of Theorem 7 . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 4.3.4 Full information model . . . . . . . . . . . . . . . . . . . . . . . . . 91 4.4 Rate of convergence of welfare . . . . . . . . . . . . . . . . . . . . . . . . . 94 4.5 Results for k-double auction . . . . . . . . . . . . . . . . . . . . . . . . . . 101 4.6 Concluding remarks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 5.1 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 5.2 Discussions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 5.2.1 Continuous time, continuous types . . . . . . . . . . . . . . . . . . . 116 5.2.2 Symmetric pure strategies . . . . . . . . . . . . . . . . . . . . . . . 117 5.2.3 Random-proposer bargaining . . . . . . . . . . . . . . . . . . . . . . 117 5 Conclusion v Table of Contents 5.2.4 Choice of friction space . . . . . . . . . . . . . . . . . . . . . . . . . 118 5.2.5 Constant-returns-to-scale matching function . . . . . . . . . . . . . 119 5.2.6 Continuum of traders . . . . . . . . . . . . . . . . . . . . . . . . . . 119 Further research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122 5.3 Appendices A Additional Details for Existence of Nontrivial Steady-state Equilibrium 126 B Calculations for Section 3.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 vi List of Figures 2.1 Proposing and responding strategies in an equilibrium with overlapping supports (which must be non-full-trade) . . . . . . . . . . . . . . . . . . . . . . 2.2 21 Proposing and responding strategies in a non-full-trade equilibrium with separated supports . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.3 Proposing and responding strategies in a full-trade equilibrium . . . . . . . 24 2.4 Interpretation of ζ 0 and K (ζ 0 ) . . . . . . . . . . . . . . . . . . . . . . . . . 26 2.5 Diﬀerent patterns of equilibria in diﬀerent regions of friction space . . . . . 37 2.6 Illustration of the idea behind the existence proof . . . . . . . . . . . . . . . 41 3.1 Equilibrium when discount rate is zero . . . . . . . . . . . . . . . . . . . . . 69 4.1 Construction of a double auction full-trade equilibrium . . . . . . . . . . . . 104 4.2 A two-step equilibrium under double auction . . . . . . . . . . . . . . . . . 108 vii Chapter 1 Introduction 1.1 Dynamic matching and bargaining games This dissertation contributes to the literature on dynamic matching and bargaining games (DMBG). This strand of literature stands in between two rather extreme paradigms in economic theory: the Walrasian theory and the bargaining theory. On one extreme, the Walrasian theory assumes that trading happens in a centralized market where every agent has no market power at all (i.e. every agent takes the market price as given). The concept of Walrasian equilibrium is usually justified by telling a story with a large number of buyers and sellers, perfect information, and/or a Walrasian auctioneer enforcing the trading process. On the other extreme, the bargaining theory assumes that a small number of agents (say a pair of buyer and seller) strategically bargain over the economic outcome (say the quantity transacted and the trading price), possibly with private information. The methodology and equilibrium concepts in the arena of bargaining theory are game-theoretic. The literature on DMBG, which is in the middle, assumes that the market has a large number of buyers and sellers, but they cannot gather together to come up with trades. Instead, the quantities transacted and the trading prices are determined by a lot of small bargaining games, each of which is among a small coalition of agents (usually a pair of buyer and seller). The trading process is dynamic rather than a one-shot game. Also, all the agents in the market are connected through the way that the formation of bargaining coalitions varies over time, such that each agent is able to meet many other agents at diﬀerent points of time. But this connection is only imperfect, because meeting other agents takes time, and it 1 Chapter 1. Introduction is costly due to either impatience, or a probability of death, or a fixed search cost, depending on the specific modeling. These "costs of delay" are called frictions of the market. And we call such a market with frictions a dynamic matching and bargaining market, or simply a dynamic matching market. The labor and the housing markets are often cited examples of this kind of markets. The nature of DMBG is suitable for economic theorists to build a game-theoretic foundation for the Walrasian theory. Indeed, a main focus of this strand of literature has been on the following question: as the frictions vanish, do the (game-theoretic) equilibrium outcomes of dynamic matching and bargaining games converge to the perfectly competitive outcome predicted by Walrasian equilibrium? Until very recently, most papers in the literature assume that the bargaining games are bilateral and under full information, i.e. a buyer and a seller bargain knowing each other’s willingness-to-pay and cost. They include: Mortensen (1982), Rubinstein and Wolinsky (1985, 1990), Gale (1986a,b, 1987) and Mortensen and Wright (2002), among others.1 Satterthwaite and Shneyerov (2007) have recently introduced two-sided private information in a dynamic matching market where sellers use auctions, and have shown that the presence of private information does not prevent convergence to perfect competition.2 1 A notable exception is the unpublished manuscript Butters (1979). Other papers that have incorporated private information in some form include Wolinsky (1988), De Fraja and Sakovics (2001) and Serrano (2002). 2 Several recent papers have explored convergence under private information in more detail: Satterthwaite and Shneyerov (2008) show convergence in the model that is a replica of Satterthwaite and Shneyerov (2007) except that it has exogenous exit rate. Lauermann (2008) shows convergence even if one side of the market has all the bargaining power, and Lauermann (2006b) shows that in that case, the welfare under private information may be higher than under full information. Atakan (2008) provides a generalization to multiple units. Lauermann (2006a) derives a set of general conditions for convergence. In addition, Hurkens and Vulkan (2006, 2007) study the role of privately observed deadlines in a matching and bargaining market. 2 Chapter 1. Introduction 1.2 Baseline model This dissertation studies a dynamic matching market, modeled as a DMBG. Our baseline model is a replica of the one in Mortensen and Wright (2002), modified with two-sided private information bargaining. It is roughly described as follows.3 There is a market in which a large number (more precisely, continuum) of risk-neutral buyers and sellers search for trading partners to trade with. Each buyer has a unit demand for a homogeneous and indivisible good; and each seller has a unit supply of the same good. The buyers and sellers are heterogeneous: diﬀerent buyers have diﬀerent valuations (or willingness-to-pay) and diﬀerent sellers have diﬀerent costs. Traders in the market are randomly matched pairwise. The mass of total matched pairs per unit time is determined by some unspecified Pissarides (2000) style matching function.4 Once a buyer and a seller meet, they bargain following the so-called random-proposer protocol: either the buyer or the seller (randomly chosen) makes a take-it-or-leave-it oﬀer to the other party. The traders leave once they successfully trade, and the market is continuously replenished with new-born buyers and sellers who voluntarily choose to enter. We assume the market is in steady state and with positive mass of traders in it. From each trader’s point of view, searching for a trading partner takes time, and it is costly both because traders are impatient (parameterized by a discount rate) and they have to spend other resources like money or eﬀort to search (parameterized by explicit search costs). Thus, the "costs of delay", or frictions, are multi-dimensional in 3 The modeling methods for DMBG can be divided into two classes: non-steady-state models and steady- state models. In a non-steady-state model (e.g. Moreno and Wooders (2002)), the market starts with a fixed number of agents and no more agent comes in later on. As time collapses, the number of agents left in the market decreases. On the other hand, in a steady-state model, new agents keep coming in, and attention is restricted to the steady-state equilibrium. Gale (1987) shows convergence for both versions of his model. We will use the steady-state approach throughout this dissertation. As a matter of fact, our model (or Mortensen-Wright model) is also a version of search models. 4 A Pissarides-style matching function assigns a mass of total matched pairs for each combination of buyers’ and sellers’ masses currently participating in the market. With such a matching function, the precise matching process need not be specified, pretty much like a production function in macro models assigns a level of output for each combination of inputs, without specifying the precise production process. 3 Chapter 1. Introduction our model. 1.3 Summary Here we briefly summarize what will be seen in the following three chapters. More detailed summaries will be presented in the introduction sections of those chapters. Chapter 2 proves the existence of equilibrium for our baseline model, characterizes the equilibrium patterns, and develops a bunch of results that are useful for the subsequent two chapters. Chapter 3 analyzes the impacts of the private information in bargaining. Chapter 4 derives convergence properties of the equilibrium outcome as frictions vanish. Roughly speaking, Chapter 2 and Chapter 3 are concerned with markets with significant frictions; while Chapter 4 is concerned with markets with small frictions. More precisely, in Chapter 2 and Chapter 3 the level and composition of frictions are considered to be fixed; while frictions are considered to be vanishing in Chapter 4.5 A main interest throughout this dissertation is how the private information in bargaining games shapes the equilibrium outcome of a dynamic matching market. A recent paper by Satterthwaite and Shneyerov (2007) shows in a similar but diﬀerent model that equilibrium outcome converges towards perfect competition as frictions vanish, even when traders hold private information. However their model might have no natural full information counterpart.6 Furthermore, even when private information in bargaining does not prevent convergence, would it make the convergence any slower? This question has not been addressed in the literature. On the other hand, if the private information has no impact 5 6 This dichotomy is not strict. The core results of Chapter 4 apply to any level of frictions. The main diﬀerences between the model of Satterthwaite and Shneyerov (2007) and ours are that: in their model, time is discrete; every buyer is randomly matched with one seller in each period, so that a seller might be matched with several buyers, one buyer, or no buyer; and sellers sell their goods through first-price auctions without committed reserve price. Thus their model assumes a specific multi-lateral matching and bargaining process. In contrast, our model assumes bilateral matching and bargaining (which is common in the literature of DMBG and search models), with a general matching function and a general distribution of bargaining power. 4 Chapter 1. Introduction in the limit, one might wonder what impacts it has in the "out-of-the-limit" case. Is the private information always bad in the social point of view? The analyses in this dissertation shed some light on all these issues. 1.4 Other related literature The market games we analyze in this dissertation can also be counted as a search model. Indeed, our modeling choices include random matching, a Pissarides-style matching function, and steady state. All these are common features of classic labor search models (although recent developments allow directed search, on-the-job search, etc.). The literature on search models of labor market, surveyed for example in Mortensen and Pissarides (1999) and more recently Rogerson, Shimer, and Wright (2005), is large. While the literature on DMBG is micro-oriented, the literature on labor search models is macro-oriented. The latter studies topics like equilibrium unemployment, wage dispersions, and the constrained eﬃciency when the market is plagued by search frictions.7 Most if not all of the labor search literature neglects the private information in bargaining.8 Besides, many labor search models simply assume homogeneous workers and homogeneous firms, so that the information structure at the bargaining stages is irrelevant. This dissertation, in contrast, emphasizes the role of information structure at the bargaining stages. In this regard, this dissertation contributes to the search theory, by allowing private information. Another strand of literature related to this dissertation is the literature on static double auction. As we mentioned before, DMBG stands in between the Walrasian theory and bargaining theory, and hence theorists build the foundation of Walrasian equilibrium on it. The 7 Search theory has also been applied to monetary models and marriage models. But the models in these areas are not as relevant to this dissertation as the labor search models. 8 In the labor search literature, when matching is random (rather than directed), typically the (generalized) Nash bargaining solution is assumed. 5 Chapter 1. Introduction literature on static double auction is very similar to DMBG in this aspect. A number of papers on static double auction ask whether the equilibrium outcomes converge to the Walrasian outcome as the number of traders n gets large. More importantly, this literature also looks at the rate of convergence. In particular, Rustichini, Satterthwaite, and Williams (1994) show robust convergence of double-auction equilibria in the symmetric class at the ¢ ¡ rate O (1/n) for the bid/ask strategies and the rate O 1/n2 for the ex-ante traders’ wel- fare.9 Moreover, this literature also has asymptotic eﬃciency results: the double auction converges at the rate that is fastest among all incentive-compatible and individually rational mechanisms (Satterthwaite and Williams (2002); Tatur (2005)). Cripps and Swinkels (2005) substantially enrich the model by allowing correlation among bidders’ valuations, ¢ ¡ and show convergence at the rate O 1/n2−ε , where ε > 0 is arbitrarily small.10 In contrast, as far as I know, the rate of convergence has not been addressed in the literature of DMBG. Comparing with the rather sophisticated literature on static double auction, there is a gap in the DMBG literature.11 Our rate of convergence analysis in Chapter 4 takes a step to fill this gap. 9 Other related papers include Gresik and Satterthwaite (1989), Satterthwaite and Williams (1989), Sat- terthwaite (1989), and Williams (1991). 10 Reny and Perry (2006) allow interdependent values and show that it is almost eﬃcient and almost fully aggregates information as n → ∞, although the rate of convergence is not addressed. 11 Of course, the natures of convergence in these two strands of literature are diﬀerent. For the static double auction, we let the number of traders get large. For DMBG, we let the level of frictions get small. However, they are analogous to each other, because both of them reflect increasing intensity of competition, as we will discuss in Chapter 4. After all, both of them lead to the convergence towards the perfect competition outcome. 6 Chapter 2 Dynamic Matching and Two-sided Private Information Bargaining 2.1 Introduction This chapter starts our formal analysis of dynamic matching and bargaining markets.12 We will study a replica of Mortensen and Wright (2002) model, modified with two-sided private information bargaining. There is a market in which continua of risk-neutral buyers and sellers search for trading partners to trade with. Each buyer has a unit demand for a homogeneous and indivisible good; and each seller has a unit supply of the same good. The buyers and sellers are heterogeneous: diﬀerent buyers have diﬀerent valuations v ∈ [0, 1] and diﬀerent sellers have diﬀerent costs c ∈ [0, 1]. Our model has features of a steady-state search-theoretic model, where the matching between buyers and sellers is pairwise, random, and described by a Pissarides-style matching function M (B, S) that gives the matching rate as a function of the masses of buyers B and sellers S currently participating in the market. In steady state and from the standpoint of a particular trader, matchings come up according to a Poisson process. The Poisson arrival rate of being matched is αB ≡ M (B, S) /B for a buyer, or αS ≡ M (B, S) /S for a seller. Since we assume that M exhibits constant returns to scale, the arrival rates αB and αS only depend on the buyer-seller ratio ζ ≡ B/S. Our model also has the feature of two-sided asymmetric information bilateral bargaining. 12 The chapter significantly includes the materials in my manuscript "Bilateral Matching and Bargaining with Private Information", which is joint with my dissertation co-supervisor Artyom Shneyerov. 7 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining The bargaining game between a pair of buyer and seller follows what we call the randomproposer protocol: with probability β B ∈ (0, 1) the buyer makes a take-it-or-leave-it price oﬀer to the seller; and with probability β S ≡ 1 − β B the seller makes a take-it-or-leave-it price oﬀer to the buyer. The traders leave once they successfully trade, and the market is continuously replenished with new-born buyers and sellers who voluntarily choose to enter. Another important feature of our model is that our notion of frictions is multi-dimensional. There are two kinds of search frictions: searching for a trading partner takes time, parameterized by an instantaneous discount rate r > 0, and also takes other resources (e.g. money, eﬀort), parameterized by explicit search costs κB > 0 for buyers and κS > 0 for sellers, per unit time. The main purpose of this chapter is to prove the existence of equilibrium, and to understand the equilibrium patterns and properties, under diﬀerent combinations of frictions. This chapter will also be the foundation of the analyses of the next two chapters. Our fundamental result (Theorem 3) is: at least one nontrivial (i.e. with positive mass of traders participating) steady-state equilibrium exists if and only if κS κB + < 1, αB (ζ 0 ) αS (ζ 0 ) (2.1) where ζ 0 ≡ β B κS /β S κB , and αB (ζ 0 ) (resp. αS (ζ 0 )) is a buyer’s (resp. seller’s) Poisson arrival rate of being matched when the (steady-state) buyer-seller ratio is ζ 0 . An uninteresting trivial equilibrium, in which nobody participates, always exists. Indeed, if searching for trading partners is very costly, only the trivial equilibrium can exist. Roughly speaking, our fundamental existence result says that some nontrivial steady-state equilibrium also exists if the search costs κB and κS are moderate. To get more sense of the above necessary and suﬃcient condition (2.1) for the existence of some nontrivial steady-state equilibrium, let us restrict attention to the no-discounting case, i.e. r → 0. In this case, equilibrium analysis becomes very tractable and it is easy to show that the equilibrium buyer-seller ratio must be ζ 0 , which simply reflects the ratio of buyers’ and sellers’ bargaining powers, and the ratio of buyers’ and sellers’ per-unit-time search costs. Then for an unmatched buyer to bring himself matched, the expected total search costs is 8 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining κB /αB (ζ 0 ). Similarly, for an unmatched seller the expected total search costs is κS /αS (ζ 0 ). On the other hand, since we normalize the supports of buyers’ valuations and sellers’ costs to be [0, 1], the maximum gain of trade that a pair of buyer and seller can realize is 1. Therefore, condition (2.1) simply says that the maximum gain a buyer-seller pair can realize is greater than the expected total search costs they incur to get matched. While this existence condition is rather natural in the no-discounting case, our result shows that the existence condition does not change at all in the general case.13 We distinguish two kinds of nontrivial steady-state equilibrium: "full-trade equilibrium" (i.e. in which every meeting results in trade) and "non-full-trade equilibrium". Given that some nontrivial steady-state equilibrium exists, we make predictions on the equilibrium pattern (full-trade vs non-full-trade): there are two critical levels of discount rate r∗ and r, with 0 < r < r ∗ , such that a full-trade equilibrium exists if and only if r ≤ r∗ (Theorem 1); and only a full-trade equilibrium, but no non-full-trade one, exists if r ≤ r (Theorem 2).14 The formulas for r∗ and r are explicitly derived, in terms of parameters including (κB , κS ). In particular, both r∗ and r are increasing in (κB , κS ); and both r∗ and r tend to 0 as (κB , κS ) → 0. These results suggest that: in (nontrivial steady-state) equilibrium whether every meeting results in a trade mainly depends not on the level of frictions, but the relativity of the two kinds of frictions. More concretely, if r is small relative to (κB , κS ), then in equilibrium every meeting results in a trade; if on the other hand r is large relative to (κB , κS ), in equilibrium some meetings lead to bargaining breakdowns. Satterthwaite and Shneyerov (2007) also provide an existence theorem for a dynamic matching market with two-sided asymmetric information. Their existence theorem (SS existence theorem), in our language, is: there exists a full-trade equilibrium if κB , κS and r/ min {κB , κS } are suﬃciently small. Their model involves one-to-many matchings 13 If r > 0, then both the left-hand side and the right-hand side of (2.1) are subject to discounting. Since the two eﬀects cancel out, the generality of (2.1) is possible. 14 Since there can be at most one full-trade equilibrium, r ≤ r is also a suﬃcient condition for the uniqueness of nontrivial steady-state equilibrium. 9 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining and auctions, unlike ours.15 By switching to a bilateral matching and bargaining model like Mortensen and Wright (2002), we are able to prove much sharper results than theirs. Compared with our results, SS existence theorem has several limitations. First, how small κB , κS and r/ min {κB , κS } have to be is unknown. Second, when r is large relative to (κB , κS ), it is unknown whether some nontrivial steady-state equilibrium exists. Third, SS existence theorem makes no prediction on the equilibrium pattern for any friction profile: small r relative to (κB , κS ) does not imply full trade; and large r relative to (κB , κS ) does not imply non-full trade. Our results in this chapter do not have these limitations. The aforementioned second limitation of SS existence theorem also brings about a limitation of their convergence theorem. Their convergence theorem (SS convergence theorem), again in our language, is: along any sequence of nontrivial steady-state equilibria associated with a sequence of (r, κB , κS ) that tends to 0 proportionally, the set of transaction prices and the welfare of every agent must converge to their counterparts under perfect competition. The limitation of SS convergence theorem is: it does not preclude the possibility that, even when we let (r, κB , κS ) tend to 0 proportionally, nontrivial steady-state equilibrium keeps absent. In contrast, our convergence results presented in Chapter 4, with the foundation of our existence results, do not have this limitation. The rest of this chapter proceeds as follows. Section 2.2 introduces the model. Section 2.3 defines the equilibrium concept. Section 2.4 analyzes the basic equilibrium properties. Section 2.5 studies full-trade equilibria and the condition under which this kind of equilibria exist. Section 2.6 proves that the equilibrium is unique when the discount rate is small. Section 2.7 presents and proves the "general existence theorem". Section 2.8 concludes. Additional details for the general existence proof is in Appendix A. 2.2 The model The agents in our model are potential buyers and sellers of a homogeneous, indivisible good. Each buyer has a unit demand for the good, while each seller has a unit supply. All traders 15 For more details of Satterthwaite and Shneyerov (2007) model, see footnote 6. 10 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining are risk neutral. Potential buyers are heterogeneous in their valuations (or types) v of the good. Potential sellers are also heterogeneous in their costs (or types) c of providing the good. For simplicity, we assume v, c ∈ [0, 1]. Time is continuous and infinite horizon. The instantaneous discount rate is r > 0. The details of the model are described as follows: • Entry: Potential buyers and sellers are continuously born at rates b and s respectively. We normalize the aggregate born rate to be 1, i.e. b + s = 1. The type of a new-born buyer is drawn i.i.d. from the c.d.f. F (v) and the type of a new-born seller is drawn i.i.d. from the c.d.f. G(c). Each trader’s type will not change once it is drawn. Entry (or participation, or being active) is voluntary. Each potential trader decides whether to enter the market once he is born. Those who do not enter will get zero payoﬀ. Those who enter must incur the search cost continuously at the rate κB for buyers and κS for sellers, until they leave the market. • Matching: Active buyers and sellers are randomly and continuously matched pairwise at a flow rate given by a Pissarides (2000) style matching function M (B, S), where B and S are the masses of active buyers and active sellers currently in the market. • Bargaining: Once a pair of buyer and seller are matched, they bargain without observing each other’s type. The bargaining protocol is what we call random-proposer bargaining: with probability β B ∈ (0, 1), the buyer makes a take-it-or-leave-it price oﬀer to the seller, then the seller chooses either to accept or reject. And with probability β S ≡ 1 − β B the seller proposes and the buyer responds. (The "bargaining weights" β B and β S can be interpreted as the buyer’s and seller’s relative bargaining powers.) We also assume the market is anonymous, so that bargainers do not know their partners’ market history, e.g. how long they have been in the market, what they proposed previously, and what oﬀers they rejected previously. • If a type v buyer and a type c seller trade at a price p, then they leave the market with (current value) payoﬀ v − p and p − c respectively. If the bargaining between the matched pair breaks down, both traders can either stay in the market waiting for 11 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining another match (and incur the search costs) as if they were never matched, or simply exit and never come back. We make the following assumptions on the primitives of our model. Assumption 1 (distributions of inflow types) The cumulative distributions F (v) and G(c) of inflow types have densities f (v) and g(c) on (0, 1), bounded away from 0 and ∞: 0 < f ≤ f (v) ≤ f¯ < ∞, 0 < g ≤ g (c) ≤ ḡ < ∞. Assumption 2 (matching function) The matching function M is continuous on R2+ , nondecreasing in each argument, exhibits constant returns to scale (i.e. homogeneous of degree one), and satisfies M (B, S) = 0 if B = 0 or S = 0. Given the current mass of buyers B > 0 and the mass of sellers S > 0, trading opportunities for a buyer come at the Poisson arrival rate M (B, S) /B.16 Similarly, trading opportunities for a seller come at the Poisson arrival rate M (B, S) /S. It is more convenient to work with a normalized matching function. Let ζ ≡ B/S be the ratio of buyers to sellers (or market tightness), and define m(ζ) ≡ M (ζ, 1). Since the matching technology is assumed to exhibit constant returns to scale, it is easy to see that m(ζ) is also equal to M (B, S) /S, which is a seller’s Poisson arrival rate of being 16 That is, M(B, S)/B is the probability that a buyer is matched over a short time period of length dt divided by the length dt. 12 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining matched. Similarly, m (ζ) /ζ is equal to M (B, S) /B, a buyer’s Poisson arrival rate of being matched. We denote these two arrival rates as αB (ζ) and αS (ζ): αB (ζ) ≡ m (ζ) , ζ αS (ζ) ≡ m (ζ) . Assumption 2 implies that 1. αB (ζ) is continuous and nonincreasing; 2. αS (ζ) is continuous and nondecreasing; and 3. αB (∞) = αS (0) = 0. 2.3 Nontrivial steady-state equilibria Throughout this dissertation we will restrict attention to steady-state equilibria, i.e. ones in which the market distribution of active traders and the agents’ strategies are time-invariant. Like other DMBG in the literature, our model always has an uninteresting perfect Bayesian equilibrium, in which no potential trader enters. Indeed, if no potential trader enters, not to enter is optimal to every potential trader. Throughout this dissertation we will only consider nontrivial equilibria, i.e. ones in which positive entry occurs (or equivalently, positive trade occurs, or the steady-state market mass of active traders is positive). We thus call our equilibrium notion nontrivial steady-state equilibrium, which will be formally defined in a moment. Let WB , WS : [0, 1] → R+ be the value functions for buyers and sellers: WB (v) is the continuation payoﬀ of a type v buyer whenever he has not traded and is unmatched; and WS (c) is the continuation payoﬀ of a type c seller whenever she has not traded and is unmatched. Let NB , NS : [0, 1] → R+ be the (stock) market distribution functions: NB (v) is the mass of buyers in the market with valuations less than or equal to v; and NS (c) is the mass of sellers with costs less than or equal to c. (In this notation, B = NB (1) and S = NS (1).) Let χB , χS : [0, 1] → {0, 1} be the entry strategies: buyers with valuation v enter if and only if χB (v) = 1; sellers with cost c enter if and only if χS (c) = 1. Also 13 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining let pB , pS : [0, 1] → [0, 1] be the proposing strategies: buyers with valuation v propose the take-it-or-leave-it price oﬀer pB (v); sellers with cost c propose pS (c). Sequential optimality requires that the value functions in steady state satisfy the following Bellman equations. For a type v buyer, rWB (v) = max χ · {αB (ζ)[β B π B (v) Z dNS (c) ] − κB } (v − pS (c) − WB (v)) +β S S χ∈{0,1} (2.2) {c:v−pS (c)≥WB (v)} where π B (v) is the buyer’s capital gain when he becomes a proposer: ⎫ ⎧ ⎪ ⎪ Z ⎨ dNS (c) ⎬ . (v − p − WB (v)) π B (v) ≡ max S ⎪ p∈[0,1] ⎪ ⎭ ⎩ (2.3) {c:p−c≥WS (c)} The buyer’s equilibrium entry strategy χB (v) must be an optimal value of χ in (2.2), and his equilibrium proposing strategy pB (v) must be an optimal value of p in (2.3). The intuition is that, contingent on entry, a buyer’s flow value of search rWB (v) is equal to the expected capital gain due to matching a partner, net of the flow search cost. Specifically, the buyer’s proposed price pB (v) is accepted by the seller if her trade surplus is weakly greater than the value of search, i.e. if pB (v) − c ≥ WS (c). The seller’s proposed price pS (c) is accepted by the buyer if his trade surplus is weakly greater than his value of search, i.e. if v − pS (c) ≥ WB (v). When the buyer trades, the capital gain is his trade surplus minus the value of search. The Bellman equation for the sellers has a similar form: for a type c seller, rWS (c) = max χ · {αS (ζ)[β S π S (c) + Z dNB (v) ] − κS } (pB (v) − c − WS (c)) βB B χ∈{0,1} (2.4) {v:pB (v)−c≥WS (c)} where π S (c) ≡ max ⎧ ⎪ ⎨ Z p∈[0,1] ⎪ ⎩ {v:v−p≥WB (v)} ⎫ ⎪ dNB (v) ⎬ . (p − c − WS (c)) ⎪ B ⎭ (2.5) 14 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining The seller’s equilibrium entry strategy χS (c) must be an optimal value of χ in (2.4), and her equilibrium proposing strategy pS (c) must be an optimal value of p in (2.5). It is convenient to define the trading probabilities in a given meeting, qB (v) for buyers and qS (c) for sellers: qB (v) ≡ β B Z {c:pB (v)−c≥WS (c)} qS (c) ≡ β S Z dNS (c) + βS S {c:v−pS (c)≥WB (v)} dNB (v) + βB B {v:v−pS (c)≥WB (v)} Z Z dNS (c) , S dNB (v) . B {v:pB (v)−c≥WS (c)} In steady state, the rate of inflow of the traders of each type is equal to the rate of the outflow due to trading:17 bχB (v) dF (v) = αB (ζ)qB (v) dNB (v), (2.6) sχS (c) dG(c) = αS (ζ)qS (c) dNS (c). (2.7) We now formally define nontrivial steady-state equilibrium.18 Definition 1 A tuple (WB , WS , χB , χS , pB , pS , NB , NS ) is a nontrivial steady-state equilibrium if B ≡ NB (1) > 0, S ≡ NS (1) > 0, equations (2.2), (2.4), (2.6) and (2.7) hold, and χB , pB , χS , pS solve the optimization problems in (2.2), (2.3), (2.4) and (2.5) respectively. 2.4 Basic equilibrium properties Our characterization of equilibrium patterns begins with showing that the slopes of equilibrium value functions WB (v) and WS (c) are the corresponding "ultimate probabilities of trade", which can be defined as the present value of one dollar to be received at the time of next successful trade. Since every active trader must recover their search costs, these 17 18 Exiting without trade never occurs in steady-state equilibrium. We implicitly assume that traders use symmetric pure strategies. But this is essentially without loss of generality and merely for simplicity of exposition. We will come back to this point in the conclusion chapter. 15 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining ultimate probabilities of trade must be strictly positive on the active regions, i.e. the supports of NB and NS . Therefore the active regions must be intervals [v, 1] and [0, c̄] for some v and c̄. Furthermore, we show that WB and WS are convex, which implies that trading probabilities qB and qS are monotonic.19 Lemma 1 In any nontrivial steady-state equilibrium, there are marginal entering types v, c̄ ∈ (0, 1) such that the supports of NB and NS are [v, 1] and [0, c̄] respectively. Marginal entrants (i.e. type v buyers and type c̄ sellers) are indiﬀerent between entering or not, while the entry preferences of all others are strict. {v : χB (v) = 1} is either [v, 1] or (v, 1]. {c : χS (c) = 1} is either [0, c̄] or [0, c̄). WB is absolutely continuous, convex, nondecreasing on [0, 1], strictly increasing on [v, 1], with WB (v) = 0; whenever diﬀerentiable, WB0 (v) = χB (v) αB (ζ) qB (v) . r + αB (ζ) qB (v) (2.8) WS is absolutely continuous, convex, nonincreasing on [0, 1], strictly decreasing on [0, c̄], with WS (c̄) = 0; whenever diﬀerentiable, WS0 (c) = −χS (c) αS (ζ) qS (c) . r + αS (ζ) qS (c) (2.9) The trading probability qB is strictly positive and nondecreasing on [v, 1], while qS is strictly positive and nonincreasing on [0, c̄]. Proof. We prove the results for buyers only. We use an argument from mechanism design. For any v ∈ [0, 1], define tB (v) ≡ β B Z pB (v) dNS (c) S {c:pB (v)−c≥WS (c)} +β S Z pS (c) dNS (c) . S {c:v−pS (c)≥WB (v)} The buyers’ Bellman equation (2.2) implies for any v, v̂ ∈ [0, 1] and any χ ∈ {0, 1}, rWB (v) ≥ χ · {αB [qB (v̂) v − tB (v̂) − qB (v̂) WB (v)] − κB } 19 Lemma 1 is generally true for any bargaining protocol, as long as the bargainers’ types are private information. We therefore provide a proof that can easily be generalized. 16 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining or equivalently WB (v) ≥ χ · uB (v, v̂) where uB (v, v̂) ≡ αB [qB (v̂) v − tB (v̂)] − κB . r + αB qB (v̂) And the inequality becomes equality if v̂ = v and χ = χB (v). Let UB (v) ≡ maxv̂∈[0,1] uB (v, v̂). We then have WB (v) = χB (v) uB (v, v) = χB (v) UB (v) = max {UB (v) , 0}. For any v̂, uB (v, v̂) is aﬃne and nondecreasing in v. Milgrom and Segal (2002) Envelope Theorem implies UB (v) is absolutely continuous, convex, nondecreasing, and with slope αB qB (v) /(r + αB qB (v)) whenever diﬀerentiable. The same properties are inherited by WB (v), except that its slope becomes χB (v) αB qB (v) /(r + αB qB (v)). Obviously UB (0) < 0. Let v ≡ sup {v ∈ [0, 1] : UB (v) < 0}. By continuity of UB , we have v > 0 and UB (v) ≤ 0. But UB (v) < 0 is impossible in nontrivial equilibrium because it implies χB (v) = 0 ∀v ∈ [0, 1] and hence B = 0. Thus UB (v) = WB (v) = 0. By monotonicity of UB , for all v < v, we have UB (v) < 0 and hence χB (v) = WB (v) = 0. Moreover, qB (v) > 0 for all v ≥ v. It is because for all v ≥ v, the fact UB (v) ≥ 0 implies αB qB (v) ≥ κB > 0. It furthermore implies UB0 (v+) ≥ αB qB (v+) /(r + αB qB (v+)) > 0. Thus for all v > v, we have UB (v) > 0 and hence χB (v) = 1 and WB (v) = UB (v). From steady-state equation (2.6), [v, 1] is the support of NB . Since the inflow distribution F does not have atom point, neither does NB . Hence B > 0 implies v < 1. Finally, the convexity of UB implies that qB is nondecreasing on [v, 1]. We call the v and c̄ in Lemma 1 the buyers’ and sellers’ marginal entering types, and call the traders with such types marginal entrants. Since the flow and stock masses of marginal entrants (who are indiﬀerent between entering or not) are zero anyway, we will without loss of generality assume throughout they enter, i.e. χB (v) = χS (c̄) = 1. Before providing further equilibrium properties, let us make a note on the traders’ bargaining strategies (i.e. proposing and responding strategies) by introducing a pair of important notions. Define ρB (v) ≡ v − WB (v) , (2.10) 17 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining ρS (c) ≡ c + WS (c) . (2.11) We call ρB (v) type v buyers’ dynamic valuation, and ρS (c) type c sellers’ dynamic cost. Both of them are called dynamic types. The reason is that, as far as we are concerned with bargaining between a buyer and a seller in our dynamic model, ρB (v) and ρS (c) play the same roles as v and c do in a static bargaining game. Indeed, as captured in our equilibrium definition, a type v buyer is willing to accept a price oﬀer p if and only if p ≤ ρB (v); and a type c seller is willing to accept a price oﬀer p if and only if p ≥ ρS (c). Thus the dynamic types fully characterize the responding strategies played in equilibrium. Furthermore, the proposing problems in (2.3) and (2.5) are nothing more than static takeit-or-leave-it problems with types replaced by dynamic types. Lemma 1 implies that ρB and ρS are absolutely continuous and increasing: ρ0B (v) = r > 0 a.e. v ∈ [v, 1] r + αB (ζ) qB (v) (2.12) ρ0S (c) = r > 0 a.e. c ∈ [0, c̄] . r + αS (ζ) qS (c) (2.13) Since WB (v) = WS (c̄) = 0, the marginal entering types are equal to the corresponding dynamic types: ρS (c̄) = c̄, ρB (v) = v. Thus the buyers’ lowest and highest reservation prices are v and ρB (1). The sellers’ lowest and highest reservation prices are ρS (0) and c̄. We will see in the next lemma that the proposing strategies pB and pS are also monotonic on the active intervals [v, 1] and [0, c̄]. Thus the lowest and highest price oﬀers by buyers are pB (v) and pB (1). The lowest and highest price oﬀers by sellers are pS (0) and pS (c̄). Lemma 2 In any nontrivial steady-state equilibrium, (a) for all v ∈ [v, 1], ρB (v) > pB (v) ∈ [ρS (0) , c̄]; for all c ∈ [0, c̄], ρS (c) < pS (c) ∈ [v, ρB (1)]; 18 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining (b) the proposing strategies pB (v) and pS (c) are nondecreasing on [v, 1] and [0, c̄] respectively; (c) αB (ζ) β B π B (v) = κB and αS (ζ) β S π S (c̄) = κS . Proof. Step 1: Suppose, by way of contradiction, pB (v) > c̄ for some v ∈ [v, 1]. Then pB (v) is accepted by any active seller (because ρS (c) is increasing in c). A type v buyer can lower his oﬀer without losing acceptance probability. But then pB (v) does not solve the proposing problem in (2.3). Therefore pB (v) ≤ c̄ for all v ∈ [v, 1]. Similarly pS (c) ≥ v for all c ∈ [0, c̄]. Step 2: The buyers with type v cannot get positive bargaining surplus when he is a responder, i.e. the second term inside the square bracket of (2.2), evaluated at v = v, is 0. It is because, from step 1, v − WB (v) = v is no higher than pS (c) proposed by any active seller. Then, since WB (v) = 0 from Lemma 1, the Bellman equation (2.2) evaluated at v = v implies αB (ζ)β B π B (v) − κB = 0. It follows that π B (v) > 0 and hence π B (v) > 0 for all v ∈ [v, 1] (because any buyer can choose p = pB (v) in his proposing problem in (2.3)). Similarly, we can prove αS (ζ) β S π S (c̄) − κS = 0 and π S (c) > 0 for all c ∈ [0, c̄]. Step 3: Fix any v ∈ [v, 1]. From π B (v) > 0 given by step 2, we have v − pB (v) > WB (v) (or equivalently ρB (v) > pB (v)) and pB (v) − c ≥ WS (c) for some c. The last result is equivalent to pB (v) ≥ ρS (0) because ρS (c) is increasing in c. Similarly we can prove for all c ∈ [0, c̄], ρS (c) < pS (c) ≤ ρB (1). R Step 4: Let ΓS (p) ≡ {c:p−c≥WS (c)} dNS (c) . S Obviously ΓS is nondecreasing. Then the buyers’ proposing problem in (2.3) can be written as π B (v) = maxp∈[0,1] [v − WB (v) − p]ΓS (p). Pick any v1 , v2 ∈ [v, 1]. Let p1 ≡ pB (v1 ) and p2 ≡ pB (v2 ). Revealed preference implies [v1 − WB (v1 ) − p1 ]ΓS (p1 ) ≥ [v1 − WB (v1 ) − p2 ]ΓS (p2 ) (2.14) and [v2 − WB (v2 ) − p2 ]ΓS (p2 ) ≥ [v2 − WB (v2 ) − p1 ]ΓS (p1 ) . 19 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Sum these two inequalities and then simplify. We obtain [(v2 − WB (v2 )) − (v1 − WB (v1 ))] · [ΓS (p2 ) − ΓS (p1 )] ≥ 0. Suppose, by way of contradiction, v2 > v1 and p2 < p1 . Then the above inequality implies ΓS (p2 ) ≥ ΓS (p1 ) and the monotonicity of ΓS implies ΓS (p2 ) ≤ ΓS (p1 ). We thus have ΓS (p2 ) = ΓS (p1 ) > 0, where the last inequality is from step 2. Substitute back into (2.14), we have p2 ≥ p1 , a contradiction. The intuition is, in equilibrium, the marginal entrants do not get bargaining surplus in responding stages (the worst types in the market do not have information rent) so that these marginal entrants must earn positive surpluses in proposing stages, otherwise they cannot recover their search costs. Since even the marginal entrants earn positive proposing surplus, all entrants do as well. Then any buyer’s oﬀer must be lower than his dynamic valuation and within the support of sellers’ reservation prices. Of course, a symmetric argument can be made by switching the roles of buyers and sellers. We thus have part (a) of Lemma 2. Part (b), the monotonicity of proposing strategies, is due to standard revealed-preference argument. Part (c), the marginal type equations, simply says that, for the marginal entrants to be indiﬀerent between entering or not, their expected gain from searching in the market, net of search cost, must be zero. (Recall that marginal entrants makes positive bargaining surplus only when they are proposer.) In equilibrium, it could be the case that v ≤ c̄, or v > c̄. If the former one is the case, we say it is an equilibrium with overlapping supports. If the latter one is the case, we say it is an equilibrium with separated supports. Figure 2.1 and Figure 2.2 visualize the pattern of proposing and responding strategies of a possible equilibrium of each kind. Before closing this section, we compare the equilibrium price range with the Walrasian price. Define Walrasian price p∗ as the price that clears the flow demand and flow supply:20 b[1 − F (p∗ )] = sG (p∗ ) . 20 This is the appropriate concept of market-clearing price in the steady-state context, as first pointed out by Gale (1987). 20 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining 1 ρ B (v ) pS (c ) Proposing Responding interval interval pB (v ) ρ S (c ) v 0 c 1 c, v Figure 2.1: Proposing and responding strategies in an equilibrium with overlapping supports (which must be non-full-trade) 1 ρ B (v ) pS (c ) Proposing Responding interval interval pB (v ) ρ S (c ) 0 c v 1 c, v Figure 2.2: Proposing and responding strategies in a non-full-trade equilibrium with separated supports 21 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Also define the responding interval as [ρS (0) , ρB (1)], and the proposing interval as [pB (v), pS (c̄)]. We see from Lemma 2(a) that [pB (v) , pS (c̄)] ⊂ [ρS (0) , ρB (1)]. In words, the proposing interval is contained in the responding interval. Since buyers and sellers always leave the market in pairs, the entry flows must also be balanced in steady state, i.e. b[1 − F (v)] = sG (c̄).21 Then it is clear that the marginal entering types v and c̄ must be on diﬀerent sides of the Walrasian price p∗ . Then from Lemma 2(a), it is not hard to prove that Walrasian price p∗ must fall within the proposing interval [pB (v) , pS (c̄)]. Lemma 3 In any nontrivial steady-state equilibrium, p∗ ∈ [pB (v) , pS (c̄)] ⊂ [ρS (0) , ρB (1)]. Proof. The second inclusion is straight implication of Lemma 2(a). To see the first inclusion, simply notice that pB (v) ≤ min {c̄, v} ≤ p∗ ≤ max {c̄, v} ≤ pS (c̄) . The first and last inequalities are from Lemma 2(a). The other two inequalities in the middle are due to the facts that b[1 − F (v)] = sG (c̄) and b[1 − F (p∗ )] = sG (p∗ ). 2.5 Full-trade equilibria Although the previous section provides a series of results that characterize equilibrium patterns, in general there is no analytic solution for a nontrivial steady-state equilibrium. However, we have more to say about the qualitative properties of equilibria. There are two qualitatively diﬀerent possibilities that could happen in equilibrium. First, it may happen that in an equilibrium every meeting results in a trade. In contrast, it can be that not every meeting results in a trade. We call these two types of equilibria full-trade equilibria and non-full-trade equilibria respectively. 21 It can be formally derived from (2.6) and (2.7). 22 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Definition 2 A nontrivial steady-state equilibrium is called a full-trade equilibrium if in this equilibrium every meeting results in a trade. A nontrivial steady-state equilibrium is called a non-full-trade equilibrium if it is not a full-trade equilibrium. The above definition is sensible for any bargaining mechanism, and for either private information or full information bargaining. In the current context, Lemma 2(a) implies that full-trade equilibria must have the following properties: (i) the supports for active buyers’ types and active sellers’ types are separate, i.e. v > c̄; (ii) the lowest buyers’ oﬀer pB (v) is exactly at the level acceptable to all active sellers, i.e. pB (v) = c̄; and (iii) the highest sellers’ oﬀer pS (c̄) is exactly at the level acceptable to all active buyers, i.e. pS (c̄) = v. It is easy to see that the converse is also true. (Clearly, a full-trade equilibrium must be with separated supports; or equivalently an equilibrium with overlapping supports must be nonfull-trade.) Thus we could alternatively define a full-trade equilibrium to be a nontrivial steady-state equilibrium with pB (v) = c̄ and pS (c̄) = v. Non-full-trade equilibria are illustrated in Figure 2.1 and Figure 2.2 in the previous section. Figure 2.3 illustrates the qualitative features of strategies played in a full-trade equilibrium. In particular, the proposing strategies must be flat and the dynamic type functions must be linear.22 We are interested in full-trade equilibria for several reasons. First, our uniqueness and existence results are closely related to full-trade equilibria. Second, our discussions on bargaining eﬃciency and the eﬀect of information structure on entry in the next chapter will also be intimately related to full-trade equilibria. Third, full-trade equilibria admit a very simple characterization, which we present now.23 In full-trade equilibria (if any), the marginal type equations in Lemma 2(c) take the 22 If a full-trade equilibrium and a non-full-trade equilibrium coexist (whether they can coexist is an open question), our results do not imply the full-trade equilibrium Pareto dominates the non-full-trade one. Indeed, the non-full-trade equilibrium could have more entry (i.e. lower v and higher c̄) than the full-trade one, so that the marginal entrants strictly prefer the non-full-trade equilibrium. 23 As a matter of fact, the analysis of Mortensen and Wright (2002) is based only on full-trade equilibria (although they do not use this term). 23 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining 1 ρ B (v ) pS (c ) pB (v ) ρ S (c ) 0 v c 1 c, v Figure 2.3: Proposing and responding strategies in a full-trade equilibrium form αB (ζ)β B (v − c̄) = κB , (2.15) αS (ζ)β S (v − c̄) = κS . (2.16) Noticing that αS (ζ)/αB (ζ) = ζ, (2.15) and (2.16) can be easily solved for ζ and v − c̄: β B κS ≡ ζ 0, β S κB v − c̄ = K (ζ 0 ) , ζ = (2.17) (2.18) where K (ζ) ≡ κS κB + ∀ζ. αB (ζ) αS (ζ) (2.19) In steady state, the inflow of active buyers must equal the inflow of active sellers: b[1 − F (v)] = sG (c̄) . (2.20) Since v − c̄ is determined from (2.18), v and c̄ are uniquely pinned down by (2.20). It is clear that equations (2.18) and (2.20) have a solution for v < 1 and c̄ > 0 if and only if 24 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining K (ζ 0 ) < 1. Let us suppose K (ζ 0 ) < 1 and denote such a solution for (v, c̄) by (v 0 , c̄0 ). That is to say, a full-trade equilibrium, if exists, must have its buyer-seller ratio and marginal entering types given by (ζ 0 , v 0 , c̄0 ). Other equilibrium objects are also easily obtained. In particular, ⎧ ⎧ ⎨ 1 if v ≥ v ⎨ 1 if c ≤ c̄0 0 , χS (c) = , χB (v) = ⎩ 0 otherwise ⎩ 0 otherwise WB (v) = χB (v) WS (c) = χS (c) αB (ζ 0 ) (v − v0 ) r + αB (ζ 0 ) αS (ζ 0 ) (c̄0 − c) r + αS (ζ 0 ) NB (v) = χB (v) NS (c) = [1 − χS (c)] b [F (v) − F (v0 )] αB (ζ 0 ) sG(c̄0 ) sG(c) + χS (c) αS (ζ 0 ) αS (ζ 0 ) pB (v) = c̄0 ∀v ≥ v 0 pS (c) = v 0 ∀c ≤ c̄0 . Throughout this dissertation, we identify an equilibrium with another one if they diﬀers only in the proposing strategies of non-entrants and entry strategies of marginal entrants. Under this convention, there is at most one full-trade equilibrium. We call the above possible full-trade equilibrium the full-trade equilibrium candidate. We have seen that a unique full-trade equilibrium candidate exists if and only if K (ζ 0 ) < 1.24 The function K (ζ), especially the value K (ζ 0 ), will play an important role in our analysis. It can be interpreted as the expected search costs incurred by a pair of buyer and seller when the buyer-seller ratio is ζ and there is no discounting. In the full-trade equilibrium, this expected search cost, K (ζ 0 ), is equal to the entry gap v 0 − c̄0 , as shown in (2.18). This value K (ζ 0 ) has yet an alternative interpretation. The following simple lemma, which will be used many times in our proofs, shows that K (ζ 0 ) can be interpreted 24 Recall that for expositional simplicity we have assumed that the types are distributed on [0, 1]. If the support is [a1 , a2 ], then the condition would read K (ζ 0 ) < a2 − a1 . 25 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining κB α B (ζ )β B K (ζ 0 ) κS α S (ζ )β S ζ 0 ζ0 Figure 2.4: Interpretation of ζ 0 and K (ζ 0 ) either as a maximin or a minimax value of adjusted accumulated search costs until the next meeting. Lemma 4 For any matching function satisfying Assumption 2, we have ¾ ½ κB κS , K (ζ 0 ) = max min ζ>0 αB (ζ) β B αS (ζ) β S ½ ¾ κB κS = min max , ζ>0 αB (ζ) β B αS (ζ) β S κB κS = = . αB (ζ 0 ) β B αS (ζ 0 ) β S Proof. Consult Figure 2.4. Note that αB (ζ) is a nonincreasing function, while αS (ζ) is a nondecreasing function. The maximin and minimax values are realized at the intersection of the curves κS κB = αB (ζ) β B αS (ζ) β S which occurs if and only if ζ = ζ 0 . Corollary 1 For any matching function satisfying Assumption 2, the following statements are equivalent. (i) K (ζ 0 ) < 1. (ii) For some ζ > 0, we have αB (ζ) β B > κB and 26 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining αS (ζ) β S > κS . (iii) For all ζ > 0, we have αB (ζ) β B > κB or αS (ζ) β S > κS . (iv) αB (ζ 0 ) β B > κB . (v) αS (ζ 0 ) β S > κS .25 Even if K (ζ 0 ) < 1, so that a full-trade equilibrium candidate exists, this candidate may not constitute an equilibrium, since buyers may have an incentive to bid lower than c̄0 , and similarly sellers may have an incentive to bid above v 0 . Nevertheless, Theorem 1, which is the main result of this section, provides a necessary and suﬃcient condition under which such deviations are unprofitable and hence a full-trade equilibrium exists. Before stating this main result, we need to introduce the so-called virtual types of buyers and sellers. The buyers’ and sellers’ virtual type functions are respectively defined as: 1 − F (v) , f (v) G(c) . JS (c) ≡ c + g(c) JB (v) ≡ v − It is well-known that the virtual type functions are nondecreasing for most usual probability distributions. We therefore take the monotonicity of JB and JS as a regularity condition. And this condition guarantees that only the first-order conditions for the proposers’ problems in (2.3) and (2.5) are suﬃcient for optimal proposing. Now we are ready to state the main theorem of this section. Theorem 1 (Existence of full-trade equilibrium) Assume the regularity condition that the virtual type functions JB and JS are nondecreasing. Then a (unique) full-trade equilibrium exists if and only if (i) K (ζ 0 ) < 1 where ζ 0 ≡ β B κS /β S κB , and (ii) r ≤ r∗ where r∗ is given by: ¾ ½ κS /β S κB /β B ∗ , . r ≡ min max {c̄0 − JB (v 0 ) , 0} max {JS (c̄0 ) − v 0 , 0} (2.21) (If both denominators are 0, there is no upper bound so a full-trade equilibrium exists for all r. In this case we define r∗ = ∞.) 25 We will see in Section 2.7 that all these statements are equivalent to the existence of some nontrivial steady-state equilibrium. 27 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Proof. We have already seen that a unique full-trade equilibrium candidate described before exists if and only if K (ζ 0 ) < 1. For proving existence of full-trade equilibrium, it suﬃces to verify that this candidate is really an equilibrium. Almost all equilibrium conditions are satisfied by construction, except that we need to verify pB (v) = c̄0 ∀v ≥ v 0 and pS (c) = v 0 ∀c ≤ c̄0 are buyers’ and sellers’ optimal proposing strategies. For notational simplicity, we omit the subscript "0". We focus on sellers’ proposing problem in (2.5), which, according to our construction of the equilibrium candidate, can be rewritten as maxp∈[0,1] π̂ S (c, p), where µ ¶Z 1 ∙ ¸ dF (v) rc + αS c̄ rv + αB v π̂ S (c, p) = p − I p≤ r + αS r + αB 1 − F (v) v where I [·] is 1 if the condition inside the bracket holds, and is 0 otherwise. Notice that ∂ π̂ S (c, p) /∂p = 1 if p < v, so that any p < v is not optimal; moreover any r+αB v r+αB is also not optimal because it implies π̂ S (c, p) = 0. The partial derivative of i h Bv (it is right-hand derivative at the left boundary; and π̂ S w.r.t. p for any p ∈ v, r+α r+αB p≥ left-hand derivative at the right boundary) is: ³ ´ ³ ´ ⎫ ⎧ (r+αB )p−αB v (r+αB )p−αB v ⎨ f rJ v + α B B r r ∂ π̂ S (c, p) r + αB rc + αS c̄ ⎬ . =− − ⎩ ∂p 1 − F (v) r r + αB r + αS ⎭ For p = v being optimal for all c ≤ c̄, a necessary condition is that ∂ π̂ S (c̄, p) /∂p ≤ 0 at p = v, because otherwise a type c̄ seller would deviate upward. This is also a suﬃcient condition because (i) ∂ π̂ S (c, p) /∂p is increasing in c, so that ∂ π̂ S (c̄, p) /∂p ≤ 0 implies ∂ π̂ S (c, p) /∂p ≤ 0 ∀c ≤ c̄; and (ii) due to the monotonicity of JB , ∂ π̂ S (c, p) /∂p ≤ 0 at i h Bv p = v implies ∂ π̂ S (c, p) /∂p ≤ 0 at any p ∈ v, r+α r+αB . That is, we only need to verify rJB (v) + αB v − c̄ ≥ 0. r + αB Similarly considering the buyers’ proposing problem, we would see that pB (v) = c̄ ∀v ≥ v is optimal if and only if v− rJS (c̄) + αS c̄ ≥ 0. r + αS 28 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Thus full-trade equilibrium exists if and only if both of these two inequalities hold, or equivalently, r ≤ min ½ αS (ζ) (v − c̄) αB (ζ) (v − c̄) , max {c̄ − JB (v) , 0} max {JS (c̄) − v, 0} ¾ . Finally, applying the full-trade equilibrium marginal type equations (2.15) and (2.16), we obtain the upper bound r∗ in (2.21). Corollary 2 Suppose the virtual type functions JB and JS are nondecreasing. Then, (a) In the region where r∗ < ∞, if κB and κS increase, then r∗ increases, and vice versa. (b) Given any r > 0, there is a κ̄ > 0 such that full-trade equilibrium does not exist whenever κB , κS < κ̄. (c) Given any r > 0, a full-trade equilibrium exists when (κB , κS ) is such that K(ζ 0 ) is less than but suﬃciently close to 1. (d) Given any (κB , κS ) such that K(ζ 0 ) < 1, a full-trade equilibrium exists when r is suﬃciently close to 0. Proof. Consult Figure 2.4. The curve κS αS (ζ)β S κB αB (ζ)β B shifts up when κB goes up. The curve shifts up when κS goes up. Both of the two curves pointwise converge to 0 on {ζ : ζ > 0} as (κB , κS ) → 0. Obviously, K (ζ 0 ), as the height of the intersection, increases as κB and κS increase, and vice versa. An increase in K (ζ 0 ) in turn implies that v 0 rises and c̄0 drops, and and vice versa. Also, as (κB , κS ) → 0, we have K (ζ 0 ) → 0, v 0 → p∗ and c̄0 → p∗ . As K (ζ 0 ) → 1 from below, we have v0 → 1 and c̄0 → 0. From monotonicity of JB and JS , c̄0 − JB (v 0 ) and JS (c̄0 ) − v 0 drop as κB and κS increase. Then (a) follows. To prove (b), it suﬃces to prove r∗ → 0 as (κB , κS ) → 0. Notice that c̄0 − JB (v 0 ) ≥ c̄0 − v 0 + (1 − v 0 )f /f¯ and JS (c̄0 ) − v 0 ≥ c̄0 + c̄0 g/ḡ − v 0 . Therefore, as v0 → p∗ and c̄0 → p∗ , lim inf [c̄0 − JB (v0 )] ≥ (1 − p∗ )f /f¯ > 0 and lim inf [JS (c̄0 ) − v 0 ] ≥ p∗ g/ḡ > 0. As a result, r∗ → 0 as (κB , κS ) → 0, and (b) follows. To prove (c), notice that c̄0 − JB (v 0 ) ≤ c̄0 − v 0 + (1 − v 0 )f¯/f and JS (c̄0 ) − v0 ≤ c̄0 + c̄0 ḡ/g − v0 . Thus both of them are negative when v 0 and c̄0 are suﬃciently close to 1 29 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining and 0 respectively. But v0 and c̄0 can be made arbitrarily close to 1 and 0 respectively by letting K(ζ 0 ) be less than but close enough to 1. Hence r∗ = ∞ if K(ζ 0 ) is less than but close to 1. Then (c) follows. (d) is simply from r∗ > 0 for any κB , κS > 0 such that K(ζ 0 ) < 1. Remark 1 We need the monotonicities of virtual type functions JB and JS only in the proof of Theorem 1 and the proof of Corollary 2. Moreover, even if we do not assume these monotonicities, r ≤ r∗ is still a necessary condition for the existence of full-trade equilibrium. 2.6 Uniqueness of equilibrium In this section we will show that a full-trade equilibrium is a unique equilibrium for small r. That is to say, there cannot be a non-full-trade equilibrium when r is small. The proof of this will utilize the following lemma. Lemma 5 In any nontrivial steady-state equilibrium, we have 1 > ρB (1) − ρS (0) > K (ζ 0 ) , (2.22) v − c̄ ≤ K (ζ 0 ) . (2.23) Proof. Pick any nontrivial steady-state equilibrium. Lemma 1 implies WB (1) > 0 and WS (0) > 0. The first inequality in (2.22), which is equivalent to WB (1) + WS (0) > 0, follows. From the definition of π B and Lemma 2(a), we have π B (v) ≤ v − pB (v) < ρB (1) − ρS (0). Then Lemma 2(c) implies αB (ζ) β B (ρB (1) − ρS (0)) > κB . We can similarly prove αS (ζ) β S (ρB (1) − ρS (0)) > κS . 30 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining It follows that ρB (1) − ρS (0) > max ½ κB κS , αB (ζ) β B αS (ζ) β S ¾ ≥ K (ζ 0 ) . The last inequality is from Lemma 4. It proves the second inequality in (2.22). To prove (2.23), notice that π B (v) ≥ v − c̄ because a type v buyer can always propose p = c̄ in his proposing problem (2.3) and this oﬀer would be accepted with probability 1. Thus Lemma 2(c) implies αB (ζ) β B (v − c̄) ≤ κB . Similarly, we have π S (c̄) ≥ v − c̄, so that αS (ζ) β S (v − c̄) ≤ κS . It follows that v − c̄ ≤ min ½ κB κS , αB (ζ) β B αS (ζ) β S The last inequality is again from Lemma 4. ¾ ≤ K (ζ 0 ) . (2.24) Lemma 5 is of interest on its own. Firstly, (2.22) implies an (nontrivial steady-state) equilibrium could exist only if K (ζ 0 ) < 1. Moreover, (2.22) can be written as WB (1) + WS (0) ∈ (0, 1 − K (ζ 0 )). It means in equilibrium the joint lifetime payoﬀ of the best buyerseller pair (i.e. type 1 buyer and type 0 seller) must be positive but smaller than their gains from trade, net of the expected accumulated search costs evaluated at ζ = ζ 0 . Roughly speaking, (2.23) says that in equilibrium the entry gap v − c̄ cannot be too large relative to the search costs, otherwise extramarginal traders would have strict incentives to enter. In order to prove non-full-trade equilibria cannot exist when r is close to 0, recall that a non-full-trade equilibrium could be either with overlapping supports (i.e. v ≤ c̄), or with separated supports (i.e. v > c̄). Now we shall claim neither exists for small r. The following lemma implies that an equilibrium with overlapping supports cannot exist whenever r is lower than the search costs κB and κS . Lemma 6 In any nontrivial steady-state equilibrium, κ−r v − c̄ > ρB (1) − ρS (0) r+κ 31 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining where κ ≡ min {κB , κS }. Proof. Pick any nontrivial steady-state equilibrium. Step 1. Since qB is nondecreasing (from Lemma 1), Z qB (v) ≥ qB (v) ≥ β B {c:pB (v)−c≥WS (c)} dNS (c) S for any v ≥ v. Step 2. From Lemma 2(a) we have v > pB (v) ≥ ρS (0). Step 3. Combining the previous two steps and Lemma 2(c), we obtain αB qB (v) (v − ρS (0)) ≥ κB ∀v ≥ v. From Lemma 1, we have ρ0B (v) = 1 − WB0 (v) = Hence ρB (1) − v = Z v 1 ρ0B (v)dv ≤ r r + αB qB (v) ≤ r . r + κB /(v − ρS (0)) r r < , r + κB /(v − ρS (0)) κB /(v − ρS (0)) ρB (1) − v r < , v − ρS (0) κB ρB (1) − v ρB (1) − ρS (0) = < (ρB (1) − v)/(v − ρS (0)) 1 + (ρB (1) − v)/(v − ρS (0)) r r/κB r = , ≤ 1 + (r/κB ) r + κB r+κ where κ ≡ min{κB , κS }. Step 4. Repeat the previous three steps with the roles of buyers and sellers interchanged, we can also get c̄ − ρS (0) r < . ρB (1) − ρS (0) r+κ Sum these two inequalities up and rearrange terms. Then we get the desired inequality. Corollary 3 If r ≤ κ ≡ min {κB , κS }, then a non-full-trade equilibrium with overlapping supports cannot exist (i.e. any nontrivial steady-state equilibrium has v > c̄). 32 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Now we turn to the proof that a non-full-trade equilibrium with separated supports cannot exist. It is based on the following idea. As r → 0, the dynamic types ρB and ρS , as functions of v and c, get flat, so that the support of dynamic types narrows down to a singleton. Consequently, a marginal entering trader who makes an interior oﬀer in the support of his partner’s dynamic types gains little relative to proposing at the boundary of the support (i.e. seller proposing v and buyer proposing c̄), but risks a substantially reduced probability of trading. We are able to show that bidding the endpoint of the support is the best response, so for small r it must be that pB (v) = c̄ and pS (c̄) = v. This leads to the following uniqueness result. Theorem 2 (Uniqueness of equilibrium) There is at most one nontrivial steady-state equilibrium, which is full-trade, if r ≤ r where r is given by: r ≡κ· K (ζ 0 ) φ , 1 + K (ζ 0 ) φ where © ª min bf , sg ¡ ¢ , φ≡ M B̄, S̄ κ ≡ min {κB , κS } , B̄ ≡ (2.25) b , κB S̄ ≡ s . κS Proof. We have seen in the text that there cannot be more than one full-trade equilibrium. It suﬃces to prove that, if r is small, then in any (non-trivial steady-state) equilibrium, pB (v) = c̄ and pS (c̄) = v. We will only consider r < κ ≡ min{κB , κS }, which through Lemma 3 implies v > c̄ in equilibrium. Now pick any equilibrium and focus on sellers. To prove pS (c̄) = v, it suﬃces to prove that p = v is the only maximizer of maxp∈[0,1] π̂ S (c̄, p), where π̂ S (c̄, p) = (p − c̄) Z v 1 I [p ≤ ρB (v)] dNB (v) B where I [·] is 1 if the condition inside the bracket holds, and is 0 otherwise. Since π̂ S (c̄, p) is absolutely continuous in p, it is diﬀerentiable in p almost everywhere. Notice that ∂ π̂ S (c̄, p) /∂p is 1 if p < v, so that any p < v is never optimal. Proposing 33 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining p > ρB (1), which implies π̂ S (c̄, p) = 0, is also never optimal. If v < p < ρB (1), whenever diﬀerentiable, we have ∂π S (c̄, p) = 1 − ΓB (p) − (p − c̄) γ B (p) , ∂p where ΓB (p) ≡ R1 v (2.26) B (v) I [p ≤ ρB (v)] dNB and γ B (p) ≡ Γ0B (p). Define φB (x) ≡ NB0 (x) /B. The function ρB is strictly increasing (from Lemma 1 and r > 0), so that its inverse function ρ−1 B is well-defined on the range of ρB , and is also strictly increasing. Then ¢ ¡ φB ρ−1 B (p) γ B (p) = 0 ¡ −1 ¢ ∀p ∈ [v, ρB (1)] . ρB ρB (p) We want to show that, when v < p < ρB (1) the r.h.s. of (2.26) must be negative for all suﬃciently small r > 0. Firstly, from r < κ, Lemma 6 and 5, we obtain ¶ µ κ−r > 0. p − c̄ > v − c̄ ≥ K (ζ 0 ) r+κ Moreover, for all v ≥ v, we have ρ0B (v) = r r+αB qB (v) (2.27) (from Lemma 1) and αB qB (v) ≥ κB (from Lemma 2(c)). Thus ρ0B (v) ≤ r/ (r + κ), and hence ³ ¢ ¡ κ´ φB ρ−1 γ B (p) ≥ 1 + (p) . B r (2.28) We now derive a lower bound on the market probability density of buyers’ types φB . From the steady-state equation (2.6), we can deduce φB (v) = bf bf (v) ≥ ∀v ≥ v M (B, S) qB (v) M (B, S) and B= Z v 1 (2.29) bf (v) dv b < ≡ B̄. αB qB (v) κB Similarly (2.7) implies S< s ≡ S̄. κS ¡ ¢ Since M (B, S) is nondecreasing in each of its arguments, M (B, S) ≤ M B̄, S̄ . Substituting this bound into (2.29) we obtain φB (v) ≥ bf ¡ ¢ ≡ φ ∀v ≥ v. B M B̄, S̄ (2.30) 34 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Then apply (2.27), (2.28) and (2.30) to (2.26), and simplify, we find that for almost all p ∈ [v, ρB (1)], ´ ³κ ∂π S (c̄, p) < 1 − K (ζ 0 ) − 1 φB . ∂p r Similarly, we can consider a type v buyer’s proposing problem and find that pB (v) ∈ [ρS (0) , c̄], and for almost all p ∈ [ρS (0) , c̄], we have ´ ³κ ∂π B (v, p) > −1 + K (ζ 0 ) − 1 φS ∂p r where π B (v, p) ≡ (v − p) φS ≡ Therefore, if 1 − K (ζ 0 ) ¡κ r r ≤ r, then we have r < κ, Z 0 c̄ I[p ≥ ρS (c)] dNS (c) , S sg ¡ ¢. M B̄, S̄ ¢ ¡ ¢ − 1 φB ≤ 0 and −1 + K (ζ 0 ) κr − 1 φS ≥ 0, or equivalently ∂π S (c̄,p) ∂p < 0 for almost every p ∈ (v, ρB (1)) and ∂πB (v,p) ∂p > 0 for almost every p ∈ (ρS (0) , c̄). Hence pS (c̄) = v and pB (v) = c̄. The following corollary provides the main properties of our uniqueness bound r and relates it to the other bounds, r∗ and min {κB , κS }, in Theorem 1 and Corollary 3. Corollary 4 We have (a) If κB and κS increase, then r increases, and vice versa; (b) 0 < r < min {κB , κS }; (c) r goes to 0 as κB and κS go to 0; and (d) if K (ζ 0 ) < 1 then r < r∗ . Proof. (a)-(c) are obvious. Our derivation of r (in the proof of Theorem 2) shows that ´ ´ ³ ³ 1 r κ−r 1 r − ≥ 0 and K (ζ ) r ≤ r is equivalent to K (ζ 0 ) κ−r 0 r+κ φ r+κ r+κ − φ r+κ ≥ 0, where B S φB and φS (defined in Theorem 2) are lower bounds of the market probability densities of buyers’ and sellers’ types in any equilibrium. On the other hand, r < r∗ is equivalent to K (ζ 0 ) − 1 r φB0 (v 0 ) r+αB (ζ 0 ) > 0 and K (ζ 0 ) − 1 r φS0 (c̄0 ) r+αS (ζ 0 ) > 0 where φB0 and φS0 are the market probability densities of buyers’ and sellers’ types in the full-trade equilibrium. Then 35 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining it is easy to verify that, given K (ζ 0 ) < 1 (so that αB (ζ 0 ) > κ and αS (ζ 0 ) > κ), r ≤ r implies r < r∗ . In other words, r < r∗ if K (ζ 0 ) < 1. Before closing this section, we give a simple example that visualizes the main results of this and the previous sections. In particular, whether in equilibrium every meeting results in a trade does not hinge on the level of frictions, but rather on the composition of diﬀerent kinds of frictions (discount rate r and explicit costs κB , κS ). More precisely, in the friction space of (r, κB , κS ), any neighborhood of 0, no matter how small, must contain a region (where r is small relative to κB , κS ) in which only full-trade equilibria exist, and also contain another region (where r is large relative to κB , κS ) in which only non-full-trade equilibria exist. Example 1 Buyers and sellers are born at the same rate, i.e. b = s = 1/2. The distributions of buyers’ valuations and sellers’ costs are both uniform [0, 1], i.e. F (v) = v, G(c) = c. (It is easy to check that the monotonicity of the virtual type functions JB and JS is satisfied.) The bargaining power is evenly distributed, i.e. β B = β S = 1/2. The matching function is given by M (B, S) = BS/(B + S).26 One can check that the entry gap and marginal types in a full-trade equilibrium are given by v 0 − c̄0 = K(ζ 0 ) = 2(κB + κS ), 1 + κB + κS 2 1 c̄0 = − κB − κS . 2 v0 = Also, r∗ can be calculated as r∗ = 26 4 min{κB , κS } . max {1 − 6(κB + κS ), 0} Gale (1987) assumes this matching function, although the matching function is not explicitly stated there. In his model each trader in the market is randomly matched for each period with another trader, either a buyer or a seller. So, for a buyer, the probability per period of being matched with a seller is S/(B + S). Similarly a seller is matched with a buyer with probability B/(B + S). With continua of buyers and sellers in the market, the total mass of matches made per period is BS/(B + S). 36 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining r κS r∗ 1 2 κ 1 6 0 r 1 6 κB 1 2 0 1 12 1 4 κ Figure 2.5: Diﬀerent patterns of equilibria in diﬀerent regions of friction space Therefore, a full-trade equilibrium exists for all discount rate r if 1 6 ≤ κB + κS < 12 , shown in the left panel of Figure 2.5. If κB + κS < 16 , full-trade equilibrium may or may not exist, depending on whether r is suﬃciently small. Now let us assume κB = κS = κ, then we have r∗ = 4κ , max {1 − 12κ, 0} r≡ 8κ3 . 1 + 8κ2 The shaded area in the right panel of Figure 2.5 shows the values of r and κ for which a full-trade equilibrium exists. Under the dashed ray κ, a non-full-trade equilibrium with overlapping supports cannot exist. Under the dashed curve r, a unique equilibrium, which is full-trade, exists. 2.7 Necessary and suﬃcient condition for existence In this section we prove that the condition K (ζ 0 ) < 1 alone is a necessary and suﬃcient for the existence of a (full-trade or non-full-trade) nontrivial steady-state equilibrium. 37 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Theorem 3 (General existence) At least one nontrivial steady-state equilibrium exists if and only if K (ζ 0 ) < 1. Taken together with Corollary 2(b), Theorem 3 implies that a non-full-trade equilibrium exists if the search costs are suﬃciently small relative to the discount rate. Corollary 5 (Existence of a non-full-trade equilibrium) Given any r > 0, there is some κ̄ > 0 such that a non-full-trade equilibrium exists whenever κB , κS < κ̄. It is relatively easy to see that the condition K (ζ 0 ) < 1, a necessary condition for the existence of a full-trade equilibrium, is also necessary for the existence of any nontrivial equilibrium of our model. Indeed, it is already proved by (2.22) in Lemma 5. Perhaps surprisingly, the condition K (ζ 0 ) < 1 is also suﬃcient for the existence of a nontrivial equilibrium of our model. It might be natural to guess that a nontrivial equilibrium exists if and only if the expected search cost incurred by a buyer-seller pair (i.e. K(ζ)) is smaller than the maximum gains from trade, which is 1. However, this alone does not give us a meaningful condition for existence. It is because the buyer-seller ratio ζ in equilibrium (if any) is endogenous, and the set {K(ζ) : ζ > 0} is unbounded since limζ→0 K(ζ) = limζ→∞ K(ζ) = ∞. However, Theorem 3 tells us that in order to know whether a friction profile is compatible with a nontrivial market, it suﬃces to check only the expected search costs in the full-trade equilibrium candidate, although the true equilibrium (if any) might be non-full-trade. This result can be informally understood as follows. The market might have to break down because the expected search cost K(ζ) is too high that it does not pay for traders to enter. So a case where K(ζ) is very small is an "inframarginal situation". What matters to the existence condition is the "marginal situation" where K(ζ) is close to 1. If we insert the full-trade equilibrium buyer-seller ratio ζ 0 into K(ζ) and then consider the marginal situation, Corollary 2(c) asserts that a full-trade equilibrium does exist, which in turn validates ζ 0 in the first place. 38 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining The rest of this section is devoted to the main elements of the formal proof of Theorem 3. Additional details are provided in the Appendix. As usual, we want to construct a mapping T such that its fixed point characterizes an (nontrivial steady-state) equilibrium, and prove that T has a fixed point. The mapping T is informally described as follows. Start with a pair of value functions (WB , WS ) and a pair of distribution functions (NB , NS ), we construct best-response proposing strategies (pB , pS ) and entry strategies (χB , χS ). Then from those strategies and the original functions (WB , WS , NB , NS ), we define a new pair of value functions (WB∗ , WS∗ ) through the Bellman equations, and a new pair of distribution functions (NB∗ , NS∗ ) through the steady-state equations. Thus a fixed point of T (i.e. (WB , WS , NB , NS ) = (WB∗ , WS∗ , NB∗ , NS∗ )) characterizes an equilibrium. We will apply the Schauder fixed point theorem: if D is a nonempty compact convex subset of a Banach space and T is a continuous function from D to D, then T has a fixed point. In order to make this theorem applicable, certain diﬃculties need to be overcome. The main diﬃculty is that as we apply the mapping T , we need to preserve positive entry. To deal with this diﬃculty, we first prove existence of what we call an ε-equilibrium, which is an actual equilibrium of the ε-model described below. The ε-model diﬀers from our original model in three ways. First, we add a subsidy that ensures that all buyers with type v ≥ 1 − ε and all sellers with type c ≤ ε enter. Every newborn trader is qualified to receive a flow of subsidy for her market participation, provided that (i) her type satisfies v ≥ 1 − ε or c ≤ ε, and (ii) she would choose not to participate if no subsidy were available. Further, the flow rate of the subsidy for a qualified trader is the least amount suﬃcient to make this trader participate, i.e. the flow subsidies are infimum subsidies to attain WB (v) ≥ 0 and WS (c) ≥ 0 for v ∈ [1 − ε, 1] and c ∈ [0, ε]. Because any subsidized traders are simply indiﬀerent between entering or staying out, the Bellman equations for (WB , WS ) and optimality conditions for (pB , pS ) do not need to be changed. Although we now have a positive lower bound for the inflows of traders, we may not have a positive lower bound for the mass of traders in the market because the outflow rate (i.e. αB (ζ)qB (v) or αS (ζ)qS (c)) could be potentially very large. To overcome 39 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining this diﬃculty, we impose the second modification, which ensures that the arrival rates αB (ζ) and αS (ζ) are bounded from above by some ᾱ. We modify the matching function M (B, S) as min {M (B, S), B ᾱ, S ᾱ}. Notice that this modified one inherits all the properties of a matching function. But under the modified matching function we make sure that αB (ζ), αS (ζ) ≤ ᾱ. While the first two modifications are made to make the mass of traders bounded from below, we also want it to be bounded from above, because our domain D needs to be compact. It suﬃces to have a lower bound for the outflow rate (αB (ζ)qB (v) or αS (ζ)qS (c)). For a type who chooses to enter without subsidy, there is naturally an upper bound for its mass because her expected trading surplus must be larger than her search cost. More precisely, for a participating v-buyer who is not subsidized, αB (ζ)qB (v) ≥ κB . However, a subsidized buyer could have αB (ζ)qB (v) < κB . Our third modification is to disqualify subsidized traders in a way that ensures the outflow rates of subsidized types are at least κB or κS . The disqualification process is a Poisson process, with the rate equal to the minimum that makes the outflow rate at least κB or κS . For example, a currently qualified v-buyer with αB (ζ)qB (v) < κB will be disqualified and exit immediately at a Poisson rate κB − αB (ζ)qB (v); while a currently qualified v-buyer with αB (ζ)qB (v) ≥ κB will not be disqualified. Notice that for any v-buyer, either subsidized or not, the gross outflow rate must be max {αB (ζ)qB (v), κB }. Therefore, in the steady-state equations (2.6) and (2.7) that define NB∗ and NS∗ we now use max {αB (ζ)qB (x), κB } and max {αS (ζ)qS (x), κS } instead of αB (ζ)qB (x) and αS (ζ)qS (x). It completes the descriptions of our ε-model. We will show that our ε-model has at least one equilibrium, which we shall call an εequilibrium (Proposition 1). Next, we will prove that if ε > 0 is suﬃciently small and ᾱ suﬃciently large, then an ε-equilibrium is an equilibrium of our original model (Proposition 1). The main ideas of the proof are illustrated graphically in Figure 2.6. First, as in Lemma 5, we show that in any ε-equilibrium, we must have v − c̄ ≤ K (ζ 0 ). Second, we show that the trading flows are almost balanced, the discrepancy bounded in absolute value by (a multiple of) ε. Imposing these constraints on the set of values 40 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining v v − c = K (ζ 0 ) b[1 − F (v)] − G (c ) = −aε 1 A b[1 − F (v)] − G (c ) = 0 b[1 − F (v)] − G (c ) = aε K (ζ 0 ) where a ≡ max{bf , sg } c B Figure 2.6: Illustration of the idea behind the existence proof (c̄, v), we obtain the set of feasible values given by the shaded area in Figure 2.6. As the graph makes clear, the shaded area collapses to the curvilinear segment AB. Consequently, as ε gets arbitrarily small, the minimum c̄ in the shaded area is arbitrarily close to the horizontal coordinate of point A, and the maximum feasible v is arbitrarily close to the vertical coordinate of A. It follows that for small enough ε > 0, the constraints c̄ ≥ ε and v ≤ 1 − ε become non-binding. In other words, our subsidy policy does not have a bite because no entrant is subsidized. It further implies the marginal entrants must be able to recover their search costs, and hence ζ is bounded away from 0 and ∞. Thus as long as ᾱ are chosen to be large enough, our modification of the matching function does not have a bite. It follows that if ε > 0 is small and ᾱ large, then an ε-equilibrium is an equilibrium of our original model. The following is our formal treatments. We first define an appropriate domain Dε , and then a mapping Tε : Dε → Dε . Definition 3 Fix ᾱ > max {κB , κS } and ε ∈ (0, ε̄], where ½ ¾ f¯ᾱ ḡ ᾱ ε̄ ≡ min 1, , . κB f κS g Let C[0, 1] be the Banach space of real continuous bounded functions defined on [0, 1], en41 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining dowed with the supremum norm. Then we define Dε ⊂ (C[0, 1])4 as the set of all tuples (WB , WS , NB , NS ) such that (i) WB , NB and NS are nondecreasing, while WS is nonincreasing, (ii) WB , WS , NB and NS have Lipschitz constants no greater than ᾱ/ (r + ᾱ), ᾱ/ (r + ᾱ), bf¯/κB and sḡ/κS respectively, and (iii) WB (0) = WS (1) = NB (0) = NS (0) = 0 and NB (1) ≥ εbf /ᾱ, NS (1) ≥ εsg/ᾱ. Lemma 7 Dε is nonempty, convex and compact for any ᾱ > max {κB , κS } and any ε ∈ (0, ε̄]. Proof. In Appendix A. Definition 4 Fix ᾱ > max {κB , κS } and ε ∈ (0, ε̄]. Define a mapping Tε : Dε → Dε as follows. For any (WB , WS , NB , NS ) ∈ Dε , define B ≡ NB (1), S ≡ NS (1), αB ≡ min {M (B, S), B ᾱ, S ᾱ} /B and αS ≡ min {M (B, S), B ᾱ, S ᾱ} /S. Then construct pB , pS , WB∗ , WS∗ , χB , χS , NB∗ , NS∗ by ⎧ ⎪ ⎨ pB (v) ≡ max arg max ⎪ p∈[0,1] ⎩ ⎧ ⎪ ⎨ pS (c) ≡ min arg max ⎪ p∈[0,1] ⎩ Z {c:p−c≥WS (c)} Z {v:v−p≥WB (v)} WB∗ (v) ≡ max χ · { χ∈{0,1} +β S ⎫ ⎪ dNS (c) ⎬ (v − p − WB (v)) S ⎪ ⎭ ⎫ ⎪ dNB (v) ⎬ . (p − c − WS (c)) B ⎪ ⎭ (2.31) (2.32) αB [β π B (v) r + αB B Z dNS (c) ] (v − pS (c) − WB (v)) S {c:v−pS (c)≥WB (v)} κB αB − }+ WB (v) r + αB r + αB WS∗ (c) ≡ max χ · { χ∈{0,1} +β B (2.33) αS [β π S (c) r + αS S Z dNB (v) ] (pB (v) − c − WS (c)) B {v:pB (v)−c≥WS (c)} κS αS − }+ WS (c). r + αS r + αS (2.34) 42 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining χB (v) and χS (c) are defined as the maximizers in (2.33) and (2.34) respectively; wherever multiple maximizers exist, we pick 1. Z v ∗ NB (v) ≡ 0 χ∗B (x) b dF (x) max {αB qB (x) , κB } where χ∗B (v) is 1 if χB (v) = 1 or v ≥ 1 − ε, and is 0 otherwise. Z c χ∗S (x) s ∗ dG (x) NS (c) ≡ 0 max {αS qS (x) , κS } (2.35) (2.36) where χ∗S (c) is 1 if χS (c) = 1 or c ≤ ε, and is 0 otherwise. Now Tε (WB , WS , NB , NS ) is defined by the constructed (WB∗ , WS∗ , NB∗ , NS∗ ). In Appendix A we show that our definition of Tε is legitimate, i.e. it is well-defined and Tε (Dε ) ⊂ Dε . Lemma 8 The mapping Tε : Dε → Dε is continuous for any ᾱ > max {κB , κS } and any ε ∈ (0, ε̄]. Proof. In Appendix A. Lemma 9 Fix any ᾱ > max {κB , κS } and any ε ∈ (0, ε̄]. There exists some E ∈ Dε such that Tε (E) = E. (That is, there exists an ε-equilibrium). Proof. As claimed before, Dε is a nonempty, convex and compact set in a Banach space (C[0, 1])4 and the mapping Tε is continuous. Then we obtain our result by applying the Schauder Fixed Point Theorem (which is stated before). Proposition 1 Suppose K(ζ 0 ) < 1. Then if ε > 0 is small enough and ᾱ large enough, any fixed point of Tε characterizes a nontrivial steady-state equilibrium. (That is, if ε > 0 is small and ᾱ large, any ε-equilibrium is in fact an equilibrium of our original model.) Proof. Suppose E = (WB , WS , NB , NS ) ∈ Dε is a fixed point of Tε . Then E, together with the constructed objects through the transformation from E to Tε (E), constitutes what 43 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining we call an ε-equilibrium. Moreover, an ε-equilibrium satisfies all the equilibrium conditions in Definition 1 if one can verify that (i) v∗ ≡ inf {v : χ∗B (v) = 1} < 1 − ε, and c̄∗ ≡ sup {c : χ∗S (c) = 1} > ε; (ii) αB qB (v) ≥ κB if χ∗B (v) = 1, and αS qS (c) ≥ κS if χ∗S (c) = 1; and (iii) αB , αS < ᾱ. The following steps 1-6 will show that, for any (r, ᾱ) À (0, max {κB , κS }), any ε ∈ (0, ε̄], and any associated fixed point of Tε , a bunch of equilibrium properties hold. Then steps 7 and 8 will show that (i)-(iii) also hold if ε > 0 is small enough and ᾱ large enough. Step 1. E ∈ Dε implies v − WB (v) and c + WS (c) are strictly increasing. Thus, from (2.31) and (2.32), we have pB (v) ≤ c̄∗ + WS (c̄∗ ) and pS (c) ≥ v ∗ − WB (v∗ ). Step 2. The expression inside the curly bracket in (2.33) can be written as ∙ ¸ Z αB dNS (c) κB − β B π B (v) + β S max {v − pS (c) − WB (v) , 0} , r + αB S αB (2.37) which is continuous in v. Then by definition of v∗ , χ = 0 is a maximizer in (2.31) when v = v ∗ . In other words, (2.37) is non-positive when v = v ∗ . Now evaluate (2.33) at v = v∗ . From the above result and that WB∗ = WB , we have WB (v ∗ ) = αB r+αB WB (v∗ ), or WB (v ∗ ) = 0. κB αB Step 3. The fact that (2.37) is non-positive when v = v∗ can be simplified as β B π B (v ∗ ) ≤ because v ∗ − WB (v ∗ ) = v ∗ is no greater than pS (c), due to step 1. The logic in this and the previous step can be applied to the sellers’ side. Thus we also have WS (c̄∗ ) = 0 and β S π S (c̄∗ ) ≤ κS αS . Step 4. Notice that π B (v ∗ ) ≥ v ∗ − c̄∗ since the choice variable p in the definition (2.3) of π B can be taken as c̄∗ . Similarly π S (c̄∗ ) ≥ v ∗ − c̄∗ . Then step 3 implies ¾ ½ κB κS ∗ ∗ ≤ K (ζ 0 ) . , v − c̄ ≤ min αB β B αS β S (2.38) Step 5. The expression inside the curly bracket in (2.33), which can be written as (2.37), is increasing in v. Hence χB and χ∗B are increasing. Therefore, if v ≥ v ≡ inf {v : χB (v) = 1}, then (2.37) is non-negative, which implies αB qB (v) ≥ κB . Similarly, χS and χ∗S are decreasing, and for any c ≤ c̄ ≡ sup {c : χS (c) = 1}, we have αS qS (c) ≥ κS . 44 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining Step 6. Equation (2.35), NB∗ = NB , and step 5 imply Z 1 Z 1 αB qB (v) dNB (v) = max {0, κB − αB qB (v)} dNB (v) . b [1 − F (v ∗ )] − v∗ (2.39) v∗ ¯ To The r.h.s. of (2.39) is clearly non-negative. Moreover, it is also no greater than bfε. see this, consider two (exhaustive) cases: v ∗ = v and v∗ < v. First consider the case that v ∗ = v. From step 5 the r.h.s. of (2.39) is 0. Then consider the case that v ∗ < v. Due to the definition of v ∗ and v, we have v∗ = 1 − ε. The r.h.s. of (2.39) is no greater than bf¯ε because dNB (v) ≤ bf¯ κB . Similar logic can be applied to the sellers’ side. Therefore we obtain ∗ 0 ≤ b [1 − F (v )] − ∗ 0 ≤ sG (c̄ ) − Z 0 Z 1 v∗ ¯ αB qB (v) dNB (v) ≤ bfε c̄∗ αS qS (c) dNS (c) ≤ sḡε. On the other hand, by definition of αB , qB , αS , qS , we have Z c̄∗ Z 1 αB qB (v)dNB (v) = αS qS (c)dNS (c). v∗ 0 Therefore, © ª |b[1 − F (v ∗ )] − sG(c̄∗ )| ≤ max bf¯, sḡ · ε. (2.40) Step 7. The previous six steps work with a particular fixed point of Tε given (ε, ᾱ). In this and the next step, we let (ε, ᾱ) → (0, ∞) and consider an associated sequence of fixed points. Along any subsequence, c̄∗ cannot approach to 0 because otherwise (2.40) implies v∗ → 1 and hence v∗ − c̄∗ → 1, violating (2.38) and K(ζ 0 ) < 1. Similarly, v ∗ cannot approach to 1 along any subsequence. Therefore, in the tail of the sequence, we have c̄∗ > ε and v∗ < 1 − ε, i.e. (i) holds. Notice that (i) implies v∗ = v and c̄∗ = c̄. Thus step 5 implies (ii) also holds in the tail. Step 8. From steps 5 and 7, we have αB (ζ) ≥ κB and αS (ζ) ≥ κS in the tail as (ε, ᾱ) → (0, ∞). Thus ζ ≡ B/S is bounded away from 0 and ∞. It follows that, in the tail, αB < ᾱ and αS < ᾱ, i.e. (iii) holds. Proof of Theorem 3. The necessity of the condition K (ζ 0 ) < 1 has been proved by (2.22) in Lemma 5. The suﬃciency is implied by Lemma 9 and Proposition 1. 45 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining 2.8 Concluding remarks We have analyzed a steady-state search-theoretic model with two-sided private information bargaining. Although the model is not complicated, analyzing the equilibrium is a highly nontrivial job. It is because traders’ best-response bargaining behaviors in general depend on the buyers’ and sellers’ distributions in a nontrivial manner. And these distributions in turn depend on the traders’ bargaining behaviors through steady-state equations. Moreover the existence of equilibrium is also elusive. It is because a trivial no-entry equilibrium always exists, so that we cannot solely apply a fixed-point argument to prove existence of some nontrivial equilibrium. In spite of these diﬃculties, we are able to provide quite a few results. We have provided a necessary and suﬃcient condition K (ζ 0 ) < 1 under which some nontrivial steady-state equilibrium exists. Not surprisingly, in equilibrium the market must breakdown (i.e. nobody enters) if search costs are too large. Besides, the qualitative pattern of equilibrium (whether every meeting results in a trade) mainly depends not on the level of frictions, but the relativity of the two kinds of frictions (time discounting and explicit search costs). This result can only be obtained in a model with the coexistence of two kinds of frictions. Before closing this chapter, we make a few remarks on the existence condition K (ζ 0 ) < 1. First, although the trivial no-entry equilibrium always exists because of the coordination problem, it is appealing to assume that the trivial equilibrium will not be selected as long as a nontrivial one exists. After all, every nontrivial equilibrium Pareto dominates the trivial one. With this assumption, we predict that the market will open if and only if K (ζ 0 ) < 1. Second, the discount rate r does not enter into the condition K (ζ 0 ) < 1. One way to understand it is that in steady state, when a trader is going to decide whether to enter or not, he just need to compare the expected gain from search for a period of very short length dt and the corresponding search costs incurred for the same period. Since this dt can be arbitrarily small, the discount rate has to be irrelevant for this entry decision. Third, the condition K (ζ 0 ) < 1 depends on the distribution of bargaining power between 46 Chapter 2. Dynamic Matching and Two-sided Private Information Bargaining buyers and sellers. In particular, if the relative bargaining power of sellers β S is close to 0 or 1, the market must breakdown. The intuition is that if β S is close to zero, sellers do not have enough incentive to participate. If β S is close to one, buyers do not have enough incentive to participate. The openness of the market requires some balance between the interests of the two sides. 47 Chapter 3 Role of Information Structure in Dynamic Matching Markets 3.1 Introduction This chapter studies how the information structure at the bargaining stages aﬀects the equilibrium outcome of a dynamic matching market.27 We analyze and compare two searchtheoretic dynamic matching and bargaining games. They are called the private information model and the full information model. The former is the one we have seen in Chapter 2; the latter is the one in Mortensen and Wright (2002). In both models, searching for a trading partner takes time and other resources (e.g. money, eﬀort). Thus there are two kinds of search frictions, one parameterized by a discount rate and one parameterized by explicit search costs. The two models are identical except for only one aspect: in the private information model, when a buyer and a seller meet each other they bargain without knowing each other’s characteristics; while in the full information model they observe each other’s characteristics once they meet. We show that the private information and full information models have some similarities. They have the same necessary and suﬃcient condition for the existence of a nontrivial steady-state equilibrium (Theorem 4); or putting it another way, information structure has no impact on whether the market would open or breakdown. Moreover, in both models, whether there exists a full-trade equilibrium (i.e. in which every meeting results in a trade) 27 The chapter includes materials in my manuscript "Bilateral Matching and Bargaining with Private Information", which is joint with my thesis co-supervisor Artyom Shneyerov. 48 Chapter 3. Role of Information Structure in Dynamic Matching Markets mainly depends on the relative magnitudes of the two kinds of frictions (Corollary 2 and Corollary 6). Furthermore, the two models become completely identical if the discount rate is zero (Proposition 2); or in other words, information structure has no impact if agents are perfectly patient. Information structure also makes qualitative diﬀerences. Due to private information the bargaining between a buyer and a seller might breakdown even when the gain from trade is larger than the total value of their outside options. We show that whether this bargaining ineﬃciency occurs in equilibrium again depends on the relative magnitudes of the two kinds of frictions (Proposition 3). Besides, private information has an entry-deterring eﬀect, so that typically less potential traders enter in the private information model (Proposition 4). Why this is so can be understood through the following logic. Suppose we start with a nontrivial steady-state equilibrium under full information. In this equilibrium there are marginal entrants: the lowest-value active buyers and the highest-cost active sellers. They are indiﬀerent between entering or not. Now let us think about how the entry incentives of the marginal entrants would change if we make the bargaining to be under private information. Recall that the bargaining protocol in our market is the so-called random-proposer protocol. Notice the followings: First, when being a responder, a buyer with the lowest value in the market (or a seller with the highest cost in the market) would never receive an oﬀer that makes him better oﬀ on top of his outside option. This is true no matter information is full or private. Second, when being a proposer, not knowing the responder’s type would make a marginal entrant lose some information rent. Summing up these two concerns, the marginal entrants would expect less participating gains on average, if information is switched to be private. They, originally indiﬀerent between entering or not, would become non-participants. Hence less potential traders enter in the private information model. Because entry decisions have externalities through the matching process, this entrydeterring eﬀect could either improve or deteriorate the aggregate social welfare. We also provide and interpret suﬃcient conditions under which this entry eﬀect improves or deteri- 49 Chapter 3. Role of Information Structure in Dynamic Matching Markets orates social welfare (Theorem 6). The rest of this chapter is organized as follows. Section 3.2 reviews the private information model. Section 3.3 presents the full information model, and the associated results. Section 3.4 solves the no-discounting case for both models. Section 3.5 analyzes the concept of bargaining eﬃciency and its relation with full-trade equilibria. Section 3.6 studies how the information structure aﬀects social welfare through its impact on entry decisions. Section 3.7 concludes. Appendix B contains the calculations for Section 3.6. 3.2 Private information model Our model of dynamic matching market with private information bargaining, or private information model for short, is the one we use in Chapter 2. To make this chapter somehow self-contained and at the same time avoid too much repetition, let us for now only briefly review the model, recall the notations, write down the equations that define our equilibrium concept, and present our central results in Chapter 2. This is a continuous time, steady state model of a decentralized market with continua of risk-neutral traders (buyers and sellers). Diﬀerent buyers (with unit demand) have diﬀerent valuations v ∈ [0, 1] for an indivisible good, and diﬀerent sellers (with unit supply) have diﬀerent costs c ∈ [0, 1] for the good. Traders in the market are randomly matched pairwise at the aggregate flow rate M (B, S), which depends on the mass of buyers B and the mass of sellers S currently in the market. Once a buyer and a seller meet, they bargain following the random-proposer protocol: with probability β B ∈ (0, 1) the buyer makes a take-it-or-leaveit oﬀer to the seller, and with probability β S ≡ 1 − β B the seller makes a take-it-or-leave-it oﬀer. The traders leave once they successfully trade. New potential buyers are born at the rate b and sellers at the rate s. We normalize the aggregate born rate to be 1, i.e. b + s = 1. Once a potential buyer (seller) is born, his valuation (cost) is drawn i.i.d. from the c.d.f. F (v) (G(c)). The market is continuously replenished with new-born buyers and sellers who voluntarily choose to enter. We study the steady-state perfect Bayesian equilibria with positive entry, so called nontrivial steady-state equilibria. There are (except the asymmetric 50 Chapter 3. Role of Information Structure in Dynamic Matching Markets information) two kinds of frictions: time discounting at rate r > 0 and explicit search costs at rates κB > 0 for buyers and κS > 0 for sellers. The matching function M exhibits constant returns to scale. (For other assumptions we make on the functions F , G and M , see Assumptions 1 and 2 in Section 2.2.) Definition 5 Under the private information model, a nontrivial steady-state equilibrium is a pair of value functions WB , WS : [0, 1] → R+ , a pair of entry strategies χB , χS : [0, 1] → {0, 1}, a pair of proposing strategies pB , pS : [0, 1] → [0, 1], and a pair of distribution functions NB , NS : [0, 1] → R+ such that B ≡ NB (1) > 0, S ≡ NS (1) > 0, rWB (v) = max χ · {αB (ζ)[β B π B (v) Z dNS (c) ] − κB } (v − pS (c) − WB (v)) +β S S (3.1) max χ · {αS (ζ)[β S π S (c) + Z dNB (v) ] − κS } (pB (v) − c − WS (c)) βB B (3.2) χ∈{0,1} {c:v−pS (c)≥WB (v)} rWS (c) = χ∈{0,1} {v:pB (v)−c≥WS (c)} bχB (v) dF (v) = αB (ζ)qB (v) dNB (v) (3.3) sχS (c) dG(c) = αS (ζ)qS (c) dNS (c) (3.4) ζ ≡ B/S, αB (ζ) ≡ M (1, 1/ζ), αS (ζ) ≡ M (ζ, 1), ⎫ ⎧ ⎪ ⎪ Z ⎨ dNS (c) ⎬ (v − p − WB (v)) π B (v) ≡ max S ⎪ p∈[0,1] ⎪ ⎭ ⎩ (3.5) π S (c) ≡ max (3.6) where qB (v) ≡ β B ⎧ ⎪ ⎨ {c:p−c≥WS (c)} Z p∈[0,1] ⎪ ⎩ {v:v−p≥WB (v)} Z {c:pB (v)−c≥WS (c)} ⎫ ⎪ dNB (v) ⎬ (p − c − WS (c)) B ⎪ ⎭ dNS (c) + βS S Z dNS (c) S {c:v−pS (c)≥WB (v)} 51 Chapter 3. Role of Information Structure in Dynamic Matching Markets qS (c) ≡ β S Z dNB (v) + βB B {v:v−pS (c)≥WB (v)} Z dNB (v) , B {v:pB (v)−c≥WS (c)} and χB , χS , pB , pS solve the optimization problems in (3.1), (3.2) (3.5), and (3.6) respectively. The equilibrium objects have the following interpretations: • WB (v), WS (c): buyers’ and sellers’ continuation payoﬀs when unmatched, • χB (v), χS (c): buyers’ and sellers’ entry strategies (1 represents "enter" and 0 represents "not enter"), • pB (v), pS (c): buyers’ and sellers’ proposing strategies, i.e. what trading prices they propose, • NB (v), NS (c): buyers’ and sellers’ steady-state distributions of types in the market, • B, S: buyers’ and sellers’ steady-state masses in the market, • ζ: steady-state buyer-seller ratio (or market tightness), • αB (ζ) , αS (ζ): buyers’ and sellers’ Poisson arrival rates of being matched, • π B (v) , π S (c): buyer’s and sellers’ capital gains when they become a proposer, and • qB (v) , qS (c): buyer’s and sellers’ trading probabilities in a given meeting. Equations (3.1) and (3.2) are buyers’ and sellers’ Bellman equations. Equations (3.3) and (3.4) are the steady-state equations: the inflow rate of the traders of each type is equal to the outflow rate due to trading. The buyer’s and sellers’ responding strategies are also captured in the above equilibrium definition: A type v buyer accepts a price oﬀer p if and only if p ≤ v − WB (v); a type c seller accepts a price oﬀer p if and only if p ≥ c + WS (c). Thus buyers’ and sellers’ reservation prices, also called dynamic types, are given by ρB (v) ≡ v − WB (v) , (3.7) 52 Chapter 3. Role of Information Structure in Dynamic Matching Markets ρS (c) ≡ c + WS (c) . (3.8) In general there is no analytic solution for the system of equations (3.1) through (3.4). However, we know from Theorem 3 (in Chapter 2) that our private information model has at least one nontrivial steady-state equilibrium if and only if K (ζ 0 ) < 1 where ζ0 ≡ K (ζ) ≡ β B κS , β S κB κS κB + ∀ζ. αB (ζ) αS (ζ) (3.9) (3.10) By Theorem 2 and Corollary 4, if the discount rate r is small relative to the search costs κB and κS , then the (nontrivial steady-state) equilibrium is unique and has the property that every meeting results in a trade. We call this kind of equilibria full-trade equilibria. By Theorem 1 and Corollary 2 (see also Remark 1), if the discount rate is large relative to the search costs, then in equilibrium some meetings do not result in a trade. We call this kind of equilibria non-full-trade equilibria. In particular, whether there exists a nontrivial equilibrium depends on the search costs (κB , κS ) (but not on the discount rate r) and the distribution of bargaining power (β B , β S ). Whether in equilibrium every meeting results in a trade depends on the relative magnitudes of r and (κB , κS ). 3.3 3.3.1 Full information (Mortensen-Wright) model Model Our model of dynamic matching market with full information bargaining, or full information model for short, is the one in Mortensen and Wright (2002). Mortensen and Wright (2002) consider a model that diﬀers from our private information model only in one respect: they assume full information bargaining, i.e. bargainers know each other’s type once they meet. Consequently, proposers hold their partners to their reservation values (i.e., to their dynamic types), and the proposing strategies depend on both the proposer’s and the responder’s type. In other words, for a meeting between a type v buyer and a type c seller, if the 53 Chapter 3. Role of Information Structure in Dynamic Matching Markets buyer proposes, he will propose the oﬀer pB (v, c) = ρS (c) if v − ρS (c) ≥ WB (v), while the oﬀer can be defined as any price less than ρS (c) if v − ρS (c) < WB (v) (such a price will be rejected by the seller). Similarly, if the seller proposes, she will propose the oﬀer pS (v, c) = ρB (v) if ρB (v) − c ≥ WS (c). In the context of full information bargaining, the random-proposer protocol is equivalent to the generalized Nash bargaining solution. To see this, notice that under random-proposer protocol, a meeting between a type v buyer and a type c seller results in a trade if and only if ρS (c) ≤ ρB (v). And conditional on trade, the expected trading price p(v, c) is the weighted average of the seller’s oﬀer ρB (v) and the buyer’s oﬀer ρS (c): p(v, c) = β S ρB (v) + β B ρS (c). (3.11) Now consider the generalized Nash bargaining with the buyer’s relative bargaining power being β B ∈ (0, 1), and the seller’s relative bargaining power being β S ≡ 1 − β B . The joint matching surplus to be shared is v − c − WB (v) − WS (c) and the threat points of the buyer and the seller is WB (v) and WS (c) respectively. Therefore, a trade occurs if and only if v − c − WB (v) − WS (c) ≥ 0 or equivalently ρS (c) ≤ ρB (v). Conditional on that, the trading price p(v, c) is determined by p(v, c) ∈ arg max [v − p − WB (v)]β B [p − c − WS (c)]β S , p for which the solution is exactly (3.11). Thus, no matter we use random-proposer protocol or generalized Nash bargaining, the buyer’s and seller’s capital gains from the meeting are given respectively by v − p (v, c) − WB (v) = β B · (ρB (v) − ρS (c)) , p (v, c) − c − WS (c) = β S · (ρB (v) − ρS (c)) . In this regard, the random-proposer bargaining is an extension of Nash bargaining into the environment of private information. 54 Chapter 3. Role of Information Structure in Dynamic Matching Markets Here we define nontrivial steady-state equilibria for the full information model in a way parallel to Definition 5. Definition 6 Under the full information model, a nontrivial steady-state equilibrium is a pair of value functions WB , WS : [0, 1] → R+ , a pair of entry strategies χB , χS : [0, 1] → {0, 1}, and a pair of distribution functions NB , NS : [0, 1] → R+ such that B ≡ NB (1) > 0, S ≡ NS (1) > 0, rWB (v) = max χ · {αB (ζ)β B χ∈{0,1} Z (ρB (v) − ρS (c)) dNS (c) − κB } S (3.12) Z (ρB (v) − ρS (c)) dNB (v) − κS } B (3.13) {c:ρB (v)≥ρS (c)} rWS (c) = max χ · {αS (ζ)β S χ∈{0,1} {v:ρB (v)≥ρS (c)} bχB (v) dF (v) = αB (ζ)qB (v) dNB (v) sχS (c) dG(c) = αS (ζ)qS (c) dNS (c) where ζ ≡ B/S, αB (ζ) ≡ M (1, 1/ζ), αS (ζ) ≡ M (ζ, 1), ρB (v) ≡ v − WB (v) ρS (c) ≡ c + WS (c) Z dNS (c) qB (v) ≡ S (3.14) {c:ρB (v)≥ρS (c)} qS (c) ≡ Z dNB (v) B (3.15) {v:ρB (v)≥ρS (c)} and χB , χS solve the optimization problems in (3.12) and (3.13) respectively. The interpretations for the equilibrium conditions and equilibrium objects in Definition 6 are the same as in the previous section. 55 Chapter 3. Role of Information Structure in Dynamic Matching Markets 3.3.2 Basic equilibrium properties The analysis of Mortensen and Wright (2002) is based only on full-trade equilibria (although they do not use this term). That would not be enough for the purposes of this and the next Chapter. Now let us provide some lemmas for nontrivial steady-state equilibria in general. Our methodology here is similar to the one in Section 2.4. Lemma 10 Under full information, in any nontrivial steady-state equilibrium, there are marginal entering types v, c̄ ∈ (0, 1) such that the supports of NB and NS are [v, 1] and [0, c̄] respectively. Marginal entrants (i.e. type v buyers and type c̄ sellers) are indiﬀerent between entering or not, while the entry preferences of all others are strict. {v : χB (v) = 1} is either [v, 1] or (v, 1]. {c : χS (c) = 1} is either [0, c̄] or [0, c̄). WB is absolutely continuous, convex, nondecreasing on [0, 1], strictly increasing on [v, 1], with WB (v) = 0; whenever diﬀerentiable, WB0 (v) = χB (v) αB (ζ) β B qB (v) . r + αB (ζ) β B qB (v) (3.16) WS is absolutely continuous, convex, nonincreasing on [0, 1], strictly decreasing on [0, c̄], with WS (c̄) = 0; whenever diﬀerentiable, WS0 (c) = −χS (c) αS (ζ) β S qS (c) . r + αS (ζ) β S qS (c) (3.17) The trading probability qB is strictly positive and nondecreasing on [v, 1], while qS is strictly positive and nonincreasing on [0, c̄]. Proof. We prove the results for buyers only. We use an argument parallel to that for Lemma 1. For any v, v̂ ∈ [0, 1], define ΠB (v, v̂) ≡ Z (v − ρS (c)) dNS (c) . S {c:ρB (v̂)≥ρS (c)} The buyers’ Bellman equation (3.12) implies for any v, v̂ ∈ [0, 1] and any χ ∈ {0, 1}, rWB (v) ≥ χ · {αB β B [ΠB (v, v̂) − qB (v̂) WB (v)] − κB } 56 Chapter 3. Role of Information Structure in Dynamic Matching Markets or equivalently WB (v) ≥ χ · uB (v, v̂) where uB (v, v̂) ≡ αB β B ΠB (v, v̂) − κB . r + αB β B qB (v̂) And the inequality becomes equality if v̂ = v and χ = χB (v). Let UB (v) ≡ maxv̂∈[0,1] uB (v, v̂). We then have WB (v) = χB (v) uB (v, v) = χB (v) UB (v) = max {UB (v) , 0}. For any v̂, uB (v, v̂) is aﬃne and nondecreasing in v. Milgrom and Segal (2002) Envelope Theorem implies UB (v) is absolutely continuous, convex, nondecreasing, and with slope αB β B qB (v) /(r+ αB β B qB (v)) whenever diﬀerentiable. The same properties are inherited by WB (v), except that its slope becomes χB (v) αB β B qB (v) /(r + αB β B qB (v)). Obviously UB (0) < 0. Let v ≡ sup {v ∈ [0, 1] : UB (v) < 0}. By continuity of UB , we have v > 0 and UB (v) ≤ 0. But UB (v) < 0 is impossible in nontrivial equilibrium because it implies χB (v) = 0 ∀v ∈ [0, 1] and hence B = 0. Thus UB (v) = WB (v) = 0. By monotonicity of UB , for all v < v, we have UB (v) < 0 and hence χB (v) = WB (v) = 0. Moreover, qB (v) > 0 for all v ≥ v. It is because qB (v) ≥ ΠB (v, v), and for all v ≥ v, the fact UB (v) ≥ 0 implies αB β B ΠB (v, v) ≥ κB > 0. It furthermore implies UB0 (v+) ≥ αB β B qB (v+) /(r + αB β B qB (v+)) > 0. Thus for all v > v, we have UB (v) > 0 and hence χB (v) = 1 and WB (v) = UB (v). From the buyers’ steady-state equation, [v, 1] is the support of NB . Since the inflow distribution F does not have atom point, neither does NB . Hence B > 0 implies v < 1. Finally, the convexity of UB implies that qB is nondecreasing on [v, 1]. The thresholds v and c̄ in Lemma 10 are called marginal entering types. Those buyers with type v and those sellers with type c̄ are called marginal entrants. Since the flow and stock masses of marginal entrants (who are indiﬀerent between entering or not) is zero anyway, we will without loss of generality assume throughout they enter, i.e. χB (v) = χS (c̄) = 1. Comparing Lemma 10 above with Lemma 1 in Chapter 2, we see that they looks almost the same, except that the trading probabilities qB and qS in Lemma 1 are replaced by β B qB 57 Chapter 3. Role of Information Structure in Dynamic Matching Markets and β S qS respectively in Lemma 10. To see the intuition, recall that under full information bargaining a buyer can gain from a meeting (on top of his outside option) only when he proposes, the probability of which is β B . In other words, he will be indiﬀerent between accepting or rejecting an oﬀer whenever he is a responder. Therefore, keeping αB and qB unchanged, we can evaluate the buyer’s lifetime payoﬀ WB as if he will reject any oﬀer. If so, his counterfactual trading probability becomes β B qB instead of qB . A similar logic applies to sellers. As a direct implication, keeping αB and qB unchanged, private information bargaining makes the slopes of lifetime payoﬀs WB (v) and WS (c) steeper. It should not be surprising because it is well-known that information rents are monotone in types. As another direct implication, again keeping αB and qB unchanged, the slopes of dynamic types ρB (v) and ρS (c) become flatter: ρ0B (v) = r > 0 a.e. v ∈ [v, 1] r + αB (ζ) β B qB (v) (3.18) ρ0S (c) = r > 0 a.e. c ∈ [0, c̄] . r + αS (ζ) β S qS (v) (3.19) The following lemma provides the indiﬀerence conditions for the marginal entrants. Lemma 11 Under full information, in any nontrivial steady-state equilibrium, ρB (v) = v and ρS (c̄) = c̄. Moreover, αB (ζ) β B αS (ζ) β S Z Z dNS (c) = κB S (3.20) dNB (v) = κS . B (3.21) max{v − ρS (c), 0} max{ρB (v) − c̄, 0} Proof. From Lemma 10 we have WB (v) = WS (c̄) = 0, hence ρB (v) = v and ρS (c̄) = c̄. Evaluate (3.12) and (3.13) at v = v and c = c̄, we get the results. Since the buyers’ and sellers’ reservation prices ρB and ρS (also called dynamic types) are increasing, the buyers’ lowest and highest reservation prices are v and ρB (1). The sellers’ lowest and highest reservation prices are ρS (0) and c̄. 58 Chapter 3. Role of Information Structure in Dynamic Matching Markets The following lemma shows that ρS (0) < v, otherwise type v buyers prefer not to enter as they cannot recover the search costs. Similarly c̄ < ρB (1), otherwise type c̄ sellers prefer not to enter as they cannot recover the search costs. Lemma 12 Under full information, in any nontrivial steady-state equilibrium, ρS (0) < v and c̄ < ρB (1). Proof. We prove ρS (0) < v first. Suppose v ≤ ρS (0). Then the left-hand side of (3.20) is 0, while the right-hand side is strictly positive, a contradiction. To prove c̄ < ρB (1), simply apply (3.21) instead of (3.20). As in Chapter 2, define the Walrasian price p∗ as the price that clears the flow demand and flow supply: b [1 − F (p∗ )] = sG(p∗ ). Since buyers and sellers always leave the market in pairs, the entry flows of buyers and sellers must be balanced in steady state, i.e. b [1 − F (v)] = sG(c̄).28 Therefore the marginal entering types v and c̄ must lie on diﬀerent sides of the Walrasian price p∗ . Although both v ≤ p∗ ≤ c̄ and c̄ < p∗ < v are possible, the comparisons between ρB (1), ρS (0) and p∗ are, as under private information, unambiguous. Lemma 13 Under full information, in any nontrivial steady-state equilibrium, ρS (0) < p∗ < ρB (1). Proof. We prove ρS (0) < p∗ only. The other part is completely parallel. Suppose ρS (0) ≥ p∗ . Then clearly c̄ ≥ p∗ . Moreover, from Lemma 12 we have v > ρS (0) ≥ p∗ . But then b [1 − F (v)] < b [1 − F (p∗ )] = sG(p∗ ) ≤ sG(c̄), a contradiction. The following lemma is parallel to Lemma 5 in Chapter 2. 28 It can be formally derived from steady-state equations (3.3) and (3.4). 59 Chapter 3. Role of Information Structure in Dynamic Matching Markets Lemma 14 Under full information, in any nontrivial steady-state equilibrium, we have 1 > ρB (1) − ρS (0) > K (ζ 0 ) , (3.22) v − c̄ < K (ζ 0 ) . (3.23) Proof. Pick any nontrivial steady-state equilibrium. Lemma 10 implies WB (1) > 0 and WS (0) > 0. The first inequality in (3.22), which is equivalent to WB (1) + WS (0) > 0, follows. Condition (3.20) implies αB (ζ) β B (ρB (1) − ρS (0)) > κB , because (i) ρB (1) > v and (ii) ρS (c) > ρS (0) for any c on [0, c̄] (which is the support of NS ). Similarly (3.21) implies αS (ζ) β S (ρB (1) − ρS (0)) > κS , so that ρB (1) − ρS (0) > max ½ κB κS , αB (ζ) β B αS (ζ) β S ¾ ≥ K (ζ 0 ) . The last inequality is from Lemma 4 in Chapter 2. This proves (3.22). We turn to prove (3.23). Notice that (3.20) implies αB (ζ) β B max {v − c̄, 0} < κB , because ρS (c) < c̄ for any c on [0, c̄). Similarly, (3.21) implies αS (ζ) β S max {v − c̄, 0} < κS , from which it follows that max {v − c̄, 0} < min ½ κB κS , αB (ζ) β B αS (ζ) β S ¾ ≤ K (ζ 0 ) . (3.24) The last inequality is again from Lemma 4 in Chapter 2. This proves (3.23). 60 Chapter 3. Role of Information Structure in Dynamic Matching Markets 3.3.3 Necessary and suﬃcient condition for existence Mortensen and Wright (2002) do not provide a necessary and suﬃcient condition under which a nontrivial steady-state equilibrium exists. We can fill this gap by applying the technique we developed in Chapter 2. Indeed, our general existence proof for private information model (see Section 2.7 and Appendix A) adapts to full information model with minor changes. In particular the necessary and suﬃcient condition for the existence is the same as before, which is K (ζ 0 ) < 1.29 Having developed the results in the previous subsection, it is now easy to see the necessity of K (ζ 0 ) < 1. Indeed, if there exists some nontrivial steady-state equilibrium, then Lemma 14 implies the condition K (ζ 0 ) < 1. For the suﬃciency part, the proof for the full information model is strictly easier than that for the private information model (which is provided in Section 2.7 and Appendix A) because we do not have to consider proposing strategies in our construction mapping T , whose fixed point characterizes an equilibrium. The essential changes involved are to modify Definition 4 of Tε by (i) deleting the proposers’ problems (2.31) and (2.32), (ii) replacing the expressions inside the square brackets in (2.33) and (2.34) by Z dNS (c) (ρB (v) − ρS (c)) βB S {c:ρB (v)≥ρS (c)} and βS Z (ρB (v) − ρS (c)) dNB (v) B {v:ρB (v)≥ρS (c)} respectively, and (iii) redefining qB and qS according to (3.14) and (3.15). Theorem 4 Given the parameters (b, s, F, G, M, β B , β S , r, κB , κS ), a nontrivial steady-state equilibrium exists in the full information model if and only if a nontrivial steady-state equilibrium exists in the private information model. More precisely, for either the private in29 The value ζ 0 ≡ β B κS β S κB in the full information model should not be interpreted as the buyer-seller ratio in full-trade equilibrium. Nevertheless, it can be, like in the private information model, interpreted as the equilibrium buyer-seller ratio when r = 0. 61 Chapter 3. Role of Information Structure in Dynamic Matching Markets formation or the full information model, a necessary and suﬃcient condition for existence of a nontrivial steady-state equilibrium is K (ζ 0 ) < 1, where ζ 0 and the function K are defined by (3.9) and (3.10). For the intuition of the existence condition K(ζ 0 ) < 1, see Section 2.7. Here let us discuss the intuition of the invariance of this condition across diﬀerent information structures. It suﬃces to consider the "marginal situation" where the search costs are such that K (ζ 0 ) is smaller than but very close to 1. Then only those potential buyers with valuations very close to 1 and those potential sellers with costs very close to 0 would enter. That is to say, all buyers (sellers) in the market are virtually homogeneous in their valuations (costs). It is no wonder that the information structure at the bargaining stages does not alter the existence condition in this situation. 3.3.4 Full-trade equilibrium In the context of full information bargaining, a nontrivial steady-state equilibrium is fulltrade (i.e. every meeting results in a trade) if and only if v ≥ c̄. (That is, the dichotomy of full-trade/non-full-trade and the dichotomy of separated/overlapping supports we introduce in Chapter 2 are the same thing in the context of full information.) We will characterize the full-trade equilibria under full information later (see Section 3.6). For now, let us present the results on the existence and uniqueness of full-trade equilibrium, which are due to Mortensen and Wright (2002). We need some definitions in order to state the following theorem. Let ψ B : (0, ∞) → (0, ∞] and ψ S : (0, ∞) → (0, ∞] be ψ B (ζ) ≡ ψ S (ζ) ≡ β B max β S ζ max nR ∗ p 0 nR 1 p∗ β S κB ζ dG(c) (p∗ − c) G(p ∗) − o, κB αB (ζ)β B , 0 β B κS dF (v) (v − p∗ ) 1−F (p∗ ) − o. κS αS (ζ)β S , 0 62 Chapter 3. Role of Information Structure in Dynamic Matching Markets (These functions take the value ∞ whenever their defining expressions have a denominator 0.) Now let r̂ ∈ (0, ∞] be the unique value such that r̂ = ψ B (ζ̂) = ψ S (ζ̂) for some ζ̂ > 0.30 Theorem 5 (Mortensen and Wright, 2002) Under full information, a (unique) fulltrade equilibrium exists if and only if K(ζ 0 ) < 1 and r ≤ r̂. Moreover, if r is suﬃciently close to 0, then non-full-trade equilibrium does not exist, implying uniqueness of equilibrium. From the above definition of r̂ we can prove the following results (for full information model), which is parallel to Corollary 2 (for private information model). Corollary 6 (a) In the region where r̂ < ∞, if κB and κS increase, then r̂ increases, and vice versa. (b) Given any r > 0, there is a κ̄ > 0 such that full-trade equilibrium in the full information model does not exist whenever κB , κS < κ̄. (c) Given any r > 0, a full-trade equilibrium in the full information model exists when (κB , κS ) is such that K(ζ 0 ) is less than but suﬃciently close to 1. (d) Given any (κB , κS ) such that K(ζ 0 ) < 1, a full-trade equilibrium exists when r is suﬃciently close to 0. Proof. For any ζ > 0 such that ψ B (ζ) is finite, ψ B (ζ) is strictly increasing in κB . Similarly, for any ζ > 0 such that ψS (ζ) is finite, ψ S (ζ) is strictly increasing in κS . Hence (a) holds. For any ζ > 0, we have ψ B (ζ) → 0 as κB → 0; and ψ S (ζ) → 0 as κS → 0. Therefore r̂ → 0 as (κB , κS ) → 0, and (b) follows. B ≥ K(ζ 0 ) or It follows from Lemma 4 that, for any ζ > 0, we must have either αB κ(ζ)β B R R ∗ p 1 dG(c) κS ∗ ∗ dF (v) αS (ζ)β ≥ K(ζ 0 ). Also notice that both 0 (p −c) G(p∗ ) and p∗ (v−p ) 1−F (p∗ ) are constants S strictly smaller 1. Then according to the definitions of ψB (·) and ψ S (·), it is impossible to 30 It is easy to see that ψ B and ψS are continuous. Moreover, ψ B is nondecreasing and ψS is nonincreasing, and lim ψB (ζ) = lim ψ S (ζ) = 0. ζ→0 ζ→∞ Therefore r̂ is well-defined. 63 Chapter 3. Role of Information Structure in Dynamic Matching Markets keep both ψ B (ζ) and ψ S (ζ) finite if we let K(ζ 0 ) go to 1 from below. Therefore r̂ = ∞ when K(ζ 0 ) is less than but suﬃciently close to 1. Hence (c) follows. (d) is simply from r̂ > 0 for any κB , κS > 0 such that K(ζ 0 ) < 1. Usually a full-trade equilibrium is easier to exist under full information bargaining. Example 2 Take the parameters as in Example 1, i.e. b = s = 1/2, F (v) = v, G(c) = c, β B = β S = 1/2, and M (B, S) = BS/(B + S). Also take κB = κS = κ. The r̂ in Theorem 5 (the threshold of r below which a full-trade equilibrium exists under full information) is r̂ = 4κ , max {1 − 16κ, 0} and the r∗ in Theorem 1 (the threshold of r below which a full-trade equilibrium exists under private information) is r∗ = 4κ . max {1 − 12κ, 0} Obviously r̂ ≥ r∗ and it is strict unless r̂ = r∗ = ∞. In other words, a full-trade equilibrium is strictly easier to exist in full information model than in private information model. 3.4 No-discounting case The previous two sections describe the private information model and the full information model respectively. The equilibrium properties of the two models exhibit some similarities. They have the same necessary and suﬃcient condition for the existence of some (nontrivial steady-state) equilibrium. In either model, keeping other parameters unchanged, any equilibrium must be full-trade if the discount rate r is suﬃciently close to 0; and any equilibrium must be non-full-trade if r is suﬃciently large. In this section, we completely solve the equilibria for both of the two models for the case where there is no time discounting. Formally, we extend our private information model to allow r = 0, and define an associated nontrivial steady-state equilibrium as a tuple (WB , WS , χB , χS , pB , pS , NB , NS ) such that (i) it satisfies the conditions in Definition 5 evaluated at r = 0, and (ii) it is the limit of some private information equilibrium sequence 64 Chapter 3. Role of Information Structure in Dynamic Matching Markets as r → 0 from above. Similarly, we extend our full information model to allow r = 0, and define an associated nontrivial steady-state equilibrium as a tuple (WB , WS , χB , χS , NB , NS ) such that (i) it satisfies the conditions in Definition 6 evaluated at r = 0, and (ii) it is the limit of some full information equilibrium sequence as r → 0 from above.31 Both models are greatly simplified in the no-discounting case. Furthermore, the nodiscounting case provides a benchmark in which the information structure at the bargaining stages plays no role. Indeed, if r = 0, the two models are equivalent, in the sense that any equilibrium of the full information model must be an equilibrium of the private information model, and conversely any equilibrium of the private information model must be an equilibrium of the full information model. To see this, consider the full information model with r > 0 and let r → 0. From (3.18) and (3.19), in the limit we have v = ρB (1) and ρS (0) = c̄. In words, all buyers (sellers) in the market have the same dynamic valuation (dynamic cost). Participating traders are homogeneous in their dynamic types although they are heterogeneous in their original types. It follows that a trader within a meeting does not really need to observe his partner’s types, because all that matter for bargaining are the dynamic types rather than the original types. Therefore, any equilibrium under no discounting would still be an equilibrium when we switch the information structure into the private one. Conversely, consider the private information model with r > 0 and let r → 0. From (2.12) and (2.13), in the limit we have v = ρB (1) and ρS (0) = c̄. Clearly a seller (buyer) whenever being a proposer would have no choice but propose the trading price v (c̄), and this oﬀer would be accepted. Letting the proposer know the responder’s type does not have a bite, because the proposer already knows the responder’s dynamic type, which is all he needs to make the decision of proposing. Thus, this equilibrium would still be an equilibrium when we switch into the full information model. We now solve the no-discounting case analytically.32 We have already claimed that v = ρB (1) and ρS (0) = c̄ in any of the two models. Then both Lemma 2(c) (for private 31 32 We will see (ii) actually implies (i) in either models. Mortensen and Wright (2002) have already solved it for their full information model. 65 Chapter 3. Role of Information Structure in Dynamic Matching Markets information) and Lemma 11 (for full information) are (in the limit) reduced to: αB (ζ)β B max {v − c̄, 0} = κB , (3.25) αS (ζ)β S max {v − c̄, 0} = κS . (3.26) Equation (3.25) simply means that the type v buyers are indiﬀerent between entering or not: the left-hand side is the expected gain from participating in the market per unit time, and the right-hand side is the corresponding search cost. Similarly equation (3.26) is the indiﬀerence condition for marginal sellers. Noticing that αS (ζ)/αB (ζ) = ζ, equations (3.25) and (3.26) uniquely pin down the buyer-seller ratio ζ and entry gap v − c̄: ζ = ζ 0, (3.27) v − c̄ = K (ζ 0 ) > 0, (3.28) where ζ 0 and K (·) are defined by (3.9) and (3.10). In steady state, the incoming flow of active buyers must equal the incoming flow of active sellers. Thus in either model we have the following inflow balance equation: b[1 − F (v)] = sG (c̄) . (3.29) Given that K (ζ 0 ) < 1, equations (3.28) and (3.29) have a unique solution for (v, c̄), which is denoted as (v 0 , c̄0 ) (see Figure 3.1). Hence, when r → 0 and K (ζ 0 ) < 1, the equilibrium buyer-seller ratio and marginal types are unique and given by (ζ 0 , v 0 , c̄0 ). Other endogenous variables are easily obtained. In particular, the equilibrium is fulltrade, so that qB (v) = qS (c) = 1 for any v ∈ [v 0 , 1] and c ∈ [0, c̄0 ]. As a result, the aggregate inflow-outflow balance equations become b [1 − F (v 0 )] = BαB (ζ 0 ), sG(c̄0 ) = SαS (ζ 0 ), which pin down the steady-state masses of buyers and sellers in the market: B= b [1 − F (v 0 )] , αB (ζ 0 ) S= sG(c̄0 ) . αS (ζ 0 ) 66 Chapter 3. Role of Information Structure in Dynamic Matching Markets Furthermore, the market distributions of types must be proportional to the corresponding distributions of inflow types: NB (v) = B · F (v) − F (v 0 ) , 1 − F (v0 ) NS (c) = S · G(c) . G(c̄0 ) From either Lemma 1 (for private information) or Lemma 10 (for full information), we have WB0 (v) = −WS0 (c) = 1 for any v ∈ [v 0 , 1] and c ∈ [0, c̄0 ]. Therefore the equilibrium lifetime payoﬀs are WB (v) = max {v − v0 , 0} , WS (c) = max {c̄0 − c, 0} . It is easy to verify that these equilibrium objects indeed satisfy Definition 5 and Definition 6. The above analysis yields the following proposition. Proposition 2 If r = 0, the private information model and the full information model are equivalent, in the sense that the two models have the same set of equilibria.33 In fact, this set is either empty (if K (ζ 0 ) ≥ 1) or a singleton (K (ζ 0 ) < 1).34 As in Mortensen and Wright (2002), we generally define the welfare measure W as the aggregate lifetime payoﬀs of a cohort: W ≡ bWBea + sWSea 33 (3.30) Formally, this statement is not completely rigorous, because by Definition 5 an equilibrium of the private information model is a tuple (WB , WS , χB , χS , pB , pS , NB , NS ), while by Definition 6 an equilibrium of the full information model is a collection (WB , WS , χB , χS , NB , NS ); and the proposing strategies (pB , pS ) in the private information model are functions with one argument, while in the full information model they are functions with two arguments (own type and partner’s type). Evidently these can be taken care of, but it would not be interesting at all and we do not bother to do so. 34 This is under the convention that we identify an equilibrium with another one if they diﬀers only in the proposing strategies of non-entrants and entry strategies of marginal entrants. 67 Chapter 3. Role of Information Structure in Dynamic Matching Markets where WBea (WSea ) is a buyer’s (seller’s) ex-ante utility, i.e. Z ea WB ≡ WB (v)dF (v), WSea ≡ Z WS (c)dG(c). (3.31) (3.32) The welfare measure W is also interpreted as the ex-ante utility of an agent before knowing whether he is a buyer or a seller and what his valuation/cost is. (Recall the normalization that b + s = 1 so that the measure of a cohort is 1.) For the no-discounting case, the welfare measure W can be written as Z c̄0 Z 1 (v − v0 ) dF (v) + s (c̄0 − c) dG(c) W = b = Z v0 1 v0 b [1 − F (v)] dv + Z 0 c̄0 sG(c)dc. 0 Figure 3.1 illustrates the equilibrium for the no-discounting case. The black area represents the welfare W . The Walrasian price p∗ must be bracketed by the marginal types v = v 0 and c̄ = c̄0 . Intuitively, it is analogous to the standard demand-supply analysis, with a transaction cost K (ζ 0 ) that must be incurred for each transaction. 3.5 Full-trade equilibria and bargaining eﬃciency The previous section shows that private information in bargaining has no eﬀect in the special case where there is no time discounting. However, when the discount rate is strictly positive, private information will have impacts. This section turns to the question of whether the private information aﬀects the eﬃciency with respect to bargaining. Let us start with a definition. Definition 7 In either the full information or the private information model, a nontrivial steady-state equilibrium is said to be bargaining-eﬃcient if in this equilibrium the bargaining outcome of every meeting is always ex-post eﬃcient, in the sense that every buyer-seller meeting (on the equilibrium path) results in a trade if and only if the matching surplus is 68 Chapter 3. Role of Information Structure in Dynamic Matching Markets v, c 1 v = v0 sG (c) (Flow supply) p* K (ζ 0 ) c = c0 0 b[1 − F (v)] (Flow demand) M ( B, S ) inflow, transaction flow Figure 3.1: Equilibrium when discount rate is zero non-negative (i.e. v − c ≥ WB (v) + WS (c)), or equivalently the buyer’s dynamic value is at least as high as the seller’s dynamic cost (i.e. ρB (v) ≥ ρS (c)). A nontrivial steady-state equilibrium is said to be bargaining-ineﬃcient if it is not bargaining-eﬃcient. Clearly, in the full information model, any nontrivial steady-state equilibrium is bargainingeﬃcient. In the private information model, it is not hard to see that any nontrivial steady-state equilibrium is bargaining-eﬃcient if and only if it is full-trade. Suppose an equilibrium is full-trade, then the entry gap v − c̄ must be strictly positive, so that every meeting (on the equilibrium path) must have positive matching surplus. Thus the equilibrium is also bargaining-eﬃcient. Now suppose an equilibrium is non-full-trade, then either (i) the marginal buyer’s oﬀer pB (v) will not be accepted with probability 1, or (ii) the marginal seller’s oﬀer pS (c̄) will not be accepted with probability 1. To be concrete, let us say (i) is the case. Then there must be sellers with ρS (c) ∈ (pB (v) , v). But then the marginal buyers, 69 Chapter 3. Role of Information Structure in Dynamic Matching Markets when they propose, would not trade with those sellers, although the matching surplus is positive. Therefore the equilibrium is also bargaining-ineﬃcient. Proposition 3 Under full information, any nontrivial steady-state equilibrium is bargainingeﬃcient. Under private information, any nontrivial steady-state equilibrium is bargainingeﬃcient if and only if it is full-trade. We therefore, in the context of private information, only need to recall our results in Chapter 2 on the full-trade equilibrium. By Theorem 2 and Corollary 4, if the discount rate r is small relative to the search costs κB and κS , then in equilibrium bargaining eﬃciency is attained. In contrast, by Theorem 1 and Corollary 2 (see also Remark 1), if the discount rate is large relative to the search costs, then in equilibrium some meetings do not result in a trade although there is a positive matching surplus. Before closing this section, we want to point out that even when private information does not result in bargaining ineﬃciency in equilibrium, the equilibrium welfare level would still be altered. It is because the private information aﬀects the way bargainers split the matching surplus. This redistribution eﬀect would in turn have impacts on potential traders’ entry decisions and hence aggregate welfare. We will discuss it in the next section. 3.6 Entry eﬀect of private information If the frictions (r, κB , κS ) are zero and the agents behave as if in the Walrasian equilibrium (i.e. type v buyers enter if and only v ≥ p∗ , type c sellers enter if and only if c ≤ p∗ , and every participating trader proposes p∗ whenever she is a proposer, and takes p∗ as his reservation price whenever she is a responder), then the welfare measure of our models (either full information or private information) would be at the Walrasian level, denoted as 70 Chapter 3. Role of Information Structure in Dynamic Matching Markets W ∗: Z W∗ ≡ b p∗ = b = 1 Z Z (v − p∗ )dF (v) + s 1 vdF (v) + s p∗ 1 p∗ bF (v)dv + Z Z p∗ Z 0 p∗ (p∗ − c)dG(c) cdG(c) 0 p∗ sG(c)dc. 0 Our search models (either full information or private information) necessarily have lower welfare than the Walrasian level. There are three sources of welfare loss. The first source of welfare loss is the direct eﬀect of frictions (r, κB , κS ): search takes time (and traders discount), and search costs have to be paid. The second one is the entry eﬀect: the entry (or search) of a trader induces positive externality to the opposite side of the market (so called "thick market eﬀect") and negative externality to the same side (so called "congestion eﬀect"). The entry of buyers and sellers could be either too much or too little relative to the constrained optimal level. The third eﬀect is bargaining ineﬃciency, which occurs only in non-full-trade equilibria of the private information model. In the next Chapter, we will see "convergence results" that imply as the frictions vanish, the last two "behavioral eﬀects" also vanish.35 However, in this Chapter we are interested in a market with positive frictions, which is why search theory was developed in the first place. We have seen in the previous section that bargaining ineﬃciency may or may not exist under private information, by and large depending on the composition of frictions. As for entry eﬀect, it is well understood since Diamond (1981) and Mortensen (1982) that, even under full information, search equilibria are generally not constrained eﬃcient due to entry externalities (or search externalities). However, because this strand of literature typically assumes full information bargaining, it does not tell us the interaction between the entry eﬀect and the information structure. In this section, we shall see private information in bargaining aﬀects welfare even when bargaining ineﬃciency does not arise. Basically, even when the private information does not reduce the pie of matching surplus, it redistributes 35 Various versions of this claim for other comparable models can be found in Gale (1987), Mortensen and Wright (2002), Satterthwaite and Shneyerov (2007), Atakan (2008) and Lauermann (2008), etc. 71 Chapter 3. Role of Information Structure in Dynamic Matching Markets the surplus and hence aﬀects the incentives of entry. As a result, private information alters the level of welfare through the channel of entry externalities. To elaborate the above point, let us compare the full-trade equilibria of the two models. To ensure both models have some full-trade equilibrium, we assume K (ζ 0 ) < 1 and 0 ≤ r ≤ min {r∗ , r̂}, where r∗ is given by Theorem 1 and r̂ is given by Theorem 5. Also, we shall use subscript "p" to denote private information (e.g. ζ p ) and use subscript "f " to denote full information (e.g. ζ f ). Section 2.5 shows that, in the context of private information, the unique full-trade equilibrium can be characterized by the following three simple equations with three unknowns ¢ ¡ ζ p , v p , c̄p :36 αB (ζ p )β B (v p − c̄p ) = κB , (3.33) αS (ζ p )β S (v p − c̄p ) = κS , (3.34) b[1 − F (v p )] = sG (c̄p ) . (3.35) Equations (3.33) and (3.34) are marginal entering buyers’ and sellers’ indiﬀerence conditions between entering or not. Equation (3.35) is inflow balance equation, which must hold in steady state. We now turn to the full information full-trade equilibrium.37 Since the equilibrium is full-trade, we have v f ≥ c̄f , and ¡ ¢ F (v) − F v f NBf (v) ¡ ¢ , = Bf 1 − F vf NSf (c) G (c) . = Sf G (c̄f ) Also, (3.18) and (3.19) gives the dynamic types: ¡ ¢ ¡ ¢ rv + αB ζ f β B vf rc + αS ζ f β S c̄f ¡ ¢ ¡ ¢ ρBf (v) = , ρSf (c) = . r + αB ζ f β B r + αS ζ f β S 36 Equations (3.33) through (3.35) are the same as equations (3.25), (3.26) and (3.29) for the no discounting case. It is simply because in the private information model, the full-trade equilibrium ζ p , v p , c̄p does not vary with r. 37 This is already characterized by Mortensen and Wright (2002). 72 Chapter 3. Role of Information Structure in Dynamic Matching Markets Substituting these into the marginal type equations (3.20) and (3.21) in Lemma 11, we obtain Z ¡ ¢ αB ζ f β B ¡ ¢ αS ζ f β S c̄f 0 Z 1£ vf ¤ dG (c) £ = κB , vf − ρSf (c) G (c̄f ) ρBf (v) − c̄f The inflow balance equation still holds here: ¤ (3.36) dF (v) ¡ ¢ = κS . 1 − F vf (3.37) £ ¤ b 1 − F (v f ) = sG(c̄f ). (3.38) ¡ ¢ Equations (3.36) − (3.38) uniquely pin down ζ f , v f , c̄f for all r ≤ r̂. We are now ready to claim that private information in bargaining deters entry, at least within the full-trade class of equilibria. Proposition 4 Fix the parameters (b, s, F, G, M, β B , β S , r, κB , κS ) such that r > 0 and both the full information model and the private information model have a full-trade equilibrium (i.e. K (ζ 0 ) < 1 and 0 < r ≤ min {r∗ , r̂}). Comparing the two full-trade equilibria, we must have v p > v f and c̄p < c̄f . Proof. From the inflow balance equations (3.35) and (3.38), the two inequalities v p > v f and c̄p < c̄f are equivalent. Therefore it suﬃces to prove v p − c̄p > v f − c̄f . We will consider two cases: ζ p ≥ ζ f and ζ p < ζ f . Suppose ζ p ≥ ζ f first. Then αB (ζ p ) ≤ αB (ζ f ) since αB is nonincreasing. Now the buyers’ marginal equations (3.33) and (3.36) imply ∙ Z αB (ζ p )(vp − c̄p ) = αB (ζ f ) vf − c̄f 0 v p − c̄p ≥ v f − Z c̄f 0 ρSf (c) dG(c) ρSf (c) G(c̄f ) ¸ dG(c) . G(c̄f ) Moreover, r > 0 implies ρSf (0) < c̄f and hence Z 0 c̄f ρSf (c) dG(c) < c̄f . G(c̄f ) Combining the above results, we have v p − c̄p > v f − c̄f , as desired. 73 Chapter 3. Role of Information Structure in Dynamic Matching Markets Now suppose ζ p < ζ f . Applying a symmetric logic to the sellers’ marginal equations (3.34) and (3.37), we can easily obtain vp − c̄p > v f − c̄f again. To see the intuition of Proposition 4, we need to compare the entry incentives of the two models. In the full information model, a bargainer extracts the full surplus of matching if he proposes, but gets none if he responds. In contrast, if types are private information, then typically some information rent is redistributed from the proposer of a meeting to the responder. Now recall that the proposer of a meeting is randomly chosen and notice that the responder’s expected information rent is higher if his type is better (i.e. higher value or lower cost). As a result, the redistribution of rent from proposers to responders would be translated into a redistribution from ineﬃcient (i.e. low value or high cost) traders to eﬃcient (i.e. high value or low cost) traders in the market. Therefore, if the information structure is switched from full information into private information, inframarginal entrants have higher incentive to enter while marginal entrants have lower incentive to enter. Now it is clear that the private information model tends to induce less entry, because what matters to the equilibrium amount of entry is the entry incentive of marginal entrants. Proposition 4 simply says that this is unambiguously true when r > 0 and we are comparing two full-trade equilibria. Put it more concretely. Suppose, as a thought experiment, that the marginal types v and c̄ are the same across the two models. Notice that a marginal entering buyer as a responder gets zero rent from bargaining anyway. But as a proposer, a marginal entering buyer under full information extracts the full rent from the seller he meets; while he is (in a full-trade equilibrium) only able to extract the rent of the most ineﬃcient type c̄ of sellers under private information. If r = 0, it makes no diﬀerence because the distribution of sellers’ dynamic types collapses to a single point. But if r is positive, that marginal entering buyer tends to be worse oﬀ under private information than under full information. This tendency might be reversed only when the buyer-seller ratio is lower (so that the buyers’ arrival rate of being matched is higher) under private information, i.e. ζ p < ζ f . Similarly, if r > 0, a marginal seller is worse oﬀ under private information than under full information, 74 Chapter 3. Role of Information Structure in Dynamic Matching Markets unless ζ p > ζ f . Since ζ p < ζ f and ζ p > ζ f cannot hold together, either more buyers or more sellers must be attracted to enter. Finally, the entry must be more for both the buyers’ side and the sellers’ side, because the inflows of the two sides have to balance in steady state. Then why is the result in Proposition 4 only for full-trade equilibria? It is because in non-full-trade equilibria of the private information model the marginal entrants’ proposing gains also depend on the steady-state distributions of dynamic types in the market. These distributions and the traders’ bargaining behaviors aﬀect each other in a highly nontrivial way. Thus it is conceivable that, from a marginal buyer’s (seller’s) standpoint, the distribution of sellers’ (buyers’) dynamic types in the private information model is much more favorable than the full information counterpart. And this eﬀect might dominate the aforementioned information rent eﬀect. Our next goal is to evaluate the impact of private information on the equilibrium buyerseller ratio ζ and level of welfare W . To proceed, in the rest of this section we shall focus on cases where r is positive but suﬃciently close to 0. In such cases, both models have a unique equilibrium, which is full-trade. Doing this has several advantages, both methodologically and technically. First, we can annihilate bargaining ineﬃciency so that the entry eﬀect is isolated out. Second, by virtue of uniqueness we do not need to worry about the selection of equilibria. Third, the relatively simple structures of full-trade equilibria in both models make it feasible to compare the levels of welfare under private and full information. Fourth, by virtue of equivalence between the two models in the no-discounting case, studying suﬃciently small discounting case only amounts to working out the "firstorder eﬀects" of r around the r = 0 case. Yet the main insight gained from our analysis should also enlighten our understanding of the main driving forces in the general case. From now on, we shall think of the equilibrium objects as functions of r. For example, we shall write ζ p (r), ζ f (r), WBp (v; r), WSf (c; r) etc., although the dependency on r might be suppressed for notational simplicity. 75 Chapter 3. Role of Information Structure in Dynamic Matching Markets The welfare measure (defined by (3.30) in general) in the full information model is: Z Z (3.39) Wf (r) = b WBf (v; r)dF (v) + s WSf (c; r)dG(c) ¡ ¢ Z 1 ¡ ¢ αB ζ f β B ¡ ¢ b = v − vf dF (v) r + αB ζ f β B vf ¡ ¢ Z c̄f αS ζ f β S ¡ ¢ s (c̄f − c) dG (c) . + r + αS ζ f β S 0 And, the welfare measure in the private information model is: Z Z Wp (r) = b WBp (v; r)dF (v) + s WSp (c; r)dG(c) = (3.40) αB (ζ 0 ) αS (ζ 0 ) ea bW ea + sWS0 , r + αB (ζ 0 ) B0 r + αS (ζ 0 ) ea (W ea ) is a buyer’s (seller’s) ex-ante utility in the no-discounting case, i.e. where WB0 S0 Z 1 Z c̄0 ea ea (v − v 0 ) dF (v) , WS0 ≡ (c̄0 − c) dG (c) . (3.41) WB0 ≡ v0 0 It is clear from (3.33) − (3.35) that, under private information and small r, the equilibrium buyer-seller ratio ζ p and the marginal entering types vp and c̄p do not change when r varies. Thus ζ p , v p and c̄p are simply at the levels of the no-discounting case. Mathematically, ζ p (r) = ζ 0 , v p (r) = v0 and c̄p (r) = c̄0 for all r suﬃciently close to 0. Furthermore, as we have claimed in Section 3.4, when r = 0, the two models are equivalent. Indeed, it is easy to verify that ζ f (0) = ζ 0 , v f (0) = v0 , c̄f (0) = c̄0 and Wp (0) = Wf (0). By virtue of these, the comparison between the two models for suﬃciently small r > 0 amounts only to working out the derivatives ζ 0f (0), Wp0 (0) and Wf0 (0). Proposition 5 For all suﬃciently small r > 0, the private information model has higher (resp. lower) buyer-seller ratio compared to the full information model if ea ea bWB0 sWS0 − κS κB is negative (resp. positive). 76 Chapter 3. Role of Information Structure in Dynamic Matching Markets Proof. It is shown in Appendix B that the sign of ζ 0f (0) is the same as that of the expression ea sWS0 κS ea bWB0 κB . − This, together with ζ f (0) = ζ p (r) for suﬃciently small r, implies the result. Since ea sWS0 κS − ea bWB0 κB could be positive or negative, Proposition 5 implies that the pri- vate information model may have higher or lower buyer-seller ratio compared to the full information model. Under private information, the slope of the welfare Wp0 (r) evaluated at r = 0 is Wp0 (0) = − ea ea sWS0 bWB0 − . αB (ζ 0 ) αS (ζ 0 ) (3.42) This is simply the direct eﬀect of discounting. In particular, the eﬀect of discounting on buyers’ (resp. sellers’) welfare is proportional to their expected searching time 1/αB (resp. 1/αS ). Under full information, in contrast, the slope of the welfare Wf0 (r) evaluated at r = 0, as shown in Appendix B, is Wf0 (0) = − ea ea sWS0 bWB0 − − sG (c̄0 ) K 0 (ζ 0 ) ζ 0f (0) . αB (ζ 0 ) αS (ζ 0 ) (3.43) Other than the direct eﬀect, the increase in r away from 0, by inducing additional entry, could increase or decrease the buyer-seller ratio ζ f , which in turn aﬀects the expected searching time 1/αB and 1/αS . Thus the indirect eﬀect on the total accumulated search costs incurred by a cohort is the last term in (3.43). In Appendix B, we also show that the diﬀerence of the two slopes can be written as Wp0 (0) − Wf0 (0) = sG (c̄0 ) K 0 (ζ 0 ) ζ 0f (0) = K (ζ 0 ) [σ S (ζ 0 ) − β S ] µ ea ea sWS0 bWB0 − κS κB ¶ (3.44) where σ S (ζ) ≡ 1 − ζm0 (ζ) /m (ζ) is the elasticity of the matching function with respect to the mass of sellers (i.e. σ S (ζ) = SM2 (B, S) /M (B, S)). We thus have the following theorem. 77 Chapter 3. Role of Information Structure in Dynamic Matching Markets Theorem 6 For all suﬃciently small r > 0, the private information welfare Wp (r) is higher (resp. lower) than the full information welfare Wf (r), if µ ea ea ¶ sWS0 bWB0 [σ S (ζ 0 ) − β S ] − κS κB is positive (resp. negative). It is easy to see that the diﬀerence Wp0 (0) − Wf0 (0) may be either positive or negative, depending on the elasticity of the matching function, the search costs, the new-born rates and the new-born distributions. For example, if the new-born rates are equal (i.e. b = s), the new-born distributions F and G are flips of each other (i.e. 1 − F (x) = G(1 − x) for √ ea = W ea ) and the matching function is Cobb-Douglas BS (so all x ∈ [0, 1], so that WS0 B0 ¡ ¢ that σ S = 1/2), then the sign of Wp0 (0) − Wf0 (0) is the same as 12 − β S (κB − κS ). In other words, when the discount rate is positive but small, the private information welfare is higher (resp. lower) than the full information welfare if the side with greater bargaining power incurs higher (resp. lower) search costs. The intuition behind Theorem 6 is the following. Basically, the first factor σ S (ζ 0 ) − β S summarizes entry externalities, while the second factor ea sWS0 κS − ea bWB0 κB represents how information structure aﬀects the equilibrium buyer-seller ratio. The product of the two hence represents the interaction between entry externalities and information structure. To get more insight, recall that traders’ entry imposes positive externality to the opposite side of the market and negative externality to the same side. In case of constant returns to scale matching technology and zero discount rate, Mortensen and Wright (2002) show that the positive and negative externalities completely cancel out only when the Hosios (1990) condition holds, i.e. σ S = β S . If, for example, the elasticity of matching function with respect to the mass of sellers, σ S , is larger than sellers’ bargaining weight β S , then the equilibrium buyer-seller ratio is higher than the constrained optimal level, hence decreasing ζ would be welfare enhancing. On the other hand, Proposition 5 implies that for small positive r, if ea sWS0 κS > ea bWB0 κB , then the private information model has smaller ζ. Therefore, the private information model could have better welfare performance if both σ S > β S and ea sWS0 κS > ea bWB0 κB hold. 78 Chapter 3. Role of Information Structure in Dynamic Matching Markets 3.7 Concluding remarks Until recently, the literature of search models and dynamic matching and bargaining games usually adopts (generalized) Nash bargaining solution, which inevitably requires that the bargainers know each other’s type during the bargaining. This might not be an appealing assumption for many applications. In order to understand the impact of releasing this common assumption, we have analyzed and compared two models of dynamic matching markets: the private information model and the full information model. The two models diﬀer in only one aspect: whether the bargainers observe each other’s type during the bargaining. There are two kinds of frictions: discount rate and search costs. If the discount rate is zero, private information bargaining has no impact at all. More generally, the smaller the discount rate relative to the search costs, the more alike the two models are. The bargaining eﬃciency, an equilibrium property of the full information model, is maintained under private information bargaining as long as the discount rate is small enough relative to the search costs. Furthermore, private information bargaining does not aﬀect when the market would breakdown and when open. The private information model induces less potential traders to enter, at least when the discount rate is small. Intimately relating to Hosios (1990) condition, the impact of private information on social welfare could be either positive or negative. Before closing this chapter, we note that the dynamic structure of our models is important to obtain our results. An easy way to see this is to notice that the discount rate plays a crucial role in our analyses and results; and the discount rate can play a role only in dynamic models. Indeed, the uniqueness of full-trade equilibria hinges on small discounting. Our results on entry eﬀect hinges on the uniqueness and simple characterization of full-trade equilibria. 79 Chapter 4 Rate of Convergence towards Perfect Competition 4.1 Introduction This chapter continues our study of decentralized dynamic matching markets.38 The previous two chapters analyze the markets with non-vanishing frictions. This chapter, in contrast, studies the convergence properties of dynamic matching markets, as search frictions vanish. Our baseline model is the one in Chapter 2. In particular, the buyers and sellers participating in the market are matched pairwise; and every pair of buyer and seller bargains over the trading outcome under the so-called random-proposer bargaining protocol, and under two-sided private information. In order to reduce repetition, this chapter is not prepared to be self-contained. Readers should have read either Chapter 2 or Chapter 3 before reading this chapter. Our basic results are as follows. As frictions vanish, we not only show that the equilibrium price range collapses to the Walrasian (or market-clearing) price, but also show that the rate of convergence is linear, i.e. of the same order as frictions (Theorem 7 and Corollary 7). Furthermore, under random-proposer bargaining, equilibrium welfare also converges to the first best Walrasian level at the linear rate, which is shown to be the fastest possible rate among all bargaining mechanisms (Theorem 9, Theorem 10 and Corollary 11). 38 The chapter significantly includes the materials in my manuscript "The Rate of Convergence to Perfect Competition of a Simple Matching and Bargaining Mechanism", which is joint with my thesis co-supervisor Artyom Shneyerov. 80 Chapter 4. Rate of Convergence towards Perfect Competition We also provide two robustness checks for our basic results. The first one is to assume full information bargaining, as in Mortensen and Wright (2002), rather than private information bargaining. We show that our basic results are robust to this switch of information structure (Theorem 8 and Corollary 10). The second robustness check is to assume bilateral double auction bargaining, as first introduced by Chatterjee and Samuelson (1983), instead of random-proposer take-it-or-leave-it bargaining. We show that our basic results are not robust to this switch of bargaining protocol. More precisely, along some sequences of nontrivial steady-state equilibria under double auction bargaining, the equilibrium price range does not collapse to the Walrasian price, and the equilibrium welfare level does not converge to the Walrasian welfare level. These results suggest that information structure at the bargaining stages does not aﬀect asymptotic eﬃciency, but bargaining protocol might. To understand why the random-proposer bargaining has robust convergence property but the double auction bargaining does not, first notice the well known fact that double auction bargaining generates plethora of equilibria. As it turns out, although there are sequences that are convergent to perfect competition, we are also able to select sequences of progressively ineﬃcient equilibria that keep far from it, no matter how small the frictions are. This ineﬃciency along our non-convergent sequences is due to a positive entry gap v − c̄ that is bounded away from zero even when frictions vanish. (Recall that v denotes the lowest valuation of those buyers who enter; and c̄ denotes the highest cost of sellers who enter.) It is because under double auction, the bargaining power of any bargainer is not guaranteed. One can construct a double auction full-trade equilibrium with large entry gap by giving one side of the market, say sellers, large bargaining power. It makes the buyers reluctant to enter. But it does not mean the sellers have strong incentive to enter. It is because in steady state, more entry of sellers makes the stock of sellers accumulate, so that the steady-state buyer-seller ratio is so low, cancelling the incentive of entry brought by the high bargaining power. This is the intuition behind Theorem 11. In short, under double auction, the potentially unbalanced distribution of bargaining 81 Chapter 4. Rate of Convergence towards Perfect Competition power between buyers and sellers can seriously deter entry of both of the two sides, leading to large ineﬃciency for arbitrarily small frictions. Random-proposer bargaining, on the other hand, distributes the bargaining power between buyers and sellers rather evenly, which guarantees that both sides have the right entry incentives in the limit. We also discuss another class of progressively ineﬃcient equilibria under double auction, which are so-called two-step equilibria. In such equilibria, there is again positive entry gap that is bounded away from zero, but there is no unbalancedness between buyers and sellers. Instead, we play with some kind of unbalancedness between good traders (i.e. high valuation buyers and low cost sellers) and bad traders (Theorem 13). The structure of this chapter is as follows. Section 4.2 borrows the framework in Chapter 2, which assumes private information random-proposer bargaining, as our baseline model. Section 4.3 derives for our baseline model the rate of convergence of equilibrium price range to the Walrasian price as frictions are removed. This section also shows that the rate of convergence remains unchanged if we assume full information bargaining instead. Section 4.4 gives the rate of convergence of equilibrium welfare to the Walrasian welfare level. This section also proves that this rate is the fastest possible rate among all bargaining mechanisms, either under private or full information. Section 4.5 presents and proves our results for the double auction bargaining. Section 4.6 concludes. 4.2 The baseline model We take the dynamic matching and bargaining game we study in Chapter 2 as the baseline model of this Chapter. In particular, the market we study is decentralized; searching for a trading partner is costly; the trading decisions and trading prices are determined by bilateral bargaining under two-sided incomplete information. Our equilibrium concept is the one we call nontrivial steady-state equilibrium. Readers can consult Chapter 2 for the details and Section 3.2 for a brief review. Recall that the flow rate of pairwise matching generated in the market is given by a matching function M (B, S), where B and S are the masses of active buyers and active 82 Chapter 4. Rate of Convergence towards Perfect Competition sellers currently in the market. Since we want to study the convergence properties of our model as search frictions vanish, let us embed a shifter τ in the matching function, and write M (B, S; τ ) instead of M (B, S). This shifter τ is chosen to be inversely proportional to the rate of matching. That is, M (B, S; τ ) ≡ M̃ (B, S) τ for some function M̃ : R2+ → R+ that satisfies Assumption 2 (see p.12). Therefore τ is analogous to the time length between matches in discrete time models, e.g. Satterthwaite and Shneyerov (2007). The parameter τ plays a crucial role throughout this chapter, because we are interested in the asymptotic properties of our model as τ → 0.39 Let us say a bit more about τ . Note that τ is proportional to an active trader’s expected waiting time until his next meeting. To see this, notice that, given steady-state active trader masses B and S, trading opportunities for a buyer arrive at the Poisson rate M (B, S; τ )/B or equivalently M̃ (B, S)/τ B. Therefore the expected waiting time is τ · B/M̃ (B, S). Similarly, the expected waiting time for the seller is τ · S/M̃ (B, S). The inverse of τ can also be interpreted as the level of competition intensity that is analogous to the number of traders in the centralized double auction literature. To see why, recall that in a centralized market, traders are competing intratemporally with all other traders on the same side. In contrast, in the dynamic matching environment here, traders, owing to the matching frictions, are not directly competing with all other traders on the same side whenever they bargain with their partners. But they do intertemporally compete with others in the sense that their partners have the option to search another to trade with. Since 1/τ is proportional to arrival rates, it measures the local market size that reflects the intensity of this intertemporal competition. Since the buyers’ and sellers’ arrival rates of being matched, denoted as αB and αS in Chapter 2, directly depend on τ , let us write αB (ζ, τ ) and αS (ζ, τ ) instead of αB (ζ) and 39 All of our results hold equally well if we fix τ and let the discount rate r, search costs κB and κS tend to 0 proportionally, instead of letting τ → 0. 83 Chapter 4. Rate of Convergence towards Perfect Competition αS (ζ). (Recall that ζ ≡ B/S.) More precisely, αB (ζ, τ ) ≡ M̃ (ζ, 1) , τζ αS (ζ, τ ) ≡ M̃ (ζ, 1) . τ The function K (see p.24) also directly depends on τ , so we write K(ζ, τ ) rather than K(ζ). Note that, given any ζ, K(ζ, τ ) is proportional to τ . Specifically, κS κB + αB (ζ, τ ) αS (ζ, τ ) = τ · K (ζ, 1) . K(ζ, τ ) ≡ All other notations are left unchanged. 4.3 Rate of convergence of trading prices In (nontrivial steady-state) equilibrium, trading prices are diﬀerent across transactions, simply because buyers and sellers in the market are heterogeneous, and the matching and the selection of proposer are random. Recall that, in our terminology and notations in Chapter 2, the price oﬀer proposed by the proposer (either buyer or seller) of a meeting must fall within what we call the proposing interval [pB (v) , pS (c̄)]; while the reservation price (or dynamic type) of the responder must fall within what we call the responding interval [ρS (0) , ρB (1)]. (Of course, these intervals implicitly depend on τ , and on which equilibrium is prevailing.) Besides, the Walrasian price (or market-clearing price) p∗ is the price that clears the flow demand b [1 − F (·)] and flow supply sG (·): b[1 − F (p∗ )] = sG (p∗ ) . The purpose of this section is to prove that both the proposing interval [pB (v) , pS (c̄)] and the responding interval [ρS (0) , ρB (1)] collapse to Walrasian price p∗ as τ → 0, and furthermore to show the speed of it. 84 Chapter 4. Rate of Convergence towards Perfect Competition At this point it is helpful to recall Lemma 3, which asserts that in any nontrivial steadystate equilibrium, p∗ ∈ [pB (v) , pS (c̄)] ⊂ [ρS (0) , ρB (1)] . Hence it suﬃces to consider convergence of the length ρB (1) − ρS (0). Indeed, we will show that ρB (1) − ρS (0) is O (τ ). In other words, as τ → 0, the length ρB (1) − ρS (0) converges to 0 at the linear rate. 4.3.1 Convergence of full-trade equilibria Before proving our general rate of convergence theorem, we show how the linear rate is obtained when we restrict our attention to full-trade equilibria. This can be done in a simple manner because a full-trade equilibrium admits a simple characterization. Recall that, in a full-trade equilibrium (if it exists), the buyer-seller ratio ζ, and the marginal entering types v and c̄ are uniquely determined by the following three equations: ζ= β B κS ≡ ζ 0, β S κB v − c̄ = K (ζ 0 , τ ) , b[1 − F (v)] = sG(c̄). It follows that the entry gap v − c̄ converges to 0 at the linear rate in τ . Recall Lemma 1 (see p.16). Since qB (v) = qS (c) = 1 and ζ = ζ 0 in the full-trade equilibrium, the slopes of responding strategies also converge to 0 linearly in τ . Consequently, ρB (1) − ρS (0) converges at that rate as well. 4.3.2 General convergence theorem Proving that all equilibria (i.e. also non-full-trade) converge at the linear rate in τ is much harder. However, our result is neat. 85 Chapter 4. Rate of Convergence towards Perfect Competition Theorem 7 (Rate of convergence for trading prices) Fix τ > 0. In any nontrivial steady-state equilibrium, we have ¶ µ 2r 3 K (ζ 0 , τ ) ≤ pS (c̄) − pB (v) ≤ ρB (1) − ρS (0) ≤ K (ζ 0 , τ ) 1 + , κ where ζ 0 ≡ β B κS /β S κB and κ ≡ min{κB , κS }. We will prove Theorem 7 in the next subsection. Notice that both the upper and lower bounds in the theorem are proportional to τ . We thus conclude that the proposing interval and responding interval collapse at the linear rate as τ → 0. Moreover, the upper bound provided in Theorem 7 converges to the lower bound as r gets small relative to κ ≡ min{κB , κS }. It indicates that our bounds are tight at least when the discount rate is small relative to the search costs. As a corollary of Theorem 7, traders’ proposing and responding strategies must converge to the Walrasian price at no-slower-than-linear convergence rate. Corollary 7 Fix (r, κB , κS ) À 0. For any sequence of nontrivial steady-state equilibria parametrized by τ such that τ → 0, the proposing interval [pBτ (v) , pSτ (c̄)] and responding interval [ρSτ (0) , ρBτ (1)] collapse to the Walrasian price {p∗ } at no-slower-than-linear convergence rate. More precisely, max {|pBτ (v) − p∗ | , |pSτ (c̄) − p∗ | , |ρSτ (0) − p∗ | , |ρBτ (1) − p∗ |} ¶ µ 2r 3 . ≤ K (ζ 0 , τ ) 1 + κ Before turning to the proof of Theorem 7, we make two remarks. Remark 2 In the previous two chapters and Mortensen and Wright (2002), frictions are represented by the discount rate and search costs. Our result can equally well be interpreted that way: fix the matching function and let the discount rate and search costs be τ ·(r, κB , κS ), then the equilibrium responding interval and proposing interval would collapse at linear rate as τ → 0. Indeed, the upper and lower bounds in Theorem 7 do not change if we replace τ by 1 and then (r, κB , κS ) by τ · (r, κB , κS ) (note that K(ζ 0 , 1) will also be replaced by τ · K(ζ 0 , 1)). 86 Chapter 4. Rate of Convergence towards Perfect Competition Remark 3 We interpret Theorem 7 as a rate of convergence result because our interest of this chapter is the convergence of decentralized market towards perfect competition. But it is clear that Theorem 7 is much more than merely an asymptotic result. More precisely, Theorem 7 provides upper and lower bounds of the lengths pS (c̄)− pB (v) and ρB (1)− ρS (0) (and hence the deviation of trading prices from the Walrasian price) for any parameter profile and any nontrivial steady-state equilibrium. In other words, it is also a result for the world of non-vanishing frictions. In this regard, it is complementary to our results in the previous two chapters. The above two remarks can be made for all the results throughout this and the next sections. 4.3.3 Proof of Theorem 7 We are now ready to prove Theorem 7. The following formal proof will be followed by some intuition behind it. Proof of Theorem 7. Step 1 : We claim that (a): κB v − ρS (0) ≥ ρB (1) − ρS (0) r + κB (b): κS ρB (1) − c̄ ≥ . ρB (1) − ρS (0) r + κS We provide the proof for part (a) only. The proof for part (b) is the flip of that for part (a). The buyers’ marginal type equation in Lemma 2(c) (see p.18) can be written R as αB (ζ) β B ΓS (pB (v)) [v − pB (v)] = κB where ΓS (p) ≡ {c:p−c≥WS (c)} dNSS (c) . Notice that qB (v) ≥ β B ΓS (pB (v)) > 0 whenever v ∈ [v, 1], and that v − ρS (0) ≥ v − pB (v) > 0, we have αB qB (v)(v − ρS (0)) ≥ κB whenever v ∈ [v, 1]. Then for almost all v ∈ [v, 1], ρ0B (v) = r r + αB qB (v) Hence ρB (1) − v = Z v 1 ≤ r . κB /(v − ρS (0)) ρ0B (v)dv ≤ r , κB /(v − ρS (0)) 87 Chapter 4. Rate of Convergence towards Perfect Competition r ρB (1) − v ≤ , v − ρS (0) κB v − ρS (0) 1 1 κB = ≥ . r = ρB (1) − ρS (0) 1 + (ρB (1) − v)/(v − ρS (0)) 1 + κB r + κB Step 2 : We claim that (a): min{v, c̄} − ρS (0) ≤ 4r (r + κB ) αS β S κB (b): ρB (1) − max{v, c̄} ≤ 4r(r + κS ) . αB β B κS Again by symmetry, we only provide a proof for (a). Recall that pS (c) solves the sellers’ proposing problem in (2.5). In other words, pS (c) ∈ arg maxp∈[0,1] [1 − ΓB (p)] [p − ρS (c)] R B (v) . where ΓB (p) ≡ {v:v−p≥WB (v)} dNB Let y ≡ min{v, c̄} − ρS (0). Consider a type c seller with ρS (c) ≤ ρS (0) + y/2, then [1 − ΓB (pS (c))] [pS (c) − ρS (c)] ≥ [1 − ΓB (v)] [v − ρS (c)] ³ y ´ v − ρS (0) ≥ . ≥ v − ρS (0) + 2 2 Consequently, such a seller’s probability of trade in a given meeting, qS (c), is bounded from below by v − ρS (0) βS pS (c) − ρS (c) 2 β S κB β S v − ρS (0) ≥ . 2 ρB (1) − ρS (0) 2 (r + κB ) qS (c) ≥ β S [1 − ΓB (pS (c))] ≥ ≥ The last inequality is from step 1(a). Then from (2.13) in Lemma 1 (see p.16), ρ0S (c) = r r + αS qS (c) ≤ r 2r (r + κB ) = . αS β S κB /2r (r + κB ) αS β S κB Now we can see that Z y 2r (r + κB ) = ρ0S (c) dc ≤ , 2 αS β S κB {c:ρS (c)∈[ρS (0),ρS (0)+ y2 ]} which is the same as (a). 88 Chapter 4. Rate of Convergence towards Perfect Competition Step 3 : Let κ be min{κB , κS }. We claim that ¶ ½ ¾ ³ µ κS κB r´ 2r 2 , . ρB (1) − ρS (0) ≤ min · 1+ 1+ αS β S αB β B κ κ To prove it, first notice that from step 2(a) and inequality (2.24) (see p.31), we have v − ρS (0) = min{v, c̄} − ρS (0) + max {v − c̄, 0} ≤ Then from step 1(a), ρB (1) − ρS (0) ≤ = ≤ = 4r (r + κB ) κS + . αS β S κB αS β S ∙ ¸ r + κB r + κB 4r(r + κB ) (v − ρS (0)) ≤ + κS κB αS β S κB κB µ ¶∙ µ ¶¸ κS r 4r r 1+ 1+ 1+ αS β S κB κS κB ∙ ¸ ³ ´ ³ ´ r κS r 4r 1+ 1+ 1+ αS β S κ κ κ ¶2 µ ³ ´ r 2r κS . 1+ 1+ αS β S κ κ Similarly, from step 2(b), inequality (2.24) and step 1(b), ¶ µ r´ κB ³ 2r 2 ρB (1) − ρS (0) ≤ 1+ . 1+ αB β B κ κ We get our claim by combining the above two upper bounds of ρB (1) − ρS (0). Step 4 : We claim that ρB (1) − ρS (0) ≥ pS (c̄) − pB (v) ≥ max ½ κS κB , αS β S αB β B ¾ . To prove it, simply observe that Lemma 2(a,c) (see p.18) implies κB ≤ αB β B (v − pB (v)) ≤ αB β B (pS (c̄) − pB (v)), κS ≤ αS β S (pS (c̄) − c̄) ≤ αS β S (pS (c̄) − pB (v)), and pS (c̄) − pB (v) ≤ ρB (1) − ρS (0). Step 5 : Combine steps 3 and 4, we get ¾ ½ κB κS ≤ pS (c̄) − pB (v) ≤ ρB (1) − ρS (0) , max αS β S αB β B ¾ ³ ½ µ ¶ κS κB r´ 2r 2 , · 1+ ≤ min 1+ αS β S αB β B κ κ ¶3 ½ ¾ µ κS κB 2r ≤ min , . · 1+ αS β S αB β B κ (4.1) 89 Chapter 4. Rate of Convergence towards Perfect Competition From Lemma 4 (see p.26) we have ½ ½ ¾ ¾ κS κS κB κB , , min ≤ K (ζ 0 , τ ) ≤ max . αS β S αB β B αS β S αB β B Combine the above two results, we obtain the theorem. As a by-product of the above proof, we also obtain upper and lower bounds for the equilibrium buyer-seller ratio ζ. These bounds do not depend on τ , which implies that ζ is O (1) as τ → 0. Corollary 8 In any nontrivial steady-state equilibrium, we have ¶ ¶ µ µ 2r −3 2r 3 ≤ ζ ≤ ζ0 · 1 + ζ0 · 1 + κ κ where ζ 0 ≡ β B κS /β S κB and κ ≡ min{κB , κS }. Proof. From (4.1) we have κS κB ≤ αS β S αB β B ¶ µ 2r 3 1+ κ κB κS ≤ αB β B αS β S ¶ µ 2r 3 1+ . κ and Recall that αS /αB = ζ. Then we get the result by simple rearranging of terms. We now turn to the intuition behind the proof of Theorem 7. The main parts of the above proof are step 2 through step 4. Steps 2 and 3 derive an upper bound (proportional to τ ) for the length of responding interval ρB (1) −ρS (0), while step 4 derives a lower bound for the length of proposing interval pS (c̄) − pB (v). The lower bound part is relatively easy. We have seen in Lemma 2(a) (on p.18) that the marginal entering types v and c̄ must fall within the proposing interval [pB (v) , pS (c̄)] in equilibrium. If the length pS (c̄) − pB (v) is too small, the marginal entrants would not be able to recover the search costs they incur. (The accumulated search cost is O(τ ).) Therefore pS (c̄) − pB (v) is bounded below by τ multiplied by some constant. The upper bound part is subtler. Following the logic we use to show the linear rate of convergence for full-trade equilibria, we want to show the slopes of responding strategies 90 Chapter 4. Rate of Convergence towards Perfect Competition ρB (v) and ρS (c) are O(τ ). Look at sellers for example, from (2.13) (on p.18), ρ0S (c) is indeed O(τ ) for those c such that the probability of trade qS (c) is bounded away from 0. Such a boundedness of qS (c) in turn can be obtained for low cost sellers (ρS (c) ≤ ρS (0) + y/2 in step 2) since those sellers, with substantial profitability, would never prefer to make an oﬀer that is accepted with a too low probability. Therefore, ρ0S (c) is O(τ ) for a subset of active sellers. Moreover, our choice of the subset allows us to extend the result to bound min {v, c̄}−ρS (0); and then the statement claimed in step 1 further extends the boundedness to the whole length of responding interval ρB (1) − ρS (0). 4.3.4 Full information model This subsection deviates from our baseline model by considering full-information bargaining as introduced in Section 3.3. We will see that the rate of convergence remains unchanged in this full information model. Furthermore, the proof of the rate of convergence for the full information model is similar to (actually a bit easier than) that for our baseline (private information) model, although it seems not convenient to unify the two proofs. Recall that in the full information model we study in Chapter 3, we assume that, as in our baseline model, traders bargain using the random-proposer protocol with buyers’ bargaining weight β B ∈ (0, 1) and sellers’ bargaining weight β S ≡ 1 − β B . All trading prices must fall within the interval [ρS (0) , ρB (1)], where ρS (0) is the lowest dynamic type of active sellers and ρB (1) is the highest dynamic type of active buyers. In this full information context, one could also equivalently assume that the bargaining outcome of a matched pair is given by the generalized Nash bargaining solution with buyer’s and seller’s relative bargaining powers being β B and β S . Then the following theorem shows that, as τ → 0, the length ρB (1) − ρS (0) converges to 0 at the linear rate in τ .40 40 Like in Theorem 7, the upper bound provided in Theorem 8 converges to the lower bound as r gets small relative to κ ≡ min{κB , κS }. It indicates that our bounds are tight at least when the discount rate is small relative to the search costs. 91 Chapter 4. Rate of Convergence towards Perfect Competition Theorem 8 Under full information bargaining, in any nontrivial steady-state equilibrium, we have ³ r ´2 , K (ζ 0 , τ ) ≤ ρB (1) − ρS (0) ≤ K (ζ 0 , τ ) 1 + κ where ζ 0 ≡ β B κS /β S κB and κ ≡ min{κB , κS }. Proof. Step 1 : We claim that (a): κB κS ρB (1) − c̄ v − ρS (0) ≥ ≥ and (b): . ρB (1) − ρS (0) r + κB ρB (1) − ρS (0) r + κS We provide the proof for part (a) only. The proof for part (b) is the flip of that for part (a). Applying (3.20) (which is on p.58), we have Z Z κB dNS (c) dNS (c) ≤ = qB (v)(v − ρS (0)). = [v − ρS (c)] [v − ρS (0)] αB β B S S v≥ρS (c) v≥ρS (c) Thus for any v ≥ v, we have αB β B qB (v) ≥ κB /(v − ρS (0)). Then for almost all v ∈ [v, 1], ρ0B (v) = r r ≤ . r + αB β B qB (v) κB /(v − ρS (0)) Hence ρB (1) − v = Z v 1 ρ0B (v)dv ≤ r , κB /(v − ρS (0)) ρB (1) − v r ≤ , v − ρS (0) κB 1 1 v − ρS (0) κB = ≥ . r = ρB (1) − ρS (0) 1 + (ρB (1) − v)/(v − ρS (0)) 1 + κB r + κB Step 2 : We claim that r r and (b): ρB (1) − max{v, c̄} ≤ . αS β S αB β B (a): min{v, c̄} − ρS (0) ≤ Again by symmetry, we only provide a proof for (a). It is clear that qS (c) = 1 if ρS (c) ≤ min{v, c̄}. Thus, min{v, c̄} − ρS (0) = Z ρS (c)≤min{v,c̄} ρ0S (c)dc ≤ r r ≤ . r + αS β S αS β S 92 Chapter 4. Rate of Convergence towards Perfect Competition Step 3 : We claim that ρB (1) − ρS (0) ≤ min ½ κS κB , αS β S αB β B ¾µ ¶µ ¶ r r 1+ 1+ . κB κS To prove it, first notice that from step 2(a) and inequality (3.24) (see p.60), we have v − ρS (0) = min{v, c̄} − ρS (0) + max {v − c̄, 0} µ ¶ r κS κS r ≤ + = 1+ . αS β S αS β S αS β S κS Then from step 1(a), r + κB κS ρB (1) − ρS (0) ≤ (v − ρS (0)) ≤ κB αS β S µ ¶µ ¶ r r 1+ 1+ . κB κS Similarly, from step 2(b), inequality (3.24), and step 1(b), we have µ ¶µ ¶ κB r r ρB (1) − ρS (0) ≤ 1+ 1+ . αB β B κB κS Step 4 : We claim that ρB (1) − ρS (0) ≥ max ½ κS κB , αS β S αB β B ¾ . To prove it, observe that Lemma 11 (on p.58), together with Lemma 12 (p.59), implies κB ≤ αB β B (ρB (1) − ρS (0)) κS ≤ αS β S (ρB (1) − ρS (0)). Step 5 : Combine steps 3 and 4, we get ½ ¾ κS κB max ≤ ρB (1) − ρS (0) , αS β S αB β B ½ ¾µ ¶µ ¶ κS r r κB ≤ min 1+ 1+ , αS β S αB β B κB κS ½ ¾³ κS r ´2 κB 1+ ≤ min , . αS β S αB β B κ (4.2) From Lemma 4 (see p.26) we have ½ ½ ¾ ¾ κS κS κB κB min , , ≤ K (ζ 0 , τ ) ≤ max . αS β S αB β B αS β S αB β B 93 Chapter 4. Rate of Convergence towards Perfect Competition Combine the above two results, we obtain the theorem. As a by-product of the above proof, we also obtain upper and lower bounds for the equilibrium buyer-seller ratio ζ. These bounds do not depend on τ , which implies that ζ is O (1) as τ → 0. Corollary 9 Under full information bargaining, in any nontrivial steady-state equilibrium, we have ³ ³ r ´−2 r ´2 ≤ ζ ≤ ζ0 · 1 + ζ0 · 1 + κ κ where ζ 0 ≡ β B κS /β S κB and κ ≡ min{κB , κS }. Proof. From (4.2) we have r ´2 κB ³ κS 1+ ≤ αS β S αB β B κ and κS ³ κB r ´2 ≤ . 1+ αB β B αS β S κ Recall that αS /αB = ζ. Then we get the result by simple rearranging of terms. Corollary 10 Under full information bargaining, for any sequence of nontrivial steadystate equilibria parametrized by τ such that τ → 0, the proposing interval [ρSτ (0) , ρBτ (1)] collapses to the Walrasian price {p∗ } at no-slower-than-linear convergence rate. More precisely, ³ r ´2 . max {|ρSτ (0) − p∗ | , |ρBτ (1) − p∗ |} < K (ζ 0 , τ ) 1 + κ Proof. Recall from Lemma 13 (on p.59) that ρS (0) < p∗ < ρB (1). Then the result is a straight implication of Theorem 8. 4.4 Rate of convergence of welfare In this section, we turn to the rate of convergence of welfare. We will consider both the private information model and the full information model in a unified way. 94 Chapter 4. Rate of Convergence towards Perfect Competition Recall that the lifetime payoﬀ of a particular new-born type v buyer (type c seller) is denoted as WB (v) (WS (c)). To provide a benchmark for our results, we define their Walrasian counterparts in the usual manner, as WB∗ (v) ≡ max{v − p∗ , 0}, WS∗ (c) ≡ max{p∗ − c, 0}. Recall that we generally define (on p.67) the measure of aggregate welfare W as the aggregate lifetime payoﬀs of a cohort: W ≡ bWBea + sWSea (4.3) where WBea (WSea ) is a buyer’s (seller’s) ex-ante utility, i.e. Z ea WB ≡ WB (v)dF (v), WSea ≡ Z WS (c)dG(c). The Walrasian counterpart of W is: Z 1 Z ∗ ∗ W ≡b (v − p ) dF (v) + s p∗ 0 p∗ (p∗ − c) dG (c) . The following lemma shows that, in either the private or full information model, every trader’s interim lifetime utility converges no slower than the length of responding interval ρB (1) − ρS (0). Lemma 15 In either the private or full information model, and in any nontrivial steadystate equilibrium, we have |WB∗ (v) − WB (v)| ≤ ρB (1) − ρS (0) and |WS∗ (c) − WS (c)| ≤ ρB (1) − ρS (0), for any v, c ∈ [0, 1]. Proof. We will only prove the result for buyers. That for sellers can be proved by a symmetric argument. Recall that if v ≥ v then WB (v) = v − ρB (v); and if v < v then 95 Chapter 4. Rate of Convergence towards Perfect Competition WB (v) = 0. Consequently, WB∗ (v) − WB (v) = max{v − p∗ , 0} − WB (v) ⎧ ⎪ ρB (v) − p∗ if v ≥ p∗ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ρ (v) − v if v < p∗ B = ⎪ ⎪ v − p∗ if v ≥ p∗ ⎪ ⎪ ⎪ ⎪ ⎩ 0 if v < p∗ and v ≥ v and v ≥ v . and v < v and v < v In any of the four cases, we must have |WB∗ (v) − WB (v)| < ρB (1) − ρS (0). It is obvious for the fourth case. For the other three cases, recall Lemma 2 and Lemma 3 in Section 2.4, Lemma 12 and 13 in Subsection 3.3.2, and the monotonicity of ρB in both models. We can see that (i) p∗ ∈ [ρS (0) , ρB (1)], (ii) ρB (v) ∈ [ρS (0) , ρB (1)] under the conditions of the first and second cases, and (iii) v ∈ [ρS (0) , ρB (1)] under the conditions of the second or third cases. Combine Lemma 15, Theorem 7 and Theorem 8, we obtain the following rate of convergence theorem for interim lifetime utilities. Theorem 9 (Rate of convergence for interim lifetime utilities) Fix (r, κB , κS ) À 0. Then the interim lifetime utilities WBτ (v), WSτ (c) converge to their Walrasian counterparts WB∗ (v) and WS∗ (c) at least as fast as linear rate, as τ → 0. More precisely, for all v, c ∈ [0, 1], we have ¶ µ 2r 3 max {|WB∗ (v) − WBτ (v)| , |WS∗ (c) − WSτ (c)|} ≤ K (ζ 0 , τ ) 1 + κ for both the private information model and the full information model. Remark 4 In Theorem 9, absolute values for both WB∗ (v) − WBτ (v) and WS∗ (c) − WSτ (c) are needed because they are not guaranteed to be positive. Indeed, if v τ < p∗ , then buyers with type v ∈ (v τ , p∗ ] would have strictly positive utilities in equilibrium but have 0 Walrasian utilities. Furthermore, we have not precluded the possibility that some interim utility converges at a faster-than-linear rate. It is because we do not have a positive lower bound for 1 τ |WB∗ (v) − WBτ (v)| and 1 τ |WS∗ (c) − WSτ (c)|. Indeed, for some types v, we could have WB∗ (v) = WBτ (v) = 0. 96 Chapter 4. Rate of Convergence towards Perfect Competition Our baseline model assumes a random-proposer take-it-or-leave-it bargaining game. But the treatment can be straightforwardly extended to any bargaining protocol as long as traders’ types are private information and attention is still restricted to steady state. In particular Lemma 1 (on p.16) holds for the double auction bargaining protocol as well, although, as shown later, our convergence results fail for arbitrary protocol. We now show that no bargaining mechanism can generate the (steady-state) aggregate welfare W converging at a faster than linear rate in τ , regardless of whether information is full or private. Any bargaining game played in each meeting results in a trading probability q (v, c) ∈ [0, 1] and expected payment t (v, c) from the buyer to the seller, as functions of traders’ types. In steady-state equilibrium, the bargaining outcomes q and t are unchanged over time. Then, contingent on entry, buyers’ and sellers’ lifetime payoﬀ WB and WS are given by the following Bellman equations: rWB (v) = αB (ζ)[qB (v)v − tB (v) − qB (v) WB (v)] − κB rWS (c) = αS (ζ)[tS (c) − qS (c) c − qS (c) WS (c)] − κS where Z Z dNS (c) dNB (v) , qS (c) ≡ q(v, c) , qB (v) ≡ q(v, c) S B Z Z dNS (c) dNB (v) , tS (c) ≡ t(v, c) . tB (v) ≡ t(v, c) S B The functions qB (v) and qB (c) are, as before, the trading probabilities in a given meeting conditional only on traders’ own types; tB (v), tS (c) are the expected payments conditional only on own types. Given the bargaining mechanism, the entry of traders is voluntary. We assume the entry of every trader is a one-time decision: once being born, every trader can choose either to stay away from the market forever (in which case his payoﬀ is 0), or to stay in the market until he trades successfully. In steady state this restriction is not binding. Let χB (v) and χS (c) be the buyers’ and sellers’ entry probabilities respectively. From the above Bellman equations, we can write WB (v) = χB (v) · αB (ζ)[qB (v)v − tB (v)] − κB r + αB (ζ)qB (v) (4.4) 97 Chapter 4. Rate of Convergence towards Perfect Competition WS (c) = χS (c) · αS (ζ)[tS (c) − qS (c) c] − κS . r + αS (ζ)qS (c) (4.5) Individual rationality requires that WB (v) ≥ 0 and WS (c) ≥ 0 for all v, c ∈ [0, 1]. Equivalently, individual rationality requires αB [qB (v)v − tB (v)] ≥ κB if χB (v) > 0, αS [tS (c) − qS (c)c] ≥ κS if (4.6) χS (c) > 0. The steady-state equations for market distributions NB and NS are maintained as before. We now prove that no individually rational bargaining mechanism can have a fasterthan-linear rate of convergence for the steady-state welfare W , by establishing an explicit lower bound on W ∗ − W . Theorem 10 For any individually rational bargaining protocol, in steady-state equilibrium we have W ∗ − W ≥ μ · min K (ζ, τ ) , (4.7) ζ>0 where μ is the equilibrium mass of buyers (or sellers) who enter the market per unit time. Proof. Rewrite the Walrasian welfare level W ∗ : Z 1 Z p∗ ∗ ∗ (v − p )dF (v) + s (p∗ − c)dG(c) W = b 0 p∗ ⎧ R R ⎪ ⎪ b χB (v)vdF (v) − s χS (c)cdG(c) ⎪ ⎨ R R = max (v)dF (v) = s χS (c)dG(c), s.t. b χ B χB ,χS ⎪ ⎪ ⎪ ⎩ 0 ≤ χ (v) ≤ 1, 0 ≤ χS (c) ≤ 1 B ⎫ ⎪ ⎪ ⎪ ⎬ ⎪ ⎪ ⎪ ⎭ . (4.8) On the other hand, the equilibrium welfare level W for any individually rational bargaining mechanism can be bounded as follows. For any active buyer type v (i.e. χB (v) 6= 0), individual rationality requires αB [qB (v)v − tB (v)] ≥ κB . Hence, from (4.4) we have αB [qB (v)v − tB (v)] − κB αB qB (v) ∙ ¸ tB (v) κB = χB (v) · v − − . αB qB (v) qB (v) WB (v) ≤ χB (v) · 98 Chapter 4. Rate of Convergence towards Perfect Competition Similarly for sellers: ∙ WS (c) ≤ χS (c) · −c − ¸ tS (c) κS + . αS qS (c) qS (c) Substituting these bounds into the definition (4.3), Z Z W ≤ b χB (v)vdF (v) − s χS (c)cdG(c) Z Z κB κS −b χB (v) dF (v) − s χS (c) dG(c) αB αS Z Z tB (v) tS (c) −b χB (v) dF (v) + s χS (c) dG(c). qB (v) qS (c) (4.9) (In the second line, we have used qB (v) ≤ 1 and qS (c) ≤ 1.) In view of (4.8), the terms in the first line of the right hand side do not exceed the Walrasian surplus W ∗ . Also, since the steady-state condition implies that bχB (v)dF (v) = αB qB (v)dNB (v) for buyers and sχS (c)dG(c) = αS qS (c)dNS (c) for sellers, and the transfers are balanced, Z Z dNB (v) dNS (c) = tS (c) , tB (v) B S the last line in (4.9) is 0. Taking all these into account, we have Z Z κB κS ∗ χB (v)dF (v) − s χS (c)dG(c) W ≤W −b αB αS and therefore ∗ W −W ≥ where μ≡b Z µ κB κS + αB αS χB (v)dF (v) = s Z ¶ μ, χS (c)dG(c) is the equilibrium mass of buyers (or sellers) who enter the market per unit time. Furthermore, κB κS + = K (ζ, τ ) ≥ min K (ζ, τ ) . ζ>0 αB (ζ, τ ) αS (ζ, τ ) The inequality (4.7) follows. As τ → 0, we must have μτ → sG (p∗ ) whenever Wτ → W ∗ . We therefore have the following corollary. 99 Chapter 4. Rate of Convergence towards Perfect Competition Corollary 11 No individually rational bargaining mechanism can attain a faster-thanlinear convergence rate for the traders’ aggregate welfare level Wτ as τ → 0. Remark 5 Since Theorem 10 does not require incentive compatibility, it in particular implies that even with full information, as in Mortensen and Wright (2002), convergence cannot be faster than linear. Remark 6 Theorem 9 and Theorem 10 together imply that the traders’ aggregate welfare level Wτ , in either the private or full information model, converges to W ∗ at exactly linear rate as τ tends to 0. It follows that the random-proposer bargaining mechanism attains the fastest possible convergence towards the first best (i.e. Walrasian welfare level), independent of the information structure of bargaining. The intuition for why no other bargaining mechanism can attain a faster rate for welfare is that matching delays will still be present regardless of the eﬃciency of bargaining. Even if only the buyers with v ≥ p∗ and sellers with c ≤ p∗ enter and always trade to full eﬃciency, there still will be welfare loss at rate τ because of costly search (and discounting), since the expected time between matches is proportional to τ . This might motivate one to separate the welfare loss into the loss directly due to delay and search costs, and the loss indirectly due to equilibrium behaviors. More precisely, let us explicitly think of buyers’ lifetime utility as functions of σ B ≡ (χB , qB , tB ) and (r, κB ): ŴB (v; σ B ; r, κB ) ≡ χB (v) · αB [qB (v)v − tB (v)] − κB . r + αB qB (v) And similarly for sellers, ŴS (c; σ S ; r, κS ) ≡ χS (c) · αS [tS (c) − qS (c)c] − κS . r + αS qS (c) Obviously ŴB (·; σ B ; r, κB ) and ŴS (·; σ S ; r, κS ) become the Walrasian counterparts WB∗ and WS∗ when (i) (r, κB , κS ) = 0, and (ii) σ B and σ S are at their Walrasian values, i.e. χB (v) = I [v ≥ p∗ ] , χS (c) = I [c ≤ p∗ ] 100 Chapter 4. Rate of Convergence towards Perfect Competition where I [·] is 1 if the condition inside the bracket holds, and is 0 otherwise; and for all v ≥ p∗ and all c ≤ p∗ , qB (v) = qS (c) = 1, tB (v) = tS (c) = p∗ . Then we can define the welfare loss indirectly due to equilibrium behaviors as Z h Z h i i ∗ b WB (v) − ŴB (v; σ B ; 0, 0) dF (v) + s WS∗ (c) − ŴS (c; σ S ; 0, 0) dG(c), and define the welfare loss directly due to delay and search costs as Z h i b ŴB (v; σ B ; 0, 0) − ŴB (v; σ B ; r, κB ) dF (v) Z h i +s ŴS (c; σ S ; 0, 0) − ŴS (c; σ S ; r, κS ) dG(c). The driving force of Theorem 10 is that the direct part is O (τ ), for any bargaining protocol. However the indirect part could vanish at a faster-than-linear rate. To see this, notice that this indirect part can be simplified as Z Z ∗ b [I (v ≥ p ) − χB (v)] vdF (v) − s [I (c ≤ p∗ ) − χS (c)] cdG(c). Under random-proposer bargaining (or any other protocol with private information), the entry strategies must be cutoﬀ strategies, i.e. χB (v) = I [v ≥ v] and χS (c) = I [c ≤ c̄]. Hence the indirect loss is simply the familiar deadweight loss triangle: Z p∗ Z v vdF (v) − s cdG(c). b p∗ c̄ It is easy to see that in our baseline model (i.e. random-proposer bargaining with private information), along a sequence of full-trade equilibria with τ → 0, this indirect welfare loss vanishes at quadratic rate in τ , because the entry gap v − c̄ vanishes at linear rate.41 4.5 Results for k-double auction We have seen that the rate of convergence results for our baseline model are robust to other information structure of bargaining. In this section, we are interested in whether our 41 It is not hard to verify that this is also true for our full information model. 101 Chapter 4. Rate of Convergence towards Perfect Competition results are robust to other bargaining protocol. Although we have not been able to prove a general theorem in this direction, we have a theorem showing that another well-studied trading mechanism, the double auction, does not have robust convergence properties. In other words, some sequences of equilibria do not converge to perfect competition. Recall the rules of the bilateral k-double auction introduced by Chatterjee and Samuelson (1983): once a meeting occurs, the buyer and the seller simultaneously and independently submit a bid price pB and an ask price pS respectively, and then trade occurs if and only if the buyer’s bid is at least as high as the seller’s ask, at the weighted average price (1 − k)pS + kpB , where k ∈ (0, 1). As in the baseline model, we assume that the buyer and the seller do not observe each other’s type during the bargaining. We maintain the notation as before up to a bit reinterpretations. The functions pB (v) and pS (c) are now the strategies of submitting bids and asks respectively. There is no responding strategy under double auction, but ρB (v) and ρS (c) are still buyers’ and sellers’ reservation prices, and also called dynamic types. The definition for nontrivial steady-state equilibria can be obtained as a straightforward revision from the baseline (random-proposer) case. Furthermore, Lemma 1 (on p.16) still holds here. The proof goes through almost word-by-word, with the trading probability function replaced with qB (v) ≡ Z pS (c)≤pB (v) dNS (c) S and the expected payment function replaced with Z dNS (c) tB (v) ≡ . [kpB (v) + (1 − k)pS (c)] S pS (c)≤pB (v) In this k-double auction model, as in the baseline model, a nontrivial steady-state equilibrium could be either full-trade or non-full-trade. We claim that the full-trade class of double auction equilibria includes equilibria that are very ineﬃcient, even with arbitrarily small frictions. (But at the same time, this class also includes equilibria that converge to perfect competition.) The set of full-trade equilibria is even easier to characterize for the double auction model. In particular, from Lemma 1, the sets of active buyers’ and sellers’ types are still 102 Chapter 4. Rate of Convergence towards Perfect Competition intervals [v, 1] and [0, c̄] for some marginal types v and c̄; and we also have ρB (v) < v and ρS (c) > c for all v > v and all c < c̄. Since all active traders’ trading probabilities are strictly positive, they must in equilibrium submit serious bids/asks, and therefore, we must have pB (v) ≤ ρB (v) < v and pS (c) ≥ ρS (c) > c for all v > v and all c < c̄. Now it is clear that for an equilibrium to be full-trade, we must have c̄ ≤ v, and all traders submit a common bid/ask p and hence every matched pair trades at the price p. Furthermore, the marginal entrants (i.e. type v buyers and type c̄ sellers) have to recover their search costs, thus in any full-trade equilibrium we have c̄ < p < v for some p ∈ (0, 1). Any full-trade equilibrium for the double auction model must satisfy the following marginal type equations and inflow balance equation: αB (ζ, τ ) (v − p) = κB , (4.10) αS (ζ, τ ) (p − c̄) = κS , (4.11) b[1 − F (v)] = sG (c̄) . (4.12) Unlike in the baseline model, it is easy to see that the converse is also true, i.e. any quadruple {p, ζ, v, c̄} satisfying (4.10), (4.11), (4.12) and K (ζ, τ ) < 1 must characterize a full-trade equilibrium. In particular, any trader’s best-response bid/ask strategy is p, given that all other active traders submit p.42 From equations (4.10) and (4.11), it follows that the entry gap is v − c̄ = K (ζ, τ ) . (4.13) The next proposition shows that v − c̄ can be arbitrarily close to 1 for all τ (such that an equilibrium exists), so that the equilibrium outcomes can be arbitrarily far from eﬃciency even with small frictions. The set of equilibrium entry gaps converges to the full-range (0, 1) as frictions disappear, so the set of full-trade equilibria ranges from the perfectly competitive one to the almost perfectly ineﬃcient ones. Moreover, the set of equilibrium prices also converges to the full-range (0, 1) as frictions disappear. Thus indeterminacy 42 Clearly, equations (4.10)-(4.12) still characterize a full-trade equilibrium even if we assume full informa- tion double auction bargaining. 103 Chapter 4. Rate of Convergence towards Perfect Competition K (ζ ,τ ) v, c 1 sG (c ) v ζ b[1 − F (v)] c ζ1 ζ ζ ζ0 sG (c ) Figure 4.1: Construction of a double auction full-trade equilibrium grows rather than vanishes with competition, contrary to the results in the static double auction literature. Theorem 11 Under double auction, a full-trade equilibrium exists if and only if min K (ζ, τ ) < 1. ζ>0 (4.14) The set of equilibrium values of v−c̄ in full-trade equilibria is an interval [minζ>0 K (ζ, τ ) , 1). As τ → 0, this set and the set of equilibrium prices converge to (0, 1). In particular, there exist sequences of full-trade equilibria that converges to perfect competition, and also sequences that do not converge. Proof. The proof follows the graphical argument shown in Figure 4.1. Given τ , the right panel shows the marginal types v and c̄ in a steady-state equilibrium. The left panel shows the supportable values of buyer-seller ratio ζ and ζ̄ that correspond to the given entry gap v − c̄ < 1. (In general, there can be one, two or more such values.) Fix any τ > 0. Our assumption M (0, S; τ ) = M (B, 0; τ ) = 0 implies αB (∞, τ ) = 104 Chapter 4. Rate of Convergence towards Perfect Competition αS (0, τ ) = 0. It in turn implies lim K (ζ, τ ) = lim K (ζ, τ ) = ∞, ζ→0 ζ→∞ (4.15) as depicted in the left panel. Given that (4.15) holds, a solution ζ to the equation K (ζ, τ ) = v − c̄ exists if and only if v − c̄ ∈ [minζ>0 K (ζ, τ ) , 1). Since limτ →0 K (ζ, τ ) = 0 for any ζ > 0, we also must have minζ>0 K (ζ, τ ) → 0 as τ → 0. It proves that the set of supportable values of entry gap v − c̄ converges to the interval (0, 1). Now fix any τ such that minζ>0 K (ζ, τ ) < 1. Consider the longest interval [ζ 0 , ζ 1 ] such that K (ζ 0 , τ ) = K (ζ 1 , τ ) = 1 and K (ζ, τ ) < 1 for ζ ∈ (ζ 0 , ζ 1 ). For any ζ ∈ (ζ 0 , ζ 1 ), v and c̄ can be found uniquely from (4.13) and (4.12) (graphically shown in Figure 4.1). Denote v τ (ζ) and c̄τ (ζ) as the results. The equilibrium price p can also be found uniquely from equation (4.10) or equation (4.11): κS αS (ζ, τ ) κB ( = vτ (ζ) − ). αB (ζ, τ ) pτ (ζ) ≡ c̄τ (ζ) + (4.16) (4.17) This formally defines a continuous mapping pτ (·) of [ζ 0 , ζ 1 ] into R+ . Consequently, its image is a closed interval that contains the points p (ζ 0 ) and p (ζ 1 ); and the set of supportable equilibrium price contains this interval. The definitions of ζ 0 and ζ 1 imply that ζ 0 → 0 and ζ 1 → ∞ as τ → 0. Now c̄τ (ζ 1 ) = 0 for all τ and αS (ζ 1 , τ ) → ∞ as τ → 0, therefore (4.16) implies that limτ →0 pτ (ζ 1 ) = 0. Similarly, v τ (ζ 0 ) = 1 for all τ and αB (ζ 0 , τ ) → ∞ as τ → 0, so that (4.17) implies that limτ →0 pτ (ζ 0 ) = 1. It proves that the set of supportable equilibrium price converges to (0, 1). It is not hard to see that the condition minζ>0 K (ζ, τ ) < 1 is also necessary for any nontrivial steady-state equilibrium to exist. We thus have the following theorem. Theorem 12 Under double auction, there exists a nontrivial steady-state equilibrium (either full-trade or non-full-trade) if and only if min K (ζ, τ ) < 1. ζ>0 105 Chapter 4. Rate of Convergence towards Perfect Competition Proof. Having Theorem 11, it now suﬃces to claim the necessity of κB /αB (ζ, τ ) + κS /αS (ζ, τ ) < 1 for a nontrivial equilibrium to exist. Recall the notation for a general bargaining game introduced in Section 4.4. Individual rationality (4.6) implies Z Z dNB (v) dNS (c) κB ≤ [q(v, c)v − t(v, c)] , αB (ζ, τ ) B S Z Z κS dNB (v) dNS (c) ≤ [t(v, c) − q(v, c)c] , αS (ζ, τ ) B S and hence κB κS + ≤ αB (ζ, τ ) αS (ζ, τ ) Z Z (v − c) dNB (v) dNS (c) < 1. B S Remark 7 Compare the necessary and suﬃcient conditions for equilibrium existence under double auction (given by Theorem 12) and under random-proposer bargaining (given by Theorem 3 on p.37). The condition under double auction is weaker than the one under the baseline (random-proposer bargaining) model, which is K (ζ 0 , τ ) < 1. In this sense, the market is easier to open under double auction. Theorem 11 shows that the set of double-auction equilibria, even if we restrict attention to the full-trade ones, is very large. For more intuition, rewrite the first two marginal type equations of the double-auction full-trade equilibrium in a parallel way to the baseline model: αB (ζ, τ ) β DA B (v − c̄) = κB , αS (ζ, τ ) β DA S (v − c̄) = κS , where DA β DA B ≡ 1 − βS , β DA S ≡ p − c̄ . v − c̄ DA We may call β DA B and β S the buyers’ and sellers’ relative bargaining powers under double- auction full-trade equilibrium. These equations are the same as the marginal type equations (2.15) and (2.16) (on p.24) that characterize a full-trade equilibrium in our baseline model, with the only diﬀerence that the exogenous bargaining power β S is now replaced with the 106 Chapter 4. Rate of Convergence towards Perfect Competition endogenous bargaining power β DA S . (The remaining inflow balance equation is the same in both models.) If β DA S = β S , the equilibria in both models have the same marginal types v and c̄, and once these are solved for, the price p is uniquely determined from the equation = β S , or equivalently p = c̄ + (v − c̄) β S . In other words, to any β S ∈ (0, 1) there β DA S corresponds a double-auction full-trade equilibrium with β DA S = β S and the same marginal types v and c̄ as in the random-proposer full-trade equilibrium candidate. can be arThe above discussion has the following two implications. First, since β DA S bitrary, in the double auction model, there is a great multiplicity of equilibria.43 Second, since we know that full-trade equilibria of the baseline model converge in terms of welfare level at the linear rate, it follows immediately that there is a sequence of double-auction equilibria that also converges at the linear rate to perfect competition. We state this finding as a corollary. Corollary 12 As τ → 0, there are double-auction full-trade equilibria that converge, in terms of welfare level, at the linear rate in τ . Remark 8 The logic of Theorem 12 and Corollary 12 has nothing to do with the assumption of private information bargaining. They hold equally well if every pair of buyer and seller bids and asks knowing each other’s type, because all they need to know is only the equilibrium price p. The above discussion explains why double auction full-trade equilibria can have nonWalrasian limit while it cannot be the case in our baseline model. But Figure 4.1 and the logic in the proof of Theorem 11 also make it clear that for the double auction full-trade equilibria to be non-convergent to the Walrasian outcome, we have to let the bargaining power of one side vanish (i.e. either v −p → 0 or p− c̄ → 0 as τ → 0) and also let the market become extremely unbalanced (i.e. either ζ → 0 or ζ → ∞ as τ → 0). One might wonder if all equilibria (e.g. non-full-trade) will converge to the Walrasian outcome if we preclude 43 The nature of indeterminacy here is analogous to that in the Nash demand game. As is well-known, the outcome of double auction is highly indeterminate even when information is complete. 107 Chapter 4. Rate of Convergence towards Perfect Competition 1 p pB (v ) pS (c ) p* p 0 ĉ c p* v v̂ 1 c, v Figure 4.2: A two-step equilibrium under double auction that class of equilibria (which is perhaps a natural restriction on equilibrium selection). It turns out that this is not so, as we show next. We construct a non-full-trade equilibrium of the following nature (see Figure 4.2). There are two seller cutoﬀ types ĉ ∈ (0, 1) and c̄ ∈ (0, 1) with ĉ < c̄, and two buyer cutoﬀ types v̂ ∈ (0, 1) and v ∈ (0, 1) with v̂ > v. The sellers with c ∈ [0, ĉ) enter and submit pS (c) = p, where p is some constant strictly below the Walrasian price p∗ . The sellers with c ∈ [ĉ, c̄] enter and submit pS (c) = p̄, where p̄ > p∗ . The sellers with c ∈ (c̄, 1] do not enter. Similarly, the buyers with v ∈ (v̂, 1] enter and submit p̄, the buyers with v ∈ [v, v̂] enter and submit p, and the buyers with v ∈ [0, v) do not enter. We call the equilibria of this kind two-step equilibria. The following theorem gives our non-convergence result for the two-step (non-full-trade) equilibria.44 Theorem 13 For any constant a ∈ (0, 1), there exist r0 > 0, τ 0 > 0 and W̄ < W ∗ such that for all r ∈ (0, r0 ) and τ ∈ (0, τ 0 ), there exists a two-step equilibrium in which the price 44 As a by-product, we also prove the existence of non-full-trade equilibrium for small τ and r. 108 Chapter 4. Rate of Convergence towards Perfect Competition spread is larger than a, i.e. p̄ − p > a, and the welfare level is lower than W̄ , i.e. W < W̄ . Proof. We derive a system of equations characterizing the set of two-step equilibria. But before doing so, it is convenient to introduce some notations. In a two-price equilibrium, the buyers with v > v̂ who submit the high bid price p̄, trade with any seller they meet. Buyers with v ∈ [v, v̂], who submit the low bid price p, trade only with those sellers with c < ĉ, who submit p; their probability of trading is equal to NS (ĉ)/S. Similarly sellers with c < ĉ trade with any buyer they meet, and sellers with c ∈ [ĉ, c̄] trade only with those buyers with v > v̂; their probability of trading is equal to 1 − NB (v̂)/B. In our constructed equilibria NS (ĉ)/S and 1 − NB (v̂)/B will converge to 0 as τ goes to 0, so it is convenient to divide them by τ : ∙ ¸ 1 NB (v̂) λB ≡ 1− , τ B λS ≡ 1 NS (ĉ) . τ S Since type v buyers and type c̄ sellers are indiﬀerent between entering or not, we have αB τ λS (v − p) = κB (4.18) αS τ λB (p̄ − c̄) = κS . (4.19) Since type v̂ buyers are indiﬀerent between biding p or p̄, and type ĉ sellers are indiﬀerent between asking p or p̄, we have © ª τ λS [ρB (v̂) − p] = τ λS ρB (v̂) − [(1 − k)p + kp̄] + (1 − τ λS ) [ρB (v̂) − p̄] ª © τ λB [p̄ − ρS (ĉ)] = τ λB [(1 − k)p + k p̄] − ρS (ĉ) + (1 − τ λB ) [p − ρS (ĉ)]. (4.20) (4.21) Since Lemma 1 still hold here, we have ŴB = (v̂ − v) m̃ (ζ) λS ζr + m̃ (ζ) λS (4.22) ŴS = (c̄ − ĉ) m̃ (ζ) λB . r + m̃ (ζ) λB (4.23) where we denoted m̃(ζ) ≡ M̃ (ζ, 1), ŴB ≡ WB (v̂) and ŴS ≡ WS (ĉ). 109 Chapter 4. Rate of Convergence towards Perfect Competition To complete the description of the two-step equilibrium, the indiﬀerence conditions are supplemented with steady-state inflow balance conditions for each interval of types. Here, it suﬃces to require that the total inflows into the intervals [v, 1] and [0, c̄] are balanced with outflows, b [1 − F (v)] = S m̃(ζ) [λS + λB (1 − τ λS )] , (4.24) sG(c̄) = S m̃(ζ) [λB + λS (1 − τ λB )] (4.25) and that the inflows into the intervals v ∈ [v̂, 1] and [0, ĉ] are also balanced with outflows, b[1 − F (v̂)] = S m̃(ζ)λB , (4.26) sG(ĉ) = S m̃(ζ)λS . (4.27) (Observe that the matching rate is S m̃ (ζ) /τ for both buyers and sellers, and that τ cancels out.) We also define the price spread, a0 ≡ p̄ − p. Then equations (4.18) through (4.27) form a 10-equation system with 12 endogenous variables {p, a0 , ζ, v, c̄, v̂, ĉ, λB , λS , S, ŴB , ŴS }. This system does characterize an equilibrium. Indeed, one can easily see that buyers with v ∈ (v̂, 1] strictly prefer to bid p̄, buyers with v ∈ (v, v̂) strictly prefer to bid p, and buyers with v ∈ [0, v) strictly prefer not to enter. Similar remark applies for sellers. Since we have two degrees of freedom, we can fix some ζ > 0 and a0 ∈ (a, 1) and then let equations (4.18) - (4.27) determine {p, v, c̄, v̂, ĉ, λB , λS , S, ŴB , ŴS }. We claim that solution exists for small enough τ and r. To see this, one can check that when τ = r = 0, we have a (unique) solution with p implicitly determined by b[1 − F (p + a0 )] = sG(p), and all other variables given by c̄ = p, v = p̄ = p + a0 , λB = S= κS κB ζ , λS = , m̃(ζ)a0 m̃(ζ)a0 G(p)κB ζ sG(p)a0 [1 − F (p̄)]κS , 1 − F (v̂) = , G(ĉ) = , κB ζ + κS κB ζ + κS κB ζ + κS 110 Chapter 4. Rate of Convergence towards Perfect Competition ŴB = v̂ − p̄, ŴS = p − ĉ. One can also check that the Jacobian evaluated at τ = r = 0 is not zero.45 Therefore the Implicit Function Theorem applies. Because p̄ − p ≡ a0 > a, there exists a two-step equilibrium with p̄ − p > a when τ and r are small enough. Moreover, since v → p̄ and c̄ → p as (τ , r) → (0, 0), the spread v − c̄ is also bounded below by a. It follows that the associated welfare W is bounded away from the Walrasian welfare W ∗ . Unlike Theorem 11, the construction in the proof of Theorem 13 treats buyers and sellers symmetrically. In particular, ζ could be fixed at any value. Then why does the double auction mechanism has non-Walrasian limit equilibria while the random-proposer mechanism does not?46 One can verify that the dynamic types do collapse to singletons even in the two-step non-convergent equilibria. Thus to fix the idea, let us simply suppose the discount rate r is 0 so that the ultimate trading probabilities are 1 and therefore the dynamic types are constant and equal to ρS = c̄ → p and ρB = v → p̄. Also suppose τ is very small. Then all buyers have dynamic types approximately p̄ and all sellers have dynamic types approximately p. Unlike under random-proposer bargaining, the dynamic types are no longer the acceptance levels. Eﬀectively the bids/asks also play this role. A seller submitting an ask lower than the dynamic types of all buyers does not guarantee herself a successful trade. To guarantee a trade, she has to ask lower than all buyers’ bids. Consider a seller with c < ĉ. This seller’s equilibrium ask price is p. She realizes fully that the buyer’s dynamic willingness-to-pay is always p̄ approximately, and would like to demand that much if acceptance is guaranteed, as it would be under the random-proposer bargaining. However, demanding that much under the double auction protocol runs into the risk of being countered with the buyer’s bid of p, resulting in no trade. In our equilibrium with τ small, most of the active buyers bid p. Weighing these trade-oﬀs carefully, the seller 45 The Mathematica R ° notebook that contains the evaluation of the Jacobian is available at http://grad.econ.ubc.ca/adamwong. 46 Note that the non-convergent sequence constructed in the proof of Theorem 13 does not converge to the trivial no-trade equilibrium. Indeed, as revealed in the proof, when r is small and τ tends to 0, both the entry levels and steady-state stocks of buyers and sellers do not go to 0. 111 Chapter 4. Rate of Convergence towards Perfect Competition decides to submit p rather than p̄. Similar logic applies to the buyers. Now consider a seller with c = p + ε where ε > 0 is small. Although her type (or dynamic type) is significantly lower than buyers’ dynamic types, which is p̄ approximately, she chooses not to enter even when the expected search costs incurred to obtain a meeting is very small as τ becomes very small. It is again because most of the active buyers bid p, making her prospect of trade meager. Similar logic applies to the buyers. Finally, to complete our logic, we explain why the fraction of active buyers bidding p is very high relative to the fraction bidding p̄. It is because, in our equilibrium, buyers bidding p can only trade with those sellers asking p, which makes their outflow rate tiny. On the other hand, buyers bidding p̄ trade in any meeting. Thus in steady state, the buyers who bid p accumulate and dominate the buyers’ side of the market. Similar logic applies to the sellers. These arguments together explain why marginal traders do not enter to quest the significant size of the unexploited surplus v − c̄, keeping a positive gap between v and c̄. The rules of the double auction do not provide a tight connection between the dynamic types and actual acceptance levels as would be the case under the random-proposer bargaining. Here, a bid/ask is both an oﬀer and an acceptance level. On the other hand, under random-proposer bargaining, proposing strategies and responding strategies are separate decisions because traders are clear about who is proposer and who is responder. Ex-post, the bargaining power is given to one party, and thus well-defined. Therefore the responder is always held to her acceptance level, which creates strong incentive to enter. Ex-ante, both parties could have the full bargaining power. Therefore the incentives to enter are evenly distributed over both sides of the market, driving the marginal entering types close to each other and to the Walrasian price, and leading to rapid convergence. 4.6 Concluding remarks This chapter studies the equilibrium convergence properties of a decentralized dynamic matching and bargaining market, as search frictions vanish. The literature on dynamic matching and bargaining games has concentrated on whether the game-theoretic equilib112 Chapter 4. Rate of Convergence towards Perfect Competition rium outcome converges to the perfect competition. Although other papers (as reviewed in Chapter 1) have shown convergence in the contexts of similar models (for the sake of providing foundation of Walrasian equilibrium), this chapter has fundamental contributions on top of the literature. First, we not only prove the convergence, but also derive the rate of convergence, for our baseline model in which the decentralized bargaining is under two-sided private information and the random-proposer take-it-or-leave-it protocol. Second, we show that the market with such a simple bargaining protocol has the property that equilibrium welfare converges to the Walrasian (first best) welfare at the fastest possible rate among all bargaining protocols. Although we have not been able to characterize the most eﬃcient bargaining mechanism for our decentralized market, our result can be interpreted to be an asymptotic eﬃciency result. Third, we show that the information structure of bargaining does not alter the convergence and its speed, but the convergence might fail if we assume another bargaining protocol, double auction. It suggests that information structure is not essential to the asymptotic eﬃciency of a dynamic matching and bargaining market, but the bargaining protocol might. Before closing this chapter, we make two remarks. Our first remark is a caveat on our non-convergence results for the double auction model. Under double auction, there is a great deal of multiplicity of equilibria, and some sequences of equilibria do converge to perfect competition. Also, the non-convergent equilibria we have constructed might be rather special. Our possible approach to address this is to impose additional assumptions on equilibrium selection (e.g. continuity of strategies and boundedness of the ratio of buyers to sellers) with the purpose of proving convergence. Secondly, as we point out in Remark 2, we can think of frictions as the "cost of delay", i.e. the discount rate r and the search costs κB and κS , as we did in the previous two chapters. Then Theorem 7 (for private information bargaining) and Theorem 8 (for full information bargaining) imply that market equilibria converge to perfect competition as the friction profile (r, κB , κS ) tends to zero proportionally. But what if (r, κB , κS ) tends to zero non-proportionally? 113 Chapter 4. Rate of Convergence towards Perfect Competition It might be natural that the search costs (κB , κS ) would vanish slower than the discount rate r. Let us discuss in the language of a discrete time model, so that the matching among the market participants occurs once per period; and the discount rate and search costs are measured per period. Then as the period length is shortened (in other words matches are made more frequently), the discount rate per period would decrease at the same rate as the period length. But the search costs per period might decrease at a slower rate, reflecting that making matches more frequently is costly. It is easy to see from our theorems that, as friction profile (r, κB , κS ) tends to 0, convergence (for the baseline model) holds as long as the search costs (κB , κS ) vanish not faster than the discount rate r. As a matter of fact, convergence holds even when the vanishing of (κB , κS ) is mildly faster. To be more concrete, let us say κB = κS = rθ for some θ > 0. Then Theorem 7 implies that, for private information bargaining, convergence holds if θ < 32 ; while Theorem 8 implies that, for full information bargaining, convergence holds if θ < 2. Finally, what if the vanishing of (κB , κS ) is much faster? Is there a "uniform convergence" result? This is still an open question. 114 Chapter 5 Conclusion 5.1 Summary This dissertation studies a decentralized market with frictions (e.g. labor market, housing market). In the market, which we call a dynamic matching market, there are a large number of traders and the trading decisions and prices are determined by countless bilateral negotiations. More precisely, we model our market as a steady-state dynamic matching and bargaining game. The bargaining games are always bilateral, i.e. between a buyer and a seller; and each bargainer holds private information about his own willingness-to-pay or cost of providing the good. The main purpose of Chapter 2 is to prove the existence of equilibrium for our baseline model, and to understand the equilibrium patterns and properties, under diﬀerent combinations of frictions. While the results in this chapter are interesting on their own right, they are also the foundation of the analyses of Chapter 3 and Chapter 4. Chapter 3 studies the role of private information bargaining in our baseline model. Our approach is to compare the equilibrium predictions of our baseline model (in which bargaining is under private information) with those of the full information bargaining version of the same model (i.e. Mortensen-Wright model).47 We find both qualitative similarities and diﬀerences between them. In particular, the two models have completely the same predictions if agents are perfectly patient. Besides, if agents are impatient, private information bargaining has an entry-deterring eﬀect. In other words, typically less potential 47 Part of this chapter’s contribution is that we have derived new results (most importantly the general condition for equilibrium existence) for Mortensen-Wright model. It is done by applying the techniques we developed in Chapter 2. 115 Chapter 5. Conclusion traders enter in the private information model. We also show when the private information bargaining would generate a higher level of social welfare. Unlike most works in the literature on DMBG, Chapter 2 and Chapter 3 focus on "out-of-the-limit" results (i.e. the frictions are fixed rather than vanishing). They are particularly of interest when we are concerned with those markets with significant frictions (e.g. labor market, housing market), rather than concerned with providing a foundation for the Walrasian equilibrium. The concern of Chapter 4 is convergence. However it is diﬀerent than the literature in that this chapter does not merely provide a foundation of Walrasian equilibrium based on the convergence of a DMBG, but also shows how fast the equilibrium outcome converges to the Walrasian first best outcome. In other words, this chapter studies the "asymptotic eﬃciency", in terms of the rate of convergence, of dynamic matching and bargaining markets. Our results suggest that whether there is private information in bargaining does not aﬀect the asymptotic eﬃciency, but the choice of bargaining protocol could have a significant eﬀect. 5.2 Discussions Here let us discuss which underlying assumptions we have made are crucial, and which are not. Some of the following discussions are based on conjectures. 5.2.1 Continuous time, continuous types First of all, our assumption that time is continuous does not matter. All of our results hold under the discrete time version of our model, with only minor modifications. Our assumption that types are continuous (together with strictly positive densities) should not matter in any significant way. However, if types are discrete, we have to allow mixed (or asymmetric) strategies in order to have nontrivial equilibrium. For example, the marginal entrants must be allowed to enter probabilistically (or asymmetrically). The proposing 116 Chapter 5. Conclusion strategies would probably have to be mixed (with nondegenerate support) as well.48 5.2.2 Symmetric pure strategies Although we implicitly assume that traders use symmetric pure strategies, this is merely for simplicity of exposition. At a cost in notation we could define trader-specific and mixed strategies and then prove that they must be (essentially) symmetric and pure. To see this intuitively, recall that the matching in the market is anonymous and random. Even if diﬀerent traders follow distinct strategies, every buyer with the same type v would still face the same market environment. (This is strictly true because we assume a continuum of traders.) Therefore, for a given value v, every buyer will have the identical continuation payoﬀ, implying essentially identical responding and entry strategies. Moreover, every buyer has identical best-response correspondence for proposing strategy. Lemma 2(b) still holds so that every selection from this correspondence is nondecreasing. Consequently, the bestresponse is single-valued apart from a measure zero set of values where jumps could occur. But because the set is of measure zero, the selection/mixing over that set has no consequence for the maximization problems of the other traders. The same logic applies to sellers. 5.2.3 Random-proposer bargaining If the bargaining games proceed under full information, then assuming our random-proposer bargaining protocol is equivalent to assuming the generalized Nash bargaining solution (see Subsection 3.3.1 for more details). While the Nash bargaining solution is so standard in the context of full information bargaining, there is no standard modeling method for a bilateral bargaining with two-sided private information. The tractability of our model relies on the assumption of random-proposer bargaining even under private information. Under this bargaining protocol, the signaling issue is assumed away, because the proposers directly make take-it-or-leave price oﬀers so that responders do not need to know their proposers’ types. Also, this bargaining protocol ensures 48 Gale (1987) proves convergence in a model with discrete type setting. 117 Chapter 5. Conclusion the bargaining games are one-shot. We justify our assumption of random-proposer bargaining under private information as follows. First, it is a natural generalization of the Nash bargaining solution to a private information setting. Second, it is used in some of the recent labor search literature, e.g. Kennan (2007). In addition, it is actually much less restrictive than it looks. We can allow the proposers to propose a general mechanism (which is an informed principal mechanism design problem), and shows that in equilibrium the proposers would still make take-it-orleave-it price oﬀers, as in Atakan (2008).49 5.2.4 Choice of friction space Recall that our notion of frictions includes two things: time discount rate r and search costs (κB , κS ).50 For our analyses to be interesting, we have to include both of them. If search costs are positive and there is no time discounting, as we have seen in Section 3.4, the private information in bargaining plays no role at all. Equilibrium existence and convergence can all be proved in a very simple manner. On the other hand, if search costs are zero, it is impossible to have a nontrivial steadystate equilibrium, given that entry is endogenous. The reason is that, if search costs are zero and there exists a nontrivial steady-state equilibrium, the marginal entrants (who are indiﬀerent between entering or not) must have zero probability of trade. But then these marginal entrants would accumulate and eventually clog the matching process.51,52 Assuming an exogenous death rate (or exit rate) δ as in Satterthwaite and Shneyerov (2008) can restore the nontrivial steady-state equilibrium. What if we take (r, δ) or (r, δ, κB , κS ) as our notion of frictions? This is an open question. 49 Atakan (2008) does that by extending the results of Riley and Zeckhauser (1983) and Yilankaya (1999). His logic can be applied here as well. 50 The parameter τ in Chapter 4 can be interpreted as a common multiplier of the discount rate and the search costs. 51 The argument here is rather loose, but it can be made rigorous. 52 In Gale (1987), this problem is resolved by adding an entry fee. 118 Chapter 5. Conclusion 5.2.5 Constant-returns-to-scale matching function We assume that the matching function exhibits constant returns to scale. I conjecture that our main results would not be changed qualitatively if the matching function exhibits decreasing returns instead. What if the matching function exhibits increasing returns? Then things could be diﬀerent. It is well-known that it is easy to have multiplicity of equilibria under increasing returns. Hence at least the uniqueness of full-trade equilibrium would not hold any more. Our convergence results should also have to be modified. I conjecture that as frictions vanish, some sequence of nontrivial steady-state equilibria still converges to perfect competition, but some other sequence converges to the trivial (i.e. noentry) equilibrium, since now the trivial equilibrium becomes "stable". Besides, our proof of equilibrium existence does rely on constant returns. It is not clear how the necessary and suﬃcient condition for the existence of a nontrivial steady-state equilibrium would change if we release the assumption of constant returns. 5.2.6 Continuum of traders We assume the market has continua of buyers and sellers. It is a common assumption in the literature, and it is technically crucial to our analysis. If the number of traders in the market is finite (of course, it is endogenous, so we need to assume the number of traders born within any finite length of time being finite), then the number and distribution of traders in the market cannot stay at some steady-state value. They have to follow some stochastic process because the matching is random and the law of large number does not apply. The equilibrium analysis would become much less tractable, but I conjecture that the equilibrium (defined appropriately) of such a "finite market" converges to the equilibrium of the "corresponding continuum market", at least in some sense. 119 Chapter 5. Conclusion 5.3 Further research The previous section has pointed out some unanswered questions that are left for future research. This section suggests several more. First, our ε-equilibrium technique (see Section 2.7) is seemingly applicable to prove existence of nontrivial equilibrium for other dynamic matching and bargaining games with heterogeneous types and free entry. For example, Satterthwaite and Shneyerov (2008) have been unable to prove existence of equilibrium, unless a distribution of new-born types is assumed to be concave. But, as they points out, "concavity is not an economically plausible assumption to impose on type distributions". Besides, the existence theorem in Satterthwaite and Shneyerov (2007) requires suﬃciently small discount rate relative to the search costs (together with suﬃciently small search costs); and it is only for full-trade equilibria. As another example, the existence theorem in Atakan (2008) requires what he calls Free First Draw for Low Cost Sellers, which is an artificial assumption. To sum up, all these papers have gaps in the equilibrium existence, and I expect our ε-equilibrium technique is useful to fill those gaps. Another line of related research could be introducing competitive search (or directed search), like in Moen (1997). In particular, we could ask: would competitive search make the convergence faster? If the discount rate is zero, the competitive search version of our model (which is analyzed in Mortensen and Wright (2002)) is equivalent to the random-proposer model with a specific bargaining weight. If the discount rate is positive, diﬀerent buyers and diﬀerent sellers would choose to enter diﬀerent submarkets. One might conjecture that even when the discount rate is positive, our rate of convergence results for the random-proposer model maintain in the competitive search model. Another further research could be on general bargaining mechanism. We have touched on that in Section 4.4, but there are still unanswered questions. In particular, we have not solved the socially optimal bargaining mechanism when both the discount rate and the search costs are positive.53 Moreover, what kind of mechanisms ensure convergence, and at 53 Mortensen and Wright (2002) solve it for the no-discounting case. 120 Chapter 5. Conclusion what rate? This is also interesting to explore. 121 Bibliography Apostol, T. (1974): Mathematical analysis. Addison Wesley. Atakan, A. (2008): “Competitive Equilibria in Decentralized Matching with Incomplete Information,” Working paper, Northwestern University. Butters, G. (1979): “Equilibrium price distributions in a random meetings market,” Working paper. Chatterjee, K., and W. Samuelson (1983): “Bargaining under Incomplete Information,” Operations Research, 31(5), 835—851. Cripps, M., and J. Swinkels (2005): “Eﬃciency of Large Double Auctions,” Econometrica, 74(5), 47—92. De Fraja, G., and J. Sakovics (2001): “Walras Retrouve: Decentralized Trading Mechanisms and the Competitive Price,” Journal of Political Economy, 109(4), 842—863. Diamond, P. (1981): “Mobility Costs, Frictional Unemployment, and Eﬃciency,” The Journal of Political Economy, 89(4), 798—812. Gale, D. (1986a): “Bargaining and Competition Part I: Characterization,” Econometrica, 54(4), 785—806. (1986b): “Bargaining and Competition Part II: Existence,” Econometrica, 54(4), 807—818. (1987): “Limit Theorems for Markets with Sequential Bargaining,” Journal of Economic Theory, 43(1), 20—54. 122 Bibliography Gresik, T., and M. Satterthwaite (1989): “The Rate at which a Simple Market Becomes Eﬃcient as the Number of Traders Increases: an Asymptotic Result for Optimal Trading Mechanisms,” Journal of Economic Theory, 48, 304—332. Hosios, A. (1990): “On the Eﬃciency of Matching and Related Models of Search and Unemployment,” The Review of Economic Studies, 57(2), 279—298. Hurkens, S., and N. Vulkan (2006): “Dynamic Matching and Bargaining: The Role of Private Deadlines,” Working Paper, IAE and Said Business School. (2007): “Dynamic Matching and Bargaining: The Role of Deadlines,” Working Paper. Kennan, J. (2007): “Private Information, Wage Bargaining and Employment Fluctuations,” Working Paper, University of Wisconsin. Lauermann, S. (2006a): “Dynamic Matching and Bargaining Games: A General Approach,” Working paper, University of Bonn. (2006b): “When Less Information is Good for Eﬃciency: Private Information in Bilateral Trade and in Markets,” Working Paper, University of Bonn. (2008): “Price Setting in a Decentralized Market and the Competitive Outcome,” Working paper. Milgrom, P., and I. Segal (2002): “Envelope Theorems for Arbitrary Choice Sets,” Econometrica, 70(2), 583—601. Moen, E. (1997): “Competitive Search Equilibrium,” Journal of Political Economy, 105(2), 385—411. Moreno, D., and J. Wooders (2002): “Prices, Delay, and the Dynamics of Trade,” Journal of Economic Theory, 104(2), 304—339. 123 Bibliography Mortensen, D. (1982): “The Matching Process as a Noncooperative Bargaining Game,” in The Economics of Information and Uncertainty, ed. by J. McCall, pp. 233—58. University of Chicago Press, Chicago. Mortensen, D., and C. Pissarides (1999): New Developments in Models of Search in the Labour Market. Centre for Economic Policy Research. Mortensen, D., and R. Wright (2002): “Competitive Pricing and Eﬃciency In Search Equilibrium,” International Economic Review, 43(1), 1—20. Pissarides, C. (2000): Equilibrium Unemployment Theory. Mit Press. Reny, P., and M. Perry (2006): “Toward a Strategic Foundation for Rational Expectations Equilibrium,” Econometrica, 74(5), 1231—1269. Riley, J., and R. Zeckhauser (1983): “Optimal Selling Strategies: When to Haggle, When to Hold Firm,” The Quarterly Journal of Economics, 98(2), 267—289. Rogerson, R., R. Shimer, and R. Wright (2005): “Search-Theoretic Models of the Labor Market: A Survey,” Journal of Economic Literature, 43(4), 959—988. Royden, H. (1988): Real Analysis. Prentice Hall, NJ, 3 edn. Rubinstein, A., and A. Wolinsky (1985): “Equilibrium in a Market with Sequential Bargaining,” Econometrica, 53(5), 1133—1150. (1990): “Decentralized Trading, Strategic Behaviour and the Walrasian Outcome,” The Review of Economic Studies, 57(1), 63—78. Rustichini, A., M. Satterthwaite, and S. Williams (1994): “Convergence to Eﬃciency in a Simple Market with Incomplete Information,” Econometrica, 62(5), 1041—1063. Satterthwaite, M. (1989): “Bilateral trade with the sealed bid k-double auction: Existence and eﬃciency.,” Journal of Economic Theory, 48(1), 107—133. 124 Bibliography Satterthwaite, M., and A. Shneyerov (2007): “Dynamic Matching, Two-sided Incomplete Information, and Participation Costs: Existence and Convergence to Perfect Competition,” Econometrica, 75(1), 155—200. Satterthwaite, M., and A. Shneyerov (2008): “Convergence to Perfect Competition of a Dynamic Matching and Bargaining Market with Two-sided Incomplete Information and Exogenous Exit Rate,” Games and Economic Behavior, 63(1), 435—467. Satterthwaite, M., and S. Williams (1989): “The Rate of Convergence to Eﬃciency in the Buyer’s Bid Double Auction as the Market Becomes Large,” The Review of Economic Studies, 56(4), 477—498. (2002): “The Optimality of a Simple Market Mechanism,” Econometrica, 70(5), 1841—1863. Serrano, R. (2002): “Decentralized Information and the Walrasian Outcome: A Pairwise Meetings Market with Private Values,” Journal of Mathematical Economics, 38(1), 65—89. Shneyerov, A., and A. Wong (2007): “The Rate of Convergence to Perfect Competition of a Simple Matching and Bargaining Mechanism,” Working Paper, UBC. (2009): “Bilateral Matching and Bargaining with Private Information,” Working Paper, UBC. Tatur, T. (2005): “On the Trade oﬀ Between Deficit and Ineﬃciency and the Double Auction with a Fixed Transaction Fee,” Econometrica, 73(2), 517—570. Williams, S. (1991): “Existence and Convergence of Equilibria in the Buyer’s Bid Double Auction,” The Review of Economic Studies, 58(2), 351—374. Wolinsky, A. (1988): “Dynamic Markets with Competitive Bidding,” The Review of Economic Studies, 55(1), 71—84. Yilankaya, O. (1999): “A Note on the Seller’s Optimal Mechanism in Bilateral Trade with Two-Sided Incomplete Information,” Journal of Economic Theory, 87(1), 267—271. 125 Appendix A Additional Details for Existence of Nontrivial Steady-state Equilibrium This appendix provides the additional details for the proof of Theorem 3, which asserts that: In the private information model, at least one nontrivial steady-state equilibrium exists if and only if K (ζ 0 ) < 1. (For the adaptations needed for the full information model, see subsection 3.3.3.) We first claim that our definition of mapping Tε is legitimate. Definition 4 of Tε is legitimate. Fix ᾱ > max {κB , κS } and ε ∈ (0, ε̄]. We need to claim that Tε is well-defined and its range, as stated in the definition, is contained in its domain Dε . The restrictions we impose on Dε are important to claim that. Pick any E ≡ (WB , WS , NB , NS ) ∈ Dε . Firstly, by construction B > 0 and S > 0, so that αB and αS are well-defined. Second, NB (v) and ρB (v) ≡ v − WB (v) are continuous in v; NS (c) and ρS (c) ≡ c + WS (c) are continuous in c. Third, ρB and ρS are strictly increasing (since E ∈ Dε and r > 0). It follows that the objective functions in (2.31) and (2.32) are continuous in p. Therefore the arg max correspondences in (2.31) and (2.32) are nonemptyvalued and compact-valued. Thus pB and pS are well-defined. Now it is obvious that all other constructed objects, in particular WB∗ , WS∗ , NB∗ , NS∗ , are well-defined. It remains to verify that (WB∗ , WS∗ , NB∗ , NS∗ ) ∈ Dε . First, by our construction WB∗ , WS∗ , NB∗ , NS∗ are absolutely continuous; and whenever diﬀerentiable, WB∗0 (v) = χB (v) £ ¤ αB αB qB (v) 1 − WB0 (v) + W 0 (v), r + αB r + αB B 126 Appendix A. Additional Details for Existence of Nontrivial Steady-state Equilibrium WS∗0 (c) = −χS (c) NB∗0 (v) ≡ £ ¤ αS αS qS (c) 1 + WS0 (c) + W 0 (c), r + αS r + αS S χ∗B (v) bf (v) χ∗S (c) sg (c) , NS∗0 (c) ≡ . max {αB qB (v) , κB } max {αS qS (c) , κS } From these derivatives we see (WB∗ , WS∗ , NB∗ , NS∗ ) satisfies the conditions (i) and (ii) in Definition 4. Second, it is easy to verify that (WB∗ , WS∗ , NB∗ , NS∗ ) also satisfies the condition (iii) in Definition 4. Therefore (WB∗ , WS∗ , NB∗ , NS∗ ) ∈ Dε . We conclude that Definition 4 of Tε is legitimate. Next, we prove Dε is nonempty, convex and compact (i.e. Lemma 7). Proof of Lemma 7. Obviously, Dε is convex and closed. To see Dε is nonempty, let WB (v) = WS (c) = 0 for all v, c, and NB (v) = bf¯v/κB , NS = sḡc/κS . Since ε ≤ ε̄, we have NB (1) ≥ εbf /ᾱ and NS (1) ≥ εsg/ᾱ. All other restrictions of Dε are obviously satisfied, thus Dε is nonempty. To see the compactness, notice that Dε is a uniformly bounded family of functions on a compact set [0, 1], and is also an equicontinuous family of functions © ª because the Lipschitz constant for every function in Dε is at most max 1, bf¯/κB , sḡ/κS . By Ascoli-Arzela Theorem (see e.g. Royden (1988) p.169), Dε is compact. It remains to prove the continuity of Tε (i.e. Lemma 8). It requires the following lemma. Lemma 16 Let {Φn } be a sequence of continuous c.d.f.’s with supports contained in [0, 1] and {ψ n } a sequence of real functions on [0, 1]. Suppose (i) {Φn } is uniformly convergent to some c.d.f. Φ; (ii) {ψ n } is convergent to some real function ψ almost everywhere on [0, 1]; and (iii) the absolute values and total variations of {ψ n } and ψ are bounded by some constant C. Then ψ n is Riemann integrable with respect to Φn for each n; and ψ is Riemann integrable with respect to Φ. Moreover, Z 1 Z ψ n (x) dΦn (x) = lim n→∞ 0 1 ψ (x) dΦ (x) . 0 Proof. For each n, since ψ n is of bounded variation and Φn is continuous, hence ψ n is Riemann integrable with respect to Φn (see e.g. Apostol (1974) p.159 Theorem 7.27 and 127 Appendix A. Additional Details for Existence of Nontrivial Steady-state Equilibrium p.144 Theorem 7.6). Similarly, ψ is of bounded variation and Φ (as the uniform limit of a sequence of continuous functions) is continuous, hence ψ is Riemann integrable with respect to Φ. Moreover, ¯Z 1 Z ¯ ¯ ψ n dΦn − ¯ 0 0 1 ¯ ¯Z ¯ ¯ ψdΦ¯¯ ≤ ¯¯ 0 1 ψ n dΦn − Z 0 1 ¯ ¯Z ¯ ¯ ψ n dΦ¯¯ + ¯¯ 0 1 ψ n dΦ − Z 1 0 ¯ ¯ ψdΦ¯¯ . The first part of the right-hand side can be written, through integration by parts for ¯R ¯ Riemann-Stieltjes integrals (see e.g. Apostol (1974) p.144 Theorem 7.6), as ¯ [Φ − Φn ] dψ n ¯ and hence is bounded by C · supx∈[0,1] |Φ (x) − Φn (x)|, which converges to 0 as n → ∞, due to the uniform convergence of {Φn }. The second part also converges to 0 as n → ∞, due to Lebesgue’s dominated convergence theorem (see e.g. Apostol (1974) p.270 Theorem 10.27). Proof of Lemma 8. Fix (r, ᾱ) À (0, max {κB , κS }) and ε ∈ (0, ε̄]. We write the constructed objects in Definition 4 as functions of E ≡ (WB , WS , NB , NS ) explicitly, e.g. B (E), αB (E), pB (v, E), WB (v, E), NB (v, E) etc. We need to show that: for any sequence {En } on Dε , En → E implies Tε (En ) → Tε (E). (Recall that we use the uniform metric on Dε .) Step 1. Obviously B (E), S (E), αB (E) and αS (E) are continuous in E. Step 2. It is easy to see that: I [p ≥ c + WS (c)] (where I [·] is 1 if the condition inside the bracket holds, and 0 otherwise), as a function of (c, p, E), is continuous on {(c, p, E) : p 6= c + WS (c)}. Similarly, I [p ≤ v − WB (v)], as a function of (v, p, E), is continuous on {(v, p, E) : p 6= v − WB (v)}. Step 3. π̂ B (v, p, E) ≡ [v − p − WB (v)] R1 0 S (c) I [p ≥ c + WS (c)] dN S(E) is continuous in (v, p, E). To see this, let (vn , pn , En ) → (v, p, E). Then firstly vn −pn −WBn (vn ) → v−p−WB (v) (note that the convergence WBn → WB is uniform); secondly from step 2, I [pn ≥ c + WSn (c)] → I [p ≥ c + WS (c)] except at the c such that p = c + WS (c) (note that there is at most one such c since r > 0 and E ∈ Dε imply c + WS (c) is strictly increasing). Applying Lemma 16, we obtain π̂ B (vn , pn , En ) → π̂ B (v, p, E). Thus π̂ B (v, p, E) is continuous. Similarly, R1 B (v) π̂ S (c, p, E) ≡ [p − c − WS (c)] 0 I [p ≤ v − WB (v)] dN B(E) is continuous in (c, p, E). Step 4. From step 3 and Berge’s maximum theorem, π B (v, E) (which is equal to 128 Appendix A. Additional Details for Existence of Nontrivial Steady-state Equilibrium maxp∈[0,1] π̂ B (v, p, E)) is continuous in (v, E), and PB (v, E) ≡ arg maxp∈[0,1] π̂ B (v, p, E) is nonempty-valued, compact-valued, and upper-hemicontinuous in (v, E). Analogous results can be proved for π S (c, E) and PS (c, E) ≡ arg maxp∈[0,1] π̂ S (c, p, E). Step 5. pB (v, E) is continuous on {(v, E) : PB (v, E) is a singleton}. To see this, let (vn , En ) → (v, E) and let pB (vn , En ) → p. Then from step 4, p ∈ PB (v, E). Thus, if p 6= pB (v, E) then PB (v, E) is not a singleton. Moreover, pB (v, E) is continuous on {(v, E) : v − WB (v) > WS (0)}. Analogous result can be proved for pS . Step 6. Let E ∈ Dε and En → E. Then pB (v, En ) → pB (v, E) a.e. v ∈ [0, 1]. To see this, firstly consider those v with v − WB (v) < WS (0). Then it is easy to see that π B (v, En ) = 0 = π B (v, E) and PB (v, En ) = [0, WSn (0)] = PB (v, E). Thus pB (v, En ) → WS (0) = pB (v, E). Now consider those v with v − WB (v) > WS (0). By a standard revealed preference argument, any selection of PB (·, E) |{v:v−WB (v)>WS (0)} is nondecreasing. It follows that, for all but countably many v’s in {v : v − WB (v) > WS (0)}, PB (v, E) is a singleton. Then pB (v, En ) → pB (v, E) a.e. from step 5. Analogous result can be proved for pS . Step 7. Let E ∈ Dε and En → E. Then, from steps 1, 2, 4, 6, and Lemma 16, WB∗ (v, En ) → WB∗ (v, E) ∀v and WS∗ (c, En ) → WS∗ (c, E) ∀c. Step 8. It is easy to see that χB (v, E) is continuous on {(v, E) : αB (E) ΠB (v, E) 6= κB }, where ΠB (v, E) is the expression inside the square bracket in (2.33). Furthermore, given E, there is at most one v such that αB (E) ΠB (v, E) = κB . To see this, notice that αB (E) ΠB (v, E) is nondecreasing in v, and if αB (E) ΠB (v, E) = κB then αB (E) qB (v, E) ≥ κB and hence ∂ ∂v [αB (E) ΠB (v, E)] = αB (E) qB (v, E) [1 − WB0 (v)] ≥ κB r r+αB (E) > 0. As a result, given any E ∈ Dε , if En → E then χB (v, En ) → χB (v, E) a.e. v ∈ [0, 1]. Obviously χ∗B has the same property, and analogous results can be proved for χS and χ∗S . Step 9. Let E ∈ Dε and En → E. Then, from steps 1, 2, 6, and Lemma 16, qB (v, En ) → qB (v, E) a.e. v ∈ [0, 1], and qS (c, En ) → qS (c, E) a.e. c ∈ [0, 1]. This together with step 8 implies that NB∗ (v, En ) → NB∗ (v, E) ∀v and NS∗ (c, En ) → NS∗ (c, E) ∀c, again due to Lemma 16. 129 Appendix A. Additional Details for Existence of Nontrivial Steady-state Equilibrium Step 10. Let E ∈ Dε and En → E. From steps 7 and 9, WB∗ (·, En ), WS∗ (·, En ), NB∗ (·, En ) and NS∗ (·, En ) converge pointwise to WB∗ (·, E), WS∗ (·, E), NB∗ (·, E) and NS∗ (·, E) respectively. Moreover, the pointwise convergence is equivalent to uniform convergence, because each of those function sequences form an equicontinuous family of functions with a compact domain [0, 1] (see e.g. Royden (1988) p.168). We therefore conclude that Tε (En ) → Tε (E). 130 Appendix B Calculations for Section 3.6 The goal of this Appendix is to derive the slopes ζ 0f (0) and Wf0 (0) in Section 3.6. As a by-product, we also show that v0f (0) < 0 and c̄0f (0) > 0. ¡ ¢ First of all, divide the buyers’ marginal type equation (3.36) through by αB ζ f , apply integration by parts to the integral in left-hand side, diﬀerentiate through at r = 0, and rearrange: # " Z " # ¡ ¢ c̄f rc + αS ζ f β S c̄f dG (c) d ¡ ¢ vf − β dr B 0 G (c̄f ) r + αS ζ f β S r=0 βB · " # # " κB d ¡ ¢ = dr αB ζ f r=0 Z c̄f G (c) d r ¡ ¢ dc = κB η B (ζ 0 )ζ 0f (0) v f − c̄f + dr r + αS ζ f β S 0 G (c̄f ) r=0 ¸ ∙ ea WS0 = κB ηB (ζ 0 )ζ 0f (0) β B v0f (0) − c̄0f (0) + αS (ζ 0 ) β S G (c̄0 ) where (B.1) ∙ ¸ α0 (ζ ) 1 d = − B 0 2 > 0. η B (ζ 0 ) ≡ dζ αB (ζ) ζ=ζ 0 [αB (ζ 0 )] Work with the sellers’ marginal type equation (3.37) in the same fashion, we have ¸ ∙ ea WB0 0 0 β S v f (0) − c̄f (0) + = −κS η S (ζ 0 )ζ 0f (0) αB (ζ 0 ) β B [1 − F (v 0 )] where (B.2) ∙ ¸ α0 (ζ ) 1 d ηS (ζ 0 ) ≡ − = S 0 2 > 0. dζ αS (ζ) ζ=ζ 0 αS (ζ 0 ) Equations (B.1) and (B.2) can be solved for c̄0f (0) − v 0f (0) and ζ 0f (0). After some rewriting from the characterizing equations of (ζ 0 , v 0 , c̄0 ), we get ζ 0f ∙ ¸ µ ea ea ¶ bWB0 K (ζ 0 ) κS η S (ζ 0 ) κB ηB (ζ 0 ) −1 sWS0 (0) = + − , sG (c̄0 ) βS βB κS κB (B.3) 131 Appendix B. Calculations for Section 3.6 c̄0f (0) − v0f ∙ ¸ K (ζ 0 ) κS η S (ζ 0 ) κB η B (ζ 0 ) −1 (0) = + sG (c̄0 ) βS βB ∙ ea ea ¸ κS η S (ζ 0 ) sWS0 κB η B (ζ 0 ) bWB0 · + . βS κS βB κB Notice that ∙ ¸ ζ m0 (ζ 0 ) κB η B (ζ 0 ) κS η S (ζ 0 ) κB η B (ζ 0 ) −1 ≡ σ S (ζ 0 ) > 0 + =1− 0 βB βS βB m (ζ 0 ) and ∙ ¸ κS η S (ζ 0 ) κS η S (ζ 0 ) κB ηB (ζ 0 ) −1 ζ 0 m0 (ζ 0 ) ≡ σ B (ζ 0 ) > 0. + = βS βS βB m (ζ 0 ) Then c̄0f (0) − v 0f (0) can be further simplified: c̄0f (0) − v 0f ∙ ea ea ¸ sWS0 bWB0 K (ζ 0 ) σ B (ζ 0 ) > 0. (0) = + σ S (ζ 0 ) sG (c̄0 ) κS κB (B.4) Now (B.3) gives the result for ζ 0f (0), while (B.4) and the flow balance equation (3.38) imply that v0f (0) < 0 and c̄0f (0) > 0. Next, by direct calculation, the private information slope of welfare Wp0 (0) is what we state in (3.42). The full information slope of welfare Wf0 (0) is Wf0 (0) = − ea ea 1 sWS0 1 bWB0 − + sG (c̄0 ) [c̄0f (0) − v 0f (0)]. β B αB (ζ 0 ) β S αS (ζ 0 ) (B.5) Sum (B.1) and (B.2), and insert the resulting c̄0f (0) − v0f (0) into (B.5), and cancel terms, we obtain: ea ea sWS0 bWB0 − − sG (c̄0 ) [κB η B (ζ 0 ) − κS ηS (ζ 0 )] ζ 0f (0) αB (ζ 0 ) αS (ζ 0 ) = Wp0 (0) − sG (c̄0 ) K 0 (ζ 0 ) ζ 0f (0) Wf0 (0) = − which gives (3.43). To obtain (3.44), simply substitute (B.4) into (B.5) and rewrite. 132
- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Essays on dynamic matching markets
Open Collections
UBC Theses and Dissertations
Featured Collection
UBC Theses and Dissertations
Essays on dynamic matching markets Wong, Chi Leung 2009
pdf
Notice for Google Chrome users:
If you are having trouble viewing or searching the PDF with Google Chrome, please download it here instead.
If you are having trouble viewing or searching the PDF with Google Chrome, please download it here instead.
Page Metadata
Item Metadata
Title | Essays on dynamic matching markets |
Creator |
Wong, Chi Leung |
Publisher | University of British Columbia |
Date Issued | 2009 |
Description | This dissertation studies dynamic matching and bargaining games with two-sided private information bargaining. There is a market in which a large number of heterogeneous buyers and sellers search for trading partners to trade with. Traders in the market are randomly matched pairwise. Once a buyer and a seller meet, they bargain following the random-proposer protocol: either the buyer or the seller (randomly chosen) makes a take-it-or-leave-it offer to the other party. The traders leave once they successfully trade, and the market is continuously replenished with new-born buyers and sellers who voluntarily choose to enter. We study the steady state with positive entry. There are (except the asymmetric information) two kinds of frictions: time discounting and explicit search costs. Chapter 2 addresses existence and uniqueness of equilibrium. It provides a simple necessary and sufficient condition for the existence of a nontrivial steady-state equilibrium. The equilibrium is unique if the discount rate is small relative to the search costs. This chapter also analyzes how the composition of frictions affects the patterns of equilibria. It shows that if the discount rate is small relative to the search costs, in equilibrium every meeting results in trade. If the discount rate is relatively large, some meetings do not result in trade. Chapter 3 shows that private information typically deters entry. Because of search externalities, this entry-deterring effect may be socially desirable or undesirable. We provide and interpret a simple condition under which private information improves welfare. Chapter 4 studies the convergence properties of equilibria as frictions vanish. It not only shows that, as frictions vanish, the equilibrium price range collapses to the Walrasian price and the equilibrium welfare converges to the Walrasian welfare level, but also provides the rate of convergence. Under random-proposer bargaining, welfare converges at the fastest possible rate among all bargaining mechanisms. If we assume double auction instead of random-proposer bargaining, equilibria might converge at a slower rate or even not converge at all. These results also hold under full information bargaining. It suggests that private information does not affect asymptotic efficiency, but bargaining protocol might. |
Extent | 957267 bytes |
Genre |
Thesis/Dissertation |
Type |
Text |
FileFormat | application/pdf |
Language | eng |
Date Available | 2009-09-30 |
Provider | Vancouver : University of British Columbia Library |
Rights | Attribution-NonCommercial-NoDerivatives 4.0 International |
DOI | 10.14288/1.0067729 |
URI | http://hdl.handle.net/2429/13397 |
Degree |
Doctor of Philosophy - PhD |
Program |
Economics |
Affiliation |
Arts, Faculty of Vancouver School of Economics |
Degree Grantor | University of British Columbia |
GraduationDate | 2009-11 |
Campus |
UBCV |
Scholarly Level | Graduate |
Rights URI | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
AggregatedSourceRepository | DSpace |
Download
- Media
- 24-ubc_2009_fall_wong_chileung.pdf [ 934.83kB ]
- Metadata
- JSON: 24-1.0067729.json
- JSON-LD: 24-1.0067729-ld.json
- RDF/XML (Pretty): 24-1.0067729-rdf.xml
- RDF/JSON: 24-1.0067729-rdf.json
- Turtle: 24-1.0067729-turtle.txt
- N-Triples: 24-1.0067729-rdf-ntriples.txt
- Original Record: 24-1.0067729-source.json
- Full Text
- 24-1.0067729-fulltext.txt
- Citation
- 24-1.0067729.ris
Full Text
Cite
Citation Scheme:
Usage Statistics
Share
Embed
Customize your widget with the following options, then copy and paste the code below into the HTML
of your page to embed this item in your website.
<div id="ubcOpenCollectionsWidgetDisplay">
<script id="ubcOpenCollectionsWidget"
src="{[{embed.src}]}"
data-item="{[{embed.item}]}"
data-collection="{[{embed.collection}]}"
data-metadata="{[{embed.showMetadata}]}"
data-width="{[{embed.width}]}"
data-media="{[{embed.selectedMedia}]}"
async >
</script>
</div>
Our image viewer uses the IIIF 2.0 standard.
To load this item in other compatible viewers, use this url:
https://iiif.library.ubc.ca/presentation/dsp.24.1-0067729/manifest