Managing congestion in dynamic matching markets

Size: px
Start display at page:

Download "Managing congestion in dynamic matching markets"

Transcription

1 Managing congestion in dynamic matching markets Nick Arnosti (Stanford), Ramesh Johari (Stanford), Yash Kanoria (Columia) April 20, 2014 Astract We consider a decentralized two-sided matching market in which agents arrive and depart asynchronously. As a result, it is possile that an agent on one side of the market (a uyer ) identifies an agent on the other side of the market (a seller ) who is a suitale match, only to find that the seller is already matched. We find using a mean field approach that lack of knowledge aout availaility can create large welfare losses to oth uyers and sellers. We consider a simple intervention availale to the platform: limiting visiility of sellers. We find that this intervention can significantly improve the welfare of agents on oth sides of the market; sellers pay lower application costs, while uyers are less likely to find that the sellers they screen have already matched. Somewhat counterintuitively, the enefits of showing fewer sellers to each uyer are greatest in markets in which there is a shortage of sellers. Keywords: Matching, market design, mean field 1 Introduction Many matching markets operate asynchronously; in other words, in these markets agents arrive and depart over time, and matches are formed dynamically without a centralized clearing mechanism. Because of this, it is possile that an agent on one side of the market (a uyer ) identifies an agent on the other side of the market (a seller ) who is a suitale match, only to find the seller is unavailale ecause she is already matched. In this paper, we focus on the welfare effects of asynchronous matching, and in particular the resulting incomplete information regarding availaility. A lack of availaility information is a common prolem in a range of online matching markets, e.g., dating markets and laor markets. As one pertinent example, consider odesk, a large online laor market. On odesk clients can post jos and wait for workers to apply, or directly invite workers instead. In practice, the est workers on odesk may prove to e unavailale to the client, a fact that typically has a strong negative effect on a client s satisfaction on the site. 1 A key reason is that uyers invest effort determining whether 1 In particular, their site states that when clients send out invitations and freelancers don t reply, it s a frustrating experience that makes those clients less likely to hire anyone. See What-is-responsiveness-. 1

2 they want to invite someone to work on their jo, and this effort is wasted if the invited worker turns out to e unavailale. In such a situation we are naturally led to ask: what could the platform do to improve the experience of the uyer? One ovious solution is to provide information aout the likelihood that each individual will respond when contacted, and many online marketplaces such as odesk, AirBnB, and OkCupid strive to do just that. However, these inferences are (at est) imperfect. This is ecause online matching platforms y their very nature are served y a community of freelancers, whose availaility at a given time may depend on a variety of factors that are unoservale to the platform and to other market participants. As a consequence, platforms are interested in other ways to mitigate the negative consequences of a lack of availaility information. We consider an intervention that is simple yet powerful: limiting visiility. In particular, we consider whether the market can improve welfare y restricting the numer of uyers to whom each seller ecomes visile. 2 Coffee Meets Bagel 3, eharmony 4 and odesk 5. This approach is popular on a variety of existing wesites/apps like In this paper, we develop a mathematical model of a dynamic matching market and use it to quantitatively study the possile effects of this type of intervention. Informally, our findings show that such limiting visiility can provide enefits to oth uyers and sellers. When the market is demand-limited i.e., when uyers are relatively scarce we show intervention helps mitigate the tragedy of the commons among sellers. Perhaps more surprising is that limiting seller visiility can significantly improve uyer welfare when the market is supply-limited. The reason is sutle: y limiting seller visiility, we ensure that more sellers are availale, hence reducing wasted screening effort y uyers on unavailale sellers. The remainder of the paper is organized as follows. We egin in Section 3 y presenting our asic model. In the game we consider, uyers and sellers arrive over time, and live for (at most) a unit lifetime. Sellers apply to a suset of uyers present in the system upon arrival, and incur a fixed cost per application sent. Upon departure, uyers screen the applications they receive for compatiility, i.e., fitness for a match; they pay a fixed cost per application screened. If a compatile match is found the uyer can make her an offer, and sellers accept the first offer they receive (if any). If a uyer makes an offer to an unavailale seller, the offer fails and the uyer continues to screen for a match. Because there is a delay etween when an application is sent (the application time ) and when the seller is evaluated y the uyer (the screening time ), the state of the seller can change y the time she is screened. In particular, although the seller may have een unmatched at the application time, she may already e matched y the screening time. Unless the uyer knows this, effort will e wasted screening a candidate that is not availale. 2 Behavioral findings, e.g. Iyengar and Lepper [16], suggest that more choice may make agents less likely to act (e.g., match), providing another possile enefit to such restriction. We do not model this effect. 3 Users are shown exactly one profile a day on this dating app. If oth people like each other this results in contact information eing exchanged. 4 Users are shown 5 matches per day on this dating wesite. 5 Users are allowed to send a limited numer of applications. 2

3 Note that our model differs slightly from the odesk scenario descried aove, in that sellers must first apply to ecome visile to uyers. In odesk, a uyer (client) can invite any sellers (freelancers) that she sees in search. 6 Thus, from the perspective of uyers, we should view the sumarket for the est workers on odesk as a limit of our model where application costs approach zero; this is the asymptotic regime in which we conduct the majority of our welfare analysis. Our model defines a fairly complex dynamic game among the agents, which requires higher order eliefs that uyers and sellers must hold aout each other. In practice, of course, in a large market it seems reasonale to expect simplification in the market structure due to averaging, so that relatively simple reasoning y the agents allows them to play an approximate est response. Inspired y such an argument along with a plausile expectation of ounded rationality, we employ a mean field approach to study our game. In particular, in Section 4 we consider a formal stationary mean field model inspired y a regime where the numer of uyers and sellers in the system grows large, and make two key assumptions that simplify the analysis: we assume that from the point of view of a uyer, each applicant is independently availale with the same fixed proaility q; and from the point of view of a seller, each application is independently successful with the same fixed proaility p. Under these two mean field assumptions, solving for the optimal strategies of uyers and sellers ecomes straightforward. On the other hand, oth p and q must satisfy consistency checks that ensure they arise from the optimal decisions of uyers and sellers. Taken together, this pair of conditions optimality and consistency define a notion of equilirium for our mean field model that we call mean field equilirium (MFE); several recent papers have used a similar modeling approach (see, e.g., [17, 13, 3, 4]). We justify our mean field analysis y showing that as the market grows large, the mean field assumptions hold asymptotically (see Section 5). Most importantly, the resulting equiliria are tractale to analyze, and yield rich insight into the welfare of oth uyers and sellers, as well as the potential improvements that can e generated if the platform intervenes. We carry out our welfare analysis for market with and without intervention in Section 6. We study oth markets in a regime where application costs approach zero, and completely characterize how uyer and seller welfare depends on the screening cost and the ratio of uyers to sellers in the market. We conclude with additional discussion in Section 7. 2 Related Work The model presented in this paper ears resemlance to those that appear in the search theory literature; see Diamond [7], Mortensen [24], Pissarides [25, 26], and the early survey of Hosios [15]. This literature concludes that when jo seekers cannot coordinate their search efforts, inefficient levels of jo creation, jo search, and unemployment result. 6 In our model, an invitation from a uyer to a seller is equivalent to an offer, in the sense that the uyer would want to hire the first availale, compatile seller that they find. 3

4 A range of extensions have een added to these models, including the role of wages [29, 23], incomplete information [11], on-the-jo search [28], and adverse selection [12]. Rogerson et al. [27] conduct a survey of the literature on search theory. Much of this literature assumes that workers apply to only one position (and therefore will always accept the jo if offered it), though several papers (see [2, 9, 20]) permit simultaneous search. Our work is rooted in micro-foundations, unlike much of the search literature, which relies on a lack ox matching function. This allows us to not only study whether the market is efficient, ut also to more easily analyze the effect of possile interventions y the market operator. Furthermore, the search literature often relies on calculations that assume that individual agents do not affect aggregate outcomes in large markets, and that strategic considerations can therefore e ignored. Though we make these same assumptions, one of our important technical contriutions is to show that they hold in the limit as the numer of market participants grows (see Section 5). Though similar in spirit to the recent work of Galenianos and Kircher [10], this proof confronts several novel challenges. First, we discuss a dynamic, rather than static, system. Second, in our model each worker applies to multiple firms, which Galenianos and Kircher acknowledge presents many difficulties even in the static setting. There is a separate ody of work which focuses on the importance of availaility in matching markets, and the potentially eneficial effects of reducing the numer of options presented to each agent. For example, Halaurda and Piskorski [14] conclude that agents may e etter off in platform with less choice. However, in their model, welfare loss is primarily driven y the fact that agents who are shown N candidates match with proaility at most 1/N. By contrast, in our model showing a larger numer of candidates (weakly) increases the numer of matches formed, ut also increases the search and screening costs required to find these matches. Coles et al. [5] study the jo market for students graduating with PhDs in economics, and study the effect of a mechanism that allows students to credily signal their preferences. Lee et al. [22], Coles et al. [6], Lee and Schwarz [21] provide additional theoretical and empirical support for similar schemes. One important distinction etween this line of work and our own is that in existing work on availaility, firms are uncertain aout the preferences of workers, and risk having their offers turned down y workers who prefer other firms. In [6], one driver of improved worker welfare is that when signals are used, workers receive etter offers. In our setting, uyers and sellers are ex-ante homogeneous, and this effect is asent. The uncertainty facing uyers is one of timing; they know that their offer will e accepted, so long as the seller is not already employed. Fradkin [8] notes that on AirBnB, uyers might lack information aout seller availaility ecause transactions take time to complete, and sellers may not relialy update the calendars.in his model, inquiries y uyers may e rejected either ecause the seller deems the uyer unsuitale or ecause the seller is no longer availale to transact. It is not clear that a single intervention can simultaneously address these separate concerns. Our work shows that temporal miscoordination can e very costly in dynamic markets. Furthermore, we show that interventions similar to those proposed to address preference-related frictions can also reduce 4

5 timing-related frictions and enhance the welfare of agents on oth sides of the market. 3 The Model In the market we consider, uyers and sellers arrive over time, interact with each other, and eventually depart. Informally, we are trying to model the following ehavior. Buyers arrive to the market, and immediately post an opening. When sellers arrive, they sumit applications to a suset of the uyers currently in the market. Upon exit from the system, a uyer reviews her applicants. Initially, she does not know whether these applicants are still availale or are compatile with the opening. At some cost, she can screen candidates, learning compatiility in the process. Additionally, she can make offers to applicants, who respond immediately y accepting or rejecting. The uyer takes these actions in sequence, and eventually leaves the marketplace. Our dynamic markets are parameterized y n > 0, which descries the market size. We endow uyers and sellers with unique IDs which convey no other information aout the agent. We use B(t) to denote the set of uyers present in the system at time t, and S(t) to denote the set of sellers present in the system at time t. We let B(t) and S(t) denote the magnitudes of these sets, respectively. We assume that B(0) = S(0) =. 3.1 Utility Before descriing market dynamics, we descrie the payoff structure in our matching market. Upon exiting the market, uyers pay a cost of u > 0 for each seller to whom they are matched. Buyers only earn surplus if they match to sellers with whom they are compatile. In particular, they earn a reward of v > u if and only if they are compatile with at least one seller to whom they have matched. Upon exiting the market, sellers earn a payoff of w > 0 if they are matched to a uyer, and 0 otherwise. Sellers cannot match to multiple uyers. Note that our model is asymmetric, in the sense that uyers are sensitive to whether or not the match is compatile, while sellers are not. We assume that that each uyer-seller pair is compatile with proaility β (independently across all such pairs), and that this is common knowledge. Sellers pay a cost c a 0 for each application that they send, and uyers incur a cost c 0 for each applicant that they screen. The net utility to an agent will e the difference etween value otained from any match(es), and costs incurred. We assume that our agents are risk neutral; that is, they seek to maximize their expected utility. For later reference, it will e useful to consider normalized versions of the screening and application costs. We make the following definitions; note that c and c a are oth dimensionless. c = c β(v u) ; (1) c a = c a βw. (2) 5

6 We make the following assumptions on the model parameters, which remain in force for the remainder of the paper. Assumption 1. βv < u. This assumption ensures that the proaility of compatiility is sufficiently low (or the cost u sufficiently high) that uyers get negative expected utility from hiring an unscreened worker. Assumption 2. c < 1. This assumption ensures that the screening cost is sufficiently low that uyers get positive expected utility from screening a worker who is known to e availale (and hiring them if they are compatile). If Assumption 1 holds and Assumption 2 does not, then regardless of seller ehavior, it will e optimal for uyers to exit the market immediately, and thus no trade will occur in equilirium. 3.2 Arrivals In our market, individual uyers arrive at intervals of 1/n; individual sellers arrive at intervals of 1/(rn). Here r > 0 is a parameter that controls the relative magnitude of the two sides of the market. Buyers remain in the system for a unit lifetime. Sellers depart the system according to a process that we descrie elow. Buyers post a single opening upon arrival to the system; we assume this opening is tagged with their ID. Therefore, B(t) also represents the set of active openings in the market at time t; for this reason we use uyer and opening interchangealy elow. Buyers do not oserve any state or make any decisions upon their arrival. Suppose that seller s arrives at time t. Upon arrival, s selects a value m s efore oserving any market state. At this point, s applies to each uyer in B(t) with proaility m s /n 7. Note that in our model the expected numer of applications sent y any seller arriving after time t 1 is m s. An alternate model of seller applications might e that sellers directly choose the numer of applications they send. We choose a proailistic specification primarily for technical convenience, to ease our later mean field analysis: in a setting where sellers deterministically send a fixed numer of applications, an additional dependency is introduced across the uyers. 3.3 Seller departure Sellers remain in the system for a maximum of one time unit. If they receive and accept an offer from any uyer (as descried elow), they depart from the market at that time. Recall that (excluding application costs) a seller earns a payoff of w as long as she is matched (regardless of compatiility), and zero otherwise. Thus, it is a dominant strategy for sellers to accept the first offer they receive. We assume henceforth that sellers follow this strategy. 7 6

7 3.4 Buyer departure Each uyer stays in the system for one time unit, and then departs. Upon departure, uyers see the set of applicants to their opening. Initially, they do not know which of these applicants are compatile for their jo, nor do they know which would accept the jo if offered it. The uyer takes a sequence of screening and offer actions, instantaneously learning the result of each, until they choose to exit the market. At each stage of this sequential decision process, the uyer may screen an unscreened applicant, make an offer to an applicant to whom they have not made an offer, or exit. Screening an applicant reveals whether that applicant is compatile with the jo, and incurs a cost c. Making an offer is costless, though recall that the uyer incurs a cost u if the offer is accepted. A more formal description of the dynamic optimization prolem solved y uyers appears in the Appendix. 4 The large market: A stationary mean field model In principle, the strategic choices facing an agent in the model descried aove may e quite complicated. Consider the case of a uyer who knows that he has only one competitor. If he finds that his first applicant has already accepted another offer, he learns that every other applicant is still looking for a jo. Even when the exact numer of other uyers is unknown, similar logic indicates that in thin markets, information revealed during screening may induce significant shifts in the uyer s eliefs. This and other dependencies could conceivaly cause optimal agent to e quite complex, oth to descrie and understand. As the market thickens, however, one might expect that the correlations etween agents on the same side of the market ecome weak. In particular, uyers screening a pool of applicants might reasonaly assume that learning that one applicant has already accepted another offer does not inform them aout the availaility of other applicants. Further, if the uyer does not know anything aout individual sellers, each one should appear to e availale with equal proaility. Similarly, sellers who know nothing aout individual uyers may e justified in assuming that each of their applications convert to offers independently and with equal proaility p. In this section we develop a formal stationary mean field model for our dynamic matching market, and introduce a notion of game-theoretic equilirium for this formal model. In our formal model, agents make the following assumptions. Mean Field Assumption 1 (Buyer Mean Field Assumption). Each seller in a uyer s applicant set is availale with proaility q, and the availaility of sellers in the applicant set is independent. Mean Field Assumption 2 (Seller Mean Field Assumption). Each application yields an offer with proaility p, independently across applications to different openings Mean Field Assumption 3 (Large Market Assumption). The numer of applications sent y a seller who chooses m s = m is Poisson distriuted with mean m. If all sellers select m s = m, the numer of applications received y each uyer is Poisson distriuted with mean rm. 7

8 Under these assumptions, characterizing optimal agent ehavior simplifies tremendously. In Section 4.1, we first characterize the optimal uyer and seller decisions in the presence of the mean field assumptions. For sellers, we show that there exists a unique optimal choice of m, given p; and for uyers, we show that the optimal decision rule given q involves mixing etween a simple sequential screening strategy, and exiting immediately. Next, in Section 4.2, we derive consistency checks that p and q should satisfy, if they indeed arise from the conjectured optimal uyer and seller decision rules. Finally, we comine these two steps: our first step derives optimal decision rules from p and q, and our second step derives p and q from the decision rules. In Section 4.3, we define (stationary) mean field equilirium as a fixed point of the resulting composite map, and show that it exists and is unique. Informally, a mean field equilirium is a pair of strategies that are est responses to the stationary market dynamics that they induce in the large n limit. Mean field equilirium defined in this way is the oject of study in the remainder of our paper. Theorems 3 and 4 in Section 5 justify our study of mean field equiliria: there we show (in an appropriate sense) that the mean field assumptions hold as n approaches infinity. 4.1 Optimal decision rules We egin y studying the question of how agents should respond when confronted with a world where the mean-field assumptions hold. In the next two sections we study the optimal decision rules of the seller and uyer, respectively Sellers As discussed in Section 3, in our model it is a dominant strategy for sellers to accept the first offer (if any) that they receive, and we assume sellers follow this rule. Therefore the only decision a seller s needs to make on arrival is her choice of m s, the parameter that determines the distriution of the numer of applications sent. If a seller s chooses m s = m, they incur an expected cost of c a m. If the seller applies to Poisson(m) uyers, and each application independently yields an offer with proaility p, then at least one offer is received i.e., the seller matches to a uyer with proaility 1 e mp. Thus, the expected payout of a seller in the mean-field environment who selects m s = m is Π s (m, p) = w(1 e mp ) c a m. (3) Thus, a seller solves the following optimization prolem: maximize m Π s (m, p), suject to m 0. (4) The ojective function is strictly concave and decays to as m, so this prolem possesses a unique 8

9 optimal solution identified y first-order conditions. We conclude that if wp < c a, the optimal choice is m = 0. Otherwise, sellers select We define M to e the function that maps p to this unique value of m: Buyers M(p) = m = 1 ( ) wp p log. (5) c a 0, if wp < c a ; ( ) 1 p log wp c a, if wp c a. Next, we consider the optimal decision rule for the uyers, when they make Mean Field Assumption 1. We consider the following simple strategy, which we denote φ 1. A uyer playing φ 1 sequentially screens candidates in her applicant list. When she finds a compatile applicant, she makes an offer to this candidate; otherwise, she considers the next candidate. This process repeats until one applicant accepts or no more applicants remain. As we show in the following proposition, when Assumption 1 holds, either φ 1 or exiting immediately is optimal for uyers. Proposition 1. Let φ 1 e the strategy of sequentially screening applicants, offering them the jo if and only if they are qualified, until either an applicant is hired or no more applicants remain. Suppose that Assumption 1 and Mean Field Assumption 1 hold. Then φ 1 is uniquely optimal if and only if q > c, exiting immediately is uniquely optimal if and only if q < c, and any mixture of these strategies is optimal if q = c. Motivated y this proposition, we define φ α to e the strategy that plays φ 1 with proaility α and exits immediately with proaility 1 α. Further, define the correspondence A(q) y: {0} if q < c A(q) = [0, 1] if q = c {1} if q > c. This correspondence captures the optimal uyer response, as descried in Proposition 1, so that (6) (7) A(q) = {α [0, 1] : φ α is optimal for the uyer}. Consider uyer playing φ α who receives a numer of applicants that is Poisson distriuted with parameter rm. Each of these applicants is (independently) qualified with proaility β and (if Mean Field Assumption 1 holds) availale with proaility q, so the numer of qualified availale applicants to the uyer is Poisson distriuted with mean rmβq. The uyer hires if and only if they choose to screen and they receive a qualified availale applicant, which occurs with proaility α(1 e rmβq ). Thus, uyer s expected match surplus (excluding screening costs) is α(v u)(1 e rmβq ). For each match found, an 9

10 average of 1/(qβ) applicants are screened, so we find that the total expected surplus to a uyer following φ α is Π (α, q, m) = α(v u)(1 e rmβq )(1 c /q). (8) 4.2 Consistency In the previous section, we discussed the est responses availale to uyers and sellers when the mean field assumptions hold; that is, given p and q, we found the decision rules that agents would adopt. However, it is clear that p and q are simultaneously determined y the strategies agents adopt. In other words, there must e consistency conditions that p and q satisfy given specific strategies adopted y the agents. In this section we identify these consistency conditions. Inspired y the results of the preceding section, in this section we focus on the following strategies. We assume that all sellers choose the same m 0. We assume that all uyers play φ α, i.e., they play φ 1 with proaility α and exit immediately otherwise. Throughout the section, we suppose that Mean Field Assumptions 1, 2 and 3 hold. We emphasize at the outset that our analysis here is only to ensure that we formally derive the correct consistency conditions under these assumptions; rigorously justifying our mean field equations requires the approximation theorems proven in Section 5, which show that the mean field assumptions hold asymptotically as n. We start y deriving a consistency condition that q must satisfy, given p and the seller s strategy. Suppose that s applies to k uyers. Select one such uyer, uniformly at random. In our formal mean field model, the proaility that s is availale when screens is P (s availale to s sent k applications) = 1 k 1 (1 p) j = (1 (1 p)k ). (9) k pk From the perspective of a uyer to whom s has applied, the proaility that s sent a total of k applications is k/m e m m k /k!. Thus, averaging (9) over the numer of applications sent y s, the proaility that s is availale when screens is j=0 q = k=1 (1 (1 p) k ) pk k m e m m k k! = 1 e mp mp = g(mp), (10) where we define g(0) = 1, g(x) = 1 e x x for convenience. For future reference, we note the following aout the function g: for x > 0, (11) Lemma 1. The function g : [0, ) (0, 1] defined y (11) is strictly decreasing. Furthermore, g (x) g(x)/x for x > 0. 10

11 Next, we derive a consistency condition that p must satisfy, given q and the uyer s strategy φ α. We consider a uyer s screening process from the vantage point of a particular seller s. Suppose that s is one of l + 1 availale applicants and that uyer follows φ α. Then screens s if and only if they decide to screen at all and all availale sellers screened efore s are unqualified for the position. If screens sellers in a random order, then the proaility that screens s is: α l + 1 l j=0 (1 β) j = α(1 (1 β)l+1 ) (l + 1)β. (12) If each seller that arrives while the uyer is in the market applies to independently with proaility m/n, and is availale when screens with proaility q, then from the perspective of seller s, the numer of competing applicants l is Poisson with parameter rmq in large n limit, y Mean Field Assumption 3. Since hires s if and only if screens s and they are compatile, the proaility that hires s is given y e rmq (rmq) l p = αβ l! l=0 1 (1 β)l+1 (l + 1)β = α(1 e rmβq ) rmq = αβg(rmβq). (13) The equations (10) and (13) are a system for p and q, given the values of m and α (as well as the parameters r and β). Straightforward algeraic manipulation reveals that any solution to this system also satisfies α(1 e rβmq ) = r(1 e mp ). (14) Because the numer of qualified availale applicants to each uyer is assumed to e Poisson with parameter rβmq and the numer of offers received y a seller is assumed to e Poisson with parameter mp, (14) can e interpreted as saying that the proportion of uyers who match must equal r times the proportion of sellers who match. In the next proposition we prove that the system defined y consistency equations (10) and (13) always has a unique solution. Theorem 1. For fixed m, α, r, and β, there exists a unique solution (p, q) to (10) and (13). We defer a proof of Theorem 1 to the Appendix. We refer to the unique pair (p, q) that solve (10) and (13) as a mean field steady state (MFSS). This pair provides a prediction of how a large market should ehave, given specific strategic choices of the agents. For later reference, given m and α, let P(m, α) and Q(m, α) denote the unique values of p and q guaranteed y Theorem 1, respectively. 4.3 Mean field equilirium In this section we define mean field equilirium (MFE), a notion of game theoretic equilirium for our stationary mean field model. 11

12 Informally, we would like a MFE to ensure that (1) agents are playing optimally given their eliefs aout the marketplace, i.e., the values of p and q in the mean field assumptions; and (2) their eliefs aout the marketplace are consistent with what the agents are playing, i.e., that p and q constitute a MFSS given the agents decision rules. Section 4.1 addressed the first point; and section 4.2 addressed the second. To define a mean field equilirium, we compose the maps defined in those sections. Formally, we have the following definition Definition 1. A mean field equilirium (MFE) is a pair (m, α ) such that m = M(P(m, α )) and α A(Q(m, α )). In other words, in an MFE, m and α are optimal responses (under the mean field assumptions) to the mean field steady-state (p, q) that they induce. We also define p = P(m, α ) and q = Q(m, α ). Our main theorem in this section is the following: Theorem 2. Fix r, β, c a, c, w, v, u, and suppose Assumptions 1 and 2 hold. Then there exists a unique mean field equilirium (m, α ). Furthermore, m > 0 if and only if c a < 1. For future reference, we define Π s, Π to e the expected seller and uyer surplus in mean-field equilirium, respectively. In other words, Π s = Π s (m, p ), Π = Π (α, q, m ), (15) where Π s and Π are defined y (3) and (8). 4.4 A regulated market: Application limits As noted in the introduction, we are interested in comparing a market that operates without any intervention, to one where the platform operator intervenes to try to improve the welfare of uyers and/or sellers. We consider a particular type of intervention: where the market operator restricts the numer of applications that can e sent y any individual sender.we refer to the unregulated market as the market without any application limit, and a regulated market as any market with an application limit. (In Section 7, we also riefly discuss the consequences of an alternative intervention: raising the application cost c a.) To formally study a model with application limits, consider a model in which uyer choices and payoffs are identical to our previous model, ut sellers are restricted to selecting m [0, l]. In the corresponding mean field model, this restriction leaves the analysis of the uyer optimal response unchanged, ut alters the seller s optimal response. In particular, in the mean field model, sellers solve the following optimization prolem given p: max Π s(m, p). m [0,l] 12

13 As discussed in Section 4.1.1, the ojective function is strictly concave, so this prolem has a unique solution identified y first-order conditions. It is given y M l (p) = min(l, M(p)). (16) We can then define the consistency conditions analogous to Section 4.2. Analogous to the unregulated market, we define a mean field equilirium of the market with application limit l as a pair (m l, α l ) solving the following pair of equations: m l = M l(p(m l, α l )), α l A(Q(m l, α l )). (17) The following proposition is an analog of Theorem 2 for the regulated market. Proposition 2. Fix r, β, c a, c, w, v, u such that Assumptions 1 and 2 hold, and let (m, α ) e the corresponding MFE in the unregulated market. Then for any l 0 there exists a unique mean field equilirium in the (regulated) market with application limit l. If m l, then (m l, α l ) = (m, α ). Otherwise, m l = l and α l is the unique solution to α l A(Q(l, α l )). Also analogous to the unregulated market, we define p l = P(m l, α l ), q l = Q(m l, α l ); then (p l, q l ) is the MFSS corresponding to the MFE of the (regulated) market with application limit l. We let Π l s and Π l e expected seller and uyer payoffs in the mean field equilirium of the (regulated) market with application limit l. In other words, Π l s = Π s (m l, p l ), Πl = Π (αl, q l, m l ). (18) 5 Mean field approximation In this section, we show that our mean field model is (in an appropriate sense) a reasonale approximation to our finite system when the market grows large (i.e., when n ). Formally, we show that the mean field assumptions hold as n, as long as all sellers s choose m s = m, and all uyers choose α = α. Note that once we fix m and α, we have removed any strategic element from the evolution of the n-th system: our desired results then ecome limit theorems aout a certain sequence of stochastic processes. We require the following notation. We let Binomial(n, p) denote the inomial distriution with n trials and proaility of success p, and let Binomial(n, p) k = P(Binomial(n, p) = k). We let Poisson(a) denote the Poisson distriution with mean a, and let Poisson(a) k = P(Poisson(a) = k). In the following theorem, we show that Mean Field Assumption 1 holds as n. In the process, we also show half of Mean Field Assumption 3: that in the limit the numer of applications received y a uyer is Poisson distriuted. Theorem 3. Fix r, β, m, and α. Suppose that the n-th system is initialized in its steady state distriution. Consider any uyer that arrives at t 0. Let R (n) denote the numer of applications received y uyer 13

14 in the n-th system, and let A (n) e the numer of these applicants that are still availale when the uyer screens. Then as n, the pair (R (n), A (n) ) converges in total variation distance to (R, A), where R Poisson(rm), and conditional on R, we let A Binomial(R, q). Analogously, we have the following theorem, where we show that Mean Field Assumption 2 holds as n. In the process, we also show the other half of Mean Field Assumption 3: that in the limit the numer of applications sent y a seller is Poisson distriuted. Theorem 4. Fix r, β, m, and α. Suppose that the n-th system is initialized in its steady state distriution. Consider any seller s arriving at time t s 0. Let T s (n) denote the numer of applications sent y seller s in the n-th system, and let Q (n) s e the numer of these applications that generate offers. Then as n, the pair (T s (n), Q s (n) ) converges in total variation distance to (T, Q), where T Poisson(m), and conditional on T, we let Q Binomial(T, p). In estalishing these results, the fundamental result that we prove is that the evolution of the state of the n-th system satisfies a stochastic contraction condition, and therefore remains close to an appropriately defined fixed point for all time. This asic result allows us to estalish that the mean field assumptions hold asymptotically. 6 Welfare analysis One of the chief advantages of MFE is that they are amenale to analysis. In particular, given the tractale representation we have for MFE, we can gain significant insight into uyer and seller welfare, and the potential value of regulation for each side of the market. In this section, we study uyer and seller welfare in the MFE, and quantify how limiting the numer of applications affects their welfare. Note that we focus on uyer and seller welfare individually, ecause aggregate welfare is a weighted sum of these two that depends on the ratio (v u)/w, which is a free parameter in our model. Throughout, we suppose that Assumptions 1 and 2 hold. 6.1 Preliminaries: An upper-ound on welfare We egin y characterizing uyer and seller welfare in MFE. Proposition 3. For any m and α, we have Π (α, Q(m, α), m) = r(v u)(1 e mp(m,α) c mp(m, α)). (19) 14

15 Furthermore, Π = r(v u)(1 e m p c m p ). (20) Π s = w(1 (1 + m p )e m p ). (21) The proof takes the definitions of equilirium welfare from (15), and applies three identities. The first is the consistency equation (10) satisfied y any mean-field steady-state; the second is the matching constraint given in (14), and the third is the seller est response function given y (6). We now use Proposition 3 to derive upper-ounds for uyer and seller welfare that hold not only in equilirium of the unregulated market, ut also in the equilirium of any regulated market. In particular (for any l) there holds: Π, Πl r(v u)(1 c + c log c ); (22) Π s, Π l s w min { 1/r, 1 e γ}, (23) The ound (22) for uyers comes directly from maximizing the right side of (19) with respect to mp(m, α), and therefore holds for any MFSS (m, α). The ounds on Π s and Π l s come from two oservations. First, sellers can never match with proaility exceeding 1/r (though this is only meaningful if r > 1). Second, in equilirium uyers must earn nonnegative payoff; it follows from (8) that q c. Because q = g(m p ) (see (10)) and g is decreasing (see Lemma 1), this implies that m p γ, where γ is the unique solution (y Lemma 1 and Assumption 2) to: g(γ) = c. (24) Since the numer of offers received y a seller is Poisson with mean m p, this implies that in equilirium, sellers match with proaility at most 1 e γ. 6.2 Overview of welfare analysis: Three regions In the remainder of the section, we study the ehavior of uyer and seller welfare in oth the regulated and unregulated markets, using the upper ounds (22) and (23) as enchmarks. Intuitively, restricting the numer of applications that can e sent should reduce the numer of matches that form, ut also reduce the application costs paid y sellers and the screening costs paid y uyers (since applicants are less likely to already have another offer). We study these markets in the limit where the application cost c a approaches zero; this simplification is inspired y the fact that in most online markets, application costs are relatively low 8. Furthermore, Lemma 8 in the appendix states that m p is non-increasing in c a. Because (21) is 8 Although we elieve that this is a well-motivated regime, it is not much more difficult to analyze uyer and seller welfare for fixed positive application costs. We are happy to provide figures to this effect upon request. 15

16 1.0 c' A B C Figure 1: A depiction of the three regions identified in this paper. In region A, sellers are scarce or screening costs are high, while in region C screening costs are small and sellers relatively aundant. r increasing in m p, so this implies that seller welfare is non-increasing in c a. Thus, the limit where c a 0 provides an upper ound for seller welfare with any positive c a. We define Π = lim c a 0 Π, Π s = lim ca 0 Π s. (25) Π l = lim c a 0 Πl, Πl s = lim ca 0 Πl s. (26) One key insight is that, we can decompose the parameter space into three regions depending on the value of c and r. Define the functions f 1 (r) and f 2 (r) as follows: We define the following three regions: { 0 if r 1; f 1 (r) = (27) r 1 r if r > 1; { 0 if r 1; f 2 (r) = g(log r r 1 ) if r > 1. (28) A = {(c, r) : c > f 2 (r)}; (29) B = {(c, r) : f 1 (r) < c f 2 (r)}; (30) C = {(c, r) : c f 1 (r)}. (31) These are depicted in Figure 1. Qualitatively, these three regions capture the different ranges of ehavior we can find in the regulated and unregulated markets. Informally, we have the following main oservations. Remark 1 (Main insights). 1. In Region A, the screening costs are relatively high and/or sellers are relatively scarce. In this region, in the unregulated market, uyers otain zero welfare, while in a suitaly regulated market, uyers earn the upper ound (22) on their welfare. 16

17 2. In Region B, although the screening costs are still relatively high, uyers earn positive welfare in the unregulated market; however, uyers can again earn the upper ound (22) in a suitaly regulated market. 3. In Region C, regulation does not help uyers: r is large enough that availaility is not a pressing concern, so y limiting applications we only hurt uyer welfare. 4. In all regions, we can improve seller welfare y a constant fraction y regulating the market. This is surprising, ecause we are already considering a regime where c a 0. Further, this effect can e quite significant: for example, when r 1.4, we can improve seller welfare y a factor of two y limiting applications. Returning to our discussion of odesk in the Introduction, recall that on odesk the most talented freelancers are scarce, and so invitations often fail due to a lack of availaility. In our model, this corresponds to region A, where the consequences of regulation are perhaps most dramatic: uyer (client) welfare can e raised from zero to the upper ound (22). This is especially surprising, since it is exactly where sellers (freelancers) are relatively scarce. In the following three susections, we descrie in greater detail the performance of the market in these three regions. We summarize our insights through three numerical examples in Figure Region A In this regime, screening costs are relatively high, and/or sellers are relatively scarce. The following proposition summarizes the ehavior of oth the regulated and unregulated market in Region A. Proposition 4. Suppose that (c, r) A. As c a 0 the following limits hold: 1. Buyers. Π = 0, i.e., uyers earn zero surplus in the unregulated market. On the other hand, there exists l such that in the regulated market with application limit l, Π l = r(v u)(1 c + c log c ) (i.e., the upper ound in (22)). 2. Sellers. Π s = w(1 e γ )(1 e γ /c ) in the unregulated market. On the other hand, there exists l such that in the regulated market with application limit l, we have Π l s = w(1 e γ ). From this proposition, we see that in the unregulated market, uyers earn zero welfare. When sellers send many applications, they ecome very unlikely to e availale, and uyer surplus drops to zero (i.e., the uyer individual rationality constraint inds). As a result, some uyers effectively choose not to enter the market. However, y suitaly regulating the market, we are ale to significantly increase uyer welfare all the way to the upper ound given in (22). 17

18 Recall that sellers can match with proaility at most 1 e γ, due to the fact that applicant availaility must e at least c. Nevertheless, in the unregulated market sellers lose an additional constant fraction of e γ /c of their potential surplus in application costs. The magnitude of this loss depends on the screening cost: the fact that uyers are reluctant to screen forces sellers to lose welfare y over-applying. By limiting applications, we can eliminate this welfare loss, so that sellers earn a surplus of w(1 e γ ), matching the upper ound (22). 6.4 Region B In this regime, screening costs are high and/or sellers are scarce, ut not to the same degree as in Region A. The following proposition summarizes the ehavior of oth the regulated and unregulated market in Region B. Proposition 5. Suppose that (c, r) B. As c a 0 the following limits hold: 1. Buyers. In the unregulated market, there holds: Π = (v u) (1 c r ln ) r. (32) r 1 On the other hand, there exists l such that in the regulated market with application limit l, Π l = r(v u)(1 c + c log c ) (i.e., the upper ound in (22)). 2. Sellers. In the unregulated market, there holds: Π s = w r ( ( )) r 1 (r 1) ln. (33) r 1 On the other hand, for any ε > 0, there exists l such that in the regulated market with application limit l, Π l s = w/r ε. From this proposition, we see that in the unregulated market, uyers earn positive surplus this is of course a significant improvement over Region A, and implies that all uyers screen. Nevertheless, we can improve uyer welfare y limiting applications, ecause screening costs and/or seller scarcity are still causing uyers to lose surplus to over-screening. In particular, a suitale choice of l can again increase uyer surplus all the way to the upper ound given in (22). For the sellers, the story is qualitatively similar to region A. Note that sellers can match with proaility no greater than 1/r, since r 1 in this region. In the unregulated market, sellers match with exactly this proaility; however, they over-apply, and do not internalize the externality their applications create on other sellers. In particular, this over-application causes sellers to again lose a constant fraction of their surplus. We can ring their surplus aritrarily close to w/r y suitaly limiting applications. 18

19 Π ~ l Π ~ l s Π ~ * Π ~ * s Application Limit Π ~ l Π ~ l s Π ~ * Π ~ * s Application Limit Π ~ l Π ~ l s Π ~ * Π ~ * s Application Limit Figure 2: Welfare in the regulated market as a function of the application limit l. The horizontal lines represent welfare in the unregulated market. We fix three choices of (r, β, c ), while letting c a In the graph on the left, (r, β, c ) = (0.8, 0.5, 0.2), so that we are in region A. Oserve that we can significantly improve uyer welfare at very little cost to sellers, e.g., y choosing l = 10. On the other hand, regulating the market can also help the sellers, provided we choose a large enough l. In the center graph, (r, β, c ) = (1.05, 0.5, 0.2), so that we are in region B. In this region we can help uyers, though of course not y as much as in Region A. Again, in this region regulation helps sellers, as expected. In the graph on the right, (r, β, c ) = (1.5, 0.5, 0.1), so that we are in region C. In this region we cannot help uyers y limiting applications, ut we can significantly improve seller surplus. In this example, sellers give up approximately half of their match surplus y over-applying in the unregulated market, even as c a Region C In this regime, screening costs are relatively low and there is an adequate supply of sellers, so that availaility never ecomes a pressing concern. The following proposition summarizes the ehavior of oth the regulated and unregulated market in Region C. Proposition 6. Suppose that (c, r) C. As c a 0 the following limits hold: 1. Buyers. In the unregulated market, (32) holds. On the other hand, for any regulated market with application limit l, Π l < Π. 2. Sellers. In the unregulated market, (33) holds. On the other hand, for any ε > 0, there exists l such that in the regulated market with application limit l, we have Π l s > w/r ε. The first part of this proposition states that in the unregulated market, uyer welfare reaches the same limit as in Region B when c a 0. Interestingly, in this case, we cannot improve uyer welfare y limiting seller applications; uyers are already doing as well as they can. To understand this, we return to (20). Maximizing the right hand side with respect to m p yields e m p = c. In other words, to achieve the upper ound in (22), sellers would need to match with proaility 1 c. However, when r > 1, the proaility that a seller matches at most 1/r. Thus if 1 c > 1/r, i.e., c < f 1 (r), we can do no etter than to have sellers match with proaility 1/r. This is exactly what we otain in the unregulated market. 19

20 The second half of this proposition is the same as in Region B: we can improve seller surplus aritrarily close to w/r y limiting their applications appropriately. 7 Discussion We introduced and studied a dynamic model of a decentralized two-sided market where it is costly to identify a compatile match. We focus in particular on the fact that timing effects may cause agents to unknowingly waste effort evaluating potential match partners who are no longer availale. We found that the unregulated market generically performs poorly on agent welfare: The market is in a search-limited regime when there are few sellers or screening costs are high. In this regime uyers have zero welfare. The market operates in a demand-limited regime when there are many sellers and screening costs are low. In this regime the seller welfare is reduced significantly y application costs due to the negative externality that an application y a seller has on other sellers. In either case, placing suitale restrictions on the sending of applications can significantly enhance welfare for agents on at least one (and often oth) sides of the market. There are several aspects of our model that are notaly stylized, with the goal of otaining a tractale model that allows us to study availaility in a meaningful fashion. We riefly comment here on some of these aspects. First, in our model, the proaility of compatiility β is assumed to e constant across uyers and sellers. In practice, we expect that uyers do not look identical to sellers, and that sellers (or the platform) can direct applications to the most promising openings; in this case an application limit encourages sellers to apply to the openings for which they are the est fit. In our model, this could e captured y allowing β to vary (decrease) as m grows. The fact that limiting visiility helps even when applications are sent randomly y uninformed agents is somewhat surprising, and only strengthens our conviction in the potential enefits of this intervention. Second, our model is asymmetric, in the sense that only the sellers sumit applications, and only the uyers screen. Though this seems to capture the operation of many marketplaces, for some contexts it would e more satisfying to allow every agent the option of applying or screening. Our preliminary consideration of such a model suggests that all stale equiliria may involve screening y agents on only one side of the market. The intuition is that if many uyers look for a match via screening whereas few uyers sumit applications, this makes it less attractive for sellers to screen and more attractive for sellers to apply. We leave formalizing this for future work. Third, our model does not endogenize wages. Numerous papers (i.e. [23, 1, 20]) have oserved that endogenously determined wages can guide the market towards efficiency. These results do not extend to our setting directly. For example, in [23, 1], workers apply to a single firm, precluding the possiility that they might e unavailale. In [20], workers apply to multiple firms, ut efficiency crucially relies on the assumption that firms can (costlessly) contact all applicants to find one who is availale. This is roughly 20

MANAGING CONGESTION IN DYNAMIC MATCHING MARKETS

MANAGING CONGESTION IN DYNAMIC MATCHING MARKETS MANAGING CONGESTION IN DYNAMIC MATCHING MARKETS NICK ARNOSTI, RAMESH JOHARI, AND YASH KANORIA Astract. We construct a model of a decentralized two-sided matching market in which agents arrive and depart

More information

Minimum Wages, Employment and. Monopsonistic Competition

Minimum Wages, Employment and. Monopsonistic Competition Minimum Wages, Employment and Monopsonistic Competition V. Bhaskar Ted To University of Essex Bureau of Laor Statistics August 2003 Astract We set out a model of monopsonistic competition, where each employer

More information

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

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

More information

Competing Auctions. Glenn Ellison*, Drew Fudenberg**, and Markus Mobius** First draft: November 28, This draft: March 6, 2003

Competing Auctions. Glenn Ellison*, Drew Fudenberg**, and Markus Mobius** First draft: November 28, This draft: March 6, 2003 Competing Auctions Glenn Ellison, Drew Fudenerg, and Markus Moius First draft: Novemer 8, 00 This draft: March 6, 003 This paper studies the conditions under which two competing and otherwise identical

More information

Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games

Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games Oblivious Equilibrium: A Mean Field Approximation for Large-Scale Dynamic Games Gabriel Y. Weintraub, Lanier Benkard, and Benjamin Van Roy Stanford University {gweintra,lanierb,bvr}@stanford.edu Abstract

More information

Deceptive Advertising with Rational Buyers

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

More information

Asymmetric Information and Search Frictions: A Neutrality Result

Asymmetric Information and Search Frictions: A Neutrality Result Asymmetric Information and Search Frictions: A Neutrality Result Neel Rao University at Buffalo, SUNY August 26, 2016 Abstract This paper integrates asymmetric information between firms into a canonical

More information

Bargaining, Contracts, and Theories of the Firm. Dr. Margaret Meyer Nuffield College

Bargaining, Contracts, and Theories of the Firm. Dr. Margaret Meyer Nuffield College Bargaining, Contracts, and Theories of the Firm Dr. Margaret Meyer Nuffield College 2015 Course Overview 1. Bargaining 2. Hidden information and self-selection Optimal contracting with hidden information

More information

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES #A50 INTEGERS 14 (014) ON RATS SEQUENCES IN GENERAL BASES Johann Thiel Dept. of Mathematics, New York City College of Technology, Brooklyn, New York jthiel@citytech.cuny.edu Received: 6/11/13, Revised:

More information

Mortenson Pissarides Model

Mortenson Pissarides Model Mortenson Pissarides Model Prof. Lutz Hendricks Econ720 November 22, 2017 1 / 47 Mortenson / Pissarides Model Search models are popular in many contexts: labor markets, monetary theory, etc. They are distinguished

More information

Chaos and Dynamical Systems

Chaos and Dynamical Systems Chaos and Dynamical Systems y Megan Richards Astract: In this paper, we will discuss the notion of chaos. We will start y introducing certain mathematical concepts needed in the understanding of chaos,

More information

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2 Least squares: Mathematical theory Below we provide the "vector space" formulation, and solution, of the least squares prolem. While not strictly necessary until we ring in the machinery of matrix algera,

More information

Under-Employment and the Trickle-Down of Unemployment - Online Appendix Not for Publication

Under-Employment and the Trickle-Down of Unemployment - Online Appendix Not for Publication Under-Employment and the Trickle-Down of Unemployment - Online Appendix Not for Publication Regis Barnichon Yanos Zylberberg July 21, 2016 This online Appendix contains a more comprehensive description

More information

Answers to Spring 2014 Microeconomics Prelim

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

More information

h Edition Money in Search Equilibrium

h Edition Money in Search Equilibrium In the Name of God Sharif University of Technology Graduate School of Management and Economics Money in Search Equilibrium Diamond (1984) Navid Raeesi Spring 2014 Page 1 Introduction: Markets with Search

More information

Selecting Efficient Correlated Equilibria Through Distributed Learning. Jason R. Marden

Selecting Efficient Correlated Equilibria Through Distributed Learning. Jason R. Marden 1 Selecting Efficient Correlated Equilibria Through Distributed Learning Jason R. Marden Abstract A learning rule is completely uncoupled if each player s behavior is conditioned only on his own realized

More information

1 Hoeffding s Inequality

1 Hoeffding s Inequality Proailistic Method: Hoeffding s Inequality and Differential Privacy Lecturer: Huert Chan Date: 27 May 22 Hoeffding s Inequality. Approximate Counting y Random Sampling Suppose there is a ag containing

More information

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

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

More information

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

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

More information

The Impact of Organizer Market Structure on Participant Entry Behavior in a Multi-Tournament Environment

The Impact of Organizer Market Structure on Participant Entry Behavior in a Multi-Tournament Environment The Impact of Organizer Market Structure on Participant Entry Behavior in a Multi-Tournament Environment Timothy Mathews and Soiliou Daw Namoro Abstract. A model of two tournaments, each with a field of

More information

RATIONAL EXPECTATIONS AND THE COURNOT-THEOCHARIS PROBLEM

RATIONAL EXPECTATIONS AND THE COURNOT-THEOCHARIS PROBLEM RATIONAL EXPECTATIONS AND THE COURNOT-THEOCHARIS PROBLEM TÖNU PUU Received 18 April 006; Accepted 1 May 006 In dynamic models in economics, often rational expectations are assumed. These are meant to show

More information

Structuring Unreliable Radio Networks

Structuring Unreliable Radio Networks Structuring Unreliale Radio Networks Keren Censor-Hillel Seth Gilert Faian Kuhn Nancy Lynch Calvin Newport March 29, 2011 Astract In this paper we study the prolem of uilding a connected dominating set

More information

Module 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers

Module 9: Further Numbers and Equations. Numbers and Indices. The aim of this lesson is to enable you to: work with rational and irrational numbers Module 9: Further Numers and Equations Lesson Aims The aim of this lesson is to enale you to: wor with rational and irrational numers wor with surds to rationalise the denominator when calculating interest,

More information

Dating and Divorce. Li, Hao and Sergei Severinov Vancouver School of Economics University of British Columbia. August 9, 2018.

Dating and Divorce. Li, Hao and Sergei Severinov Vancouver School of Economics University of British Columbia. August 9, 2018. Dating and Divorce Li, Hao and Sergei Severinov Vancouver School of Economics University of British Columbia August 9, 2018 Abstract We introduce private information in an otherwise standard search and

More information

Polynomial Degree and Finite Differences

Polynomial Degree and Finite Differences CONDENSED LESSON 7.1 Polynomial Degree and Finite Differences In this lesson, you Learn the terminology associated with polynomials Use the finite differences method to determine the degree of a polynomial

More information

The Firm-Growth Imperative: A Theory of Production and Personnel Management

The Firm-Growth Imperative: A Theory of Production and Personnel Management The Firm-Growth Imperative: A Theory of Production and Personnel Management Rongzhu Ke Hong Kong Baptist University Jin Li London School of Economics Michael Powell Kellogg School of Management Management

More information

Online Appendix to Asymmetric Information and Search Frictions: A Neutrality Result

Online Appendix to Asymmetric Information and Search Frictions: A Neutrality Result Online Appendix to Asymmetric Information and Search Frictions: A Neutrality Result Neel Rao University at Buffalo, SUNY August 26, 2016 Abstract The online appendix extends the analysis to the case where

More information

Moral Hazard: Part 1. April 9, 2018

Moral Hazard: Part 1. April 9, 2018 Moral Hazard: Part 1 April 9, 2018 Introduction In a standard moral hazard problem, the agent A is characterized by only one type. As with adverse selection, the principal P wants to engage in an economic

More information

An adaptation of Pissarides (1990) by using random job destruction rate

An adaptation of Pissarides (1990) by using random job destruction rate MPRA Munich Personal RePEc Archive An adaptation of Pissarides (990) by using random job destruction rate Huiming Wang December 2009 Online at http://mpra.ub.uni-muenchen.de/203/ MPRA Paper No. 203, posted

More information

Math 216 Second Midterm 28 March, 2013

Math 216 Second Midterm 28 March, 2013 Math 26 Second Midterm 28 March, 23 This sample exam is provided to serve as one component of your studying for this exam in this course. Please note that it is not guaranteed to cover the material that

More information

EC476 Contracts and Organizations, Part III: Lecture 2

EC476 Contracts and Organizations, Part III: Lecture 2 EC476 Contracts and Organizations, Part III: Lecture 2 Leonardo Felli 32L.G.06 19 January 2015 Moral Hazard: Consider the contractual relationship between two agents (a principal and an agent) The principal

More information

The Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line

The Mean Version One way to write the One True Regression Line is: Equation 1 - The One True Line Chapter 27: Inferences for Regression And so, there is one more thing which might vary one more thing aout which we might want to make some inference: the slope of the least squares regression line. The

More information

arxiv: v1 [cs.gt] 4 May 2015

arxiv: v1 [cs.gt] 4 May 2015 Econometrics for Learning Agents DENIS NEKIPELOV, University of Virginia, denis@virginia.edu VASILIS SYRGKANIS, Microsoft Research, vasy@microsoft.com EVA TARDOS, Cornell University, eva.tardos@cornell.edu

More information

Rollout Policies for Dynamic Solutions to the Multi-Vehicle Routing Problem with Stochastic Demand and Duration Limits

Rollout Policies for Dynamic Solutions to the Multi-Vehicle Routing Problem with Stochastic Demand and Duration Limits Rollout Policies for Dynamic Solutions to the Multi-Vehicle Routing Prolem with Stochastic Demand and Duration Limits Justin C. Goodson Jeffrey W. Ohlmann Barrett W. Thomas Octoer 2, 2012 Astract We develop

More information

Crowdsourcing contests

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

More information

Mathematical Ideas Modelling data, power variation, straightening data with logarithms, residual plots

Mathematical Ideas Modelling data, power variation, straightening data with logarithms, residual plots Kepler s Law Level Upper secondary Mathematical Ideas Modelling data, power variation, straightening data with logarithms, residual plots Description and Rationale Many traditional mathematics prolems

More information

Essential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March.

Essential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March. Essential Maths 1 The information in this document is the minimum assumed knowledge for students undertaking the Macquarie University Masters of Applied Finance, Graduate Diploma of Applied Finance, and

More information

arxiv: v1 [math.oc] 28 Jun 2016

arxiv: v1 [math.oc] 28 Jun 2016 On the Inefficiency of Forward Markets in Leader-Follower Competition Desmond Cai, Anish Agarwal, Adam Wierman arxiv:66.864v [math.oc] 8 Jun 6 June 9, 6 Abstract Motivated by electricity markets, this

More information

Recovery Dynamics: An Explanation from Bank Screening and Entrepreneur Entry

Recovery Dynamics: An Explanation from Bank Screening and Entrepreneur Entry Recovery Dynamics: An Explanation from Bank Screening and Entrepreneur Entry Novemer 12, 2016 Astract Economic recoveries can e slow, fast, or involve doule dips. This paper provides an explanation ased

More information

Section 8.5. z(t) = be ix(t). (8.5.1) Figure A pendulum. ż = ibẋe ix (8.5.2) (8.5.3) = ( bẋ 2 cos(x) bẍ sin(x)) + i( bẋ 2 sin(x) + bẍ cos(x)).

Section 8.5. z(t) = be ix(t). (8.5.1) Figure A pendulum. ż = ibẋe ix (8.5.2) (8.5.3) = ( bẋ 2 cos(x) bẍ sin(x)) + i( bẋ 2 sin(x) + bẍ cos(x)). Difference Equations to Differential Equations Section 8.5 Applications: Pendulums Mass-Spring Systems In this section we will investigate two applications of our work in Section 8.4. First, we will consider

More information

Optimal Insurance of Search Risk

Optimal Insurance of Search Risk Optimal Insurance of Search Risk Mikhail Golosov Yale University and NBER Pricila Maziero University of Pennsylvania Guido Menzio University of Pennsylvania and NBER November 2011 Introduction Search and

More information

Labor Economics, Lecture 11: Partial Equilibrium Sequential Search

Labor Economics, Lecture 11: Partial Equilibrium Sequential Search Labor Economics, 14.661. Lecture 11: Partial Equilibrium Sequential Search Daron Acemoglu MIT December 6, 2011. Daron Acemoglu (MIT) Sequential Search December 6, 2011. 1 / 43 Introduction Introduction

More information

Game Theory and Rationality

Game Theory and Rationality April 6, 2015 Notation for Strategic Form Games Definition A strategic form game (or normal form game) is defined by 1 The set of players i = {1,..., N} 2 The (usually finite) set of actions A i for each

More information

Merging and splitting endowments in object assignment problems

Merging and splitting endowments in object assignment problems Merging and splitting endowments in oject assignment prolems Nanyang Bu, Siwei Chen, and William Thomson April 26, 2012 1 Introduction We consider a group of agents, each endowed with a set of indivisile

More information

Organizational Barriers to Technology Adoption: Evidence from Soccer-Ball Producers in Pakistan

Organizational Barriers to Technology Adoption: Evidence from Soccer-Ball Producers in Pakistan Organizational Barriers to Technology Adoption: Evidence from Soccer-Ball Producers in Pakistan David Atkin, Azam Chaudhry, Shamyla Chaudry Amit K. Khandelwal and Eric Verhoogen Sept. 016 Appendix B: Theory

More information

A Centralized or a Decentralized Labor Market?

A Centralized or a Decentralized Labor Market? ömmföäflsäafaäsflassflassflas ffffffffffffffffffffffffffffffffff Discussion Papers A Centralized or a Decentralized Labor Market? Juha Virrankoski Aalto University and HECER Discussion Paper No. 42 November

More information

The Local Best Response Criterion: An Epistemic Approach to Equilibrium Refinement. Herbert Gintis

The Local Best Response Criterion: An Epistemic Approach to Equilibrium Refinement. Herbert Gintis The Local Best Response Criterion: An Epistemic Approach to Equilirium Refinement Herert Gintis May 2, 2008 Astract The standard refinement criteria for extensive form games, including sugame perfect,

More information

Are Obstinacy and Threat of Leaving the Bargaining Table Wise Tactics in Negotiations?

Are Obstinacy and Threat of Leaving the Bargaining Table Wise Tactics in Negotiations? Are Obstinacy and Threat of Leaving the Bargaining Table Wise Tactics in Negotiations? Selçuk Özyurt Sabancı University Very early draft. Please do not circulate or cite. Abstract Tactics that bargainers

More information

Persuading a Pessimist

Persuading a Pessimist Persuading a Pessimist Afshin Nikzad PRELIMINARY DRAFT Abstract While in practice most persuasion mechanisms have a simple structure, optimal signals in the Bayesian persuasion framework may not be so.

More information

Using Markov Chains To Model Human Migration in a Network Equilibrium Framework

Using Markov Chains To Model Human Migration in a Network Equilibrium Framework Using Markov Chains To Model Human Migration in a Network Equilibrium Framework Jie Pan Department of Mathematics and Computer Science Saint Joseph s University Philadelphia, PA 19131 Anna Nagurney School

More information

Definitions and Proofs

Definitions and Proofs Giving Advice vs. Making Decisions: Transparency, Information, and Delegation Online Appendix A Definitions and Proofs A. The Informational Environment The set of states of nature is denoted by = [, ],

More information

Non-Linear Regression Samuel L. Baker

Non-Linear Regression Samuel L. Baker NON-LINEAR REGRESSION 1 Non-Linear Regression 2006-2008 Samuel L. Baker The linear least squares method that you have een using fits a straight line or a flat plane to a unch of data points. Sometimes

More information

Critical value of the total debt in view of the debts. durations

Critical value of the total debt in view of the debts. durations Critical value of the total det in view of the dets durations I.A. Molotov, N.A. Ryaova N.V.Pushov Institute of Terrestrial Magnetism, the Ionosphere and Radio Wave Propagation, Russian Academy of Sciences,

More information

3. Partial Equilibrium under Imperfect Competition Competitive Equilibrium

3. Partial Equilibrium under Imperfect Competition Competitive Equilibrium 3. Imperfect Competition 3. Partial Equilirium under Imperfect Competition Competitive Equilirium Partial equilirium studies the existence of equilirium in the market of a given commodity and analyzes

More information

Price and Capacity Competition

Price and Capacity Competition Price and Capacity Competition Daron Acemoglu, Kostas Bimpikis, and Asuman Ozdaglar October 9, 2007 Abstract We study the efficiency of oligopoly equilibria in a model where firms compete over capacities

More information

The key is that there are two disjoint populations, and everyone in the market is on either one side or the other

The key is that there are two disjoint populations, and everyone in the market is on either one side or the other Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 17 So... two-sided matching markets. First off, sources. I ve updated the syllabus for the next few lectures. As always, most of the papers

More information

Adverse Selection, Signaling, and Screening in Markets

Adverse Selection, Signaling, and Screening in Markets BGPE Intensive Course: Contracts and Asymmetric Information Adverse Selection, Signaling, and Screening in Markets Anke Kessler Anke Kessler p. 1/27 Stylized Facts: Market Failure used cars, even if they

More information

Mean field equilibria of multiarmed bandit games

Mean field equilibria of multiarmed bandit games Mean field equilibria of multiarmed bandit games Ramesh Johari Stanford University Joint work with Ramki Gummadi (Stanford University) and Jia Yuan Yu (IBM Research) A look back: SN 2000 2 Overview What

More information

Two-sided investments and matching with multi-dimensional cost types and attributes

Two-sided investments and matching with multi-dimensional cost types and attributes Two-sided investments and matching with multi-dimensional cost types and attributes Deniz Dizdar 1 1 Department of Economics, University of Montréal September 15, 2014 1/33 Investments and matching 2/33

More information

Social Learning with Endogenous Network Formation

Social Learning with Endogenous Network Formation Social Learning with Endogenous Network Formation Yangbo Song November 10, 2014 Abstract I study the problem of social learning in a model where agents move sequentially. Each agent receives a private

More information

Diamond-Mortensen-Pissarides Model

Diamond-Mortensen-Pissarides Model Diamond-Mortensen-Pissarides Model Dongpeng Liu Nanjing University March 2016 D. Liu (NJU) DMP 03/16 1 / 35 Introduction Motivation In the previous lecture, McCall s model was introduced McCall s model

More information

Adverse selection, signaling & screening

Adverse selection, signaling & screening , signaling & screening Applications of game theory 2 Department of Economics, University of Oslo ECON5200 Fall 2009 Seller Buyer Situation 1: Symmetric info One market 1 2 prob high quality 1 2 prob high

More information

Directed Search with Multiple Job Applications. Manolis Galenianos, Philipp A. Kircher

Directed Search with Multiple Job Applications. Manolis Galenianos, Philipp A. Kircher ÓÒÒ ÓÒ Ù ÓÒ È Ô Ö Discussion Paper 20/2005 Directed Search with Multiple Job Applications by Manolis Galenianos, Philipp A. Kircher June 2005 ÓÒÒ Ö Ù Ø Ë ÓÓÐ Ó ÓÒÓÑ Ô ÖØÑ ÒØ Ó ÓÒÓÑ ÍÒ Ú Ö ØÝ Ó ÓÒÒ Ò Ù

More information

Upper Bounds for Stern s Diatomic Sequence and Related Sequences

Upper Bounds for Stern s Diatomic Sequence and Related Sequences Upper Bounds for Stern s Diatomic Sequence and Related Sequences Colin Defant Department of Mathematics University of Florida, U.S.A. cdefant@ufl.edu Sumitted: Jun 18, 01; Accepted: Oct, 016; Pulished:

More information

ALTERNATIVE SPECIFICATIONS OF MULTIPLICATIVE RISK PREMIA

ALTERNATIVE SPECIFICATIONS OF MULTIPLICATIVE RISK PREMIA ALTERNATIVE SPECIFICATIONS OF MULTIPLICATIVE RISK PREMIA PAUL J. HEALY AND BRIAN W. ROGERS ABSTRACT. In a seminal paper, Pratt [1964] defined a risk premium for multiplicative risks, ut did not explore

More information

arxiv: v1 [hep-ph] 20 Dec 2012

arxiv: v1 [hep-ph] 20 Dec 2012 Decemer 21, 2012 UMD-PP-012-027 Using Energy Peaks to Count Dark Matter Particles in Decays arxiv:1212.5230v1 [hep-ph] 20 Dec 2012 Kaustuh Agashe a, Roerto Franceschini a, Doojin Kim a, and Kyle Wardlow

More information

Evidence, eminence and extrapolation

Evidence, eminence and extrapolation Research Article Received 9 Decemer 204, Accepted 3 Decemer 205 Pulished online January 206 in Wiley Online Lirary wileyonlinelirary.com DOI: 0.002/sim.6865 Evidence, eminence and extrapolation Gerald

More information

A Summary of Economic Methodology

A Summary of Economic Methodology A Summary of Economic Methodology I. The Methodology of Theoretical Economics All economic analysis begins with theory, based in part on intuitive insights that naturally spring from certain stylized facts,

More information

Entry under an Information-Gathering Monopoly Alex Barrachina* June Abstract

Entry under an Information-Gathering Monopoly Alex Barrachina* June Abstract Entry under an Information-Gathering onopoly Alex Barrachina* June 2016 Abstract The effects of information-gathering activities on a basic entry model with asymmetric information are analyzed. In the

More information

Costly Social Learning and Rational Inattention

Costly Social Learning and Rational Inattention Costly Social Learning and Rational Inattention Srijita Ghosh Dept. of Economics, NYU September 19, 2016 Abstract We consider a rationally inattentive agent with Shannon s relative entropy cost function.

More information

1 Bewley Economies with Aggregate Uncertainty

1 Bewley Economies with Aggregate Uncertainty 1 Bewley Economies with Aggregate Uncertainty Sofarwehaveassumedawayaggregatefluctuations (i.e., business cycles) in our description of the incomplete-markets economies with uninsurable idiosyncratic risk

More information

Bayesian inference with reliability methods without knowing the maximum of the likelihood function

Bayesian inference with reliability methods without knowing the maximum of the likelihood function Bayesian inference with reliaility methods without knowing the maximum of the likelihood function Wolfgang Betz a,, James L. Beck, Iason Papaioannou a, Daniel Strau a a Engineering Risk Analysis Group,

More information

Question 1. (p p) (x(p, w ) x(p, w)) 0. with strict inequality if x(p, w) x(p, w ).

Question 1. (p p) (x(p, w ) x(p, w)) 0. with strict inequality if x(p, w) x(p, w ). University of California, Davis Date: August 24, 2017 Department of Economics Time: 5 hours Microeconomics Reading Time: 20 minutes PRELIMINARY EXAMINATION FOR THE Ph.D. DEGREE Please answer any three

More information

Branching Bisimilarity with Explicit Divergence

Branching Bisimilarity with Explicit Divergence Branching Bisimilarity with Explicit Divergence Ro van Glaeek National ICT Australia, Sydney, Australia School of Computer Science and Engineering, University of New South Wales, Sydney, Australia Bas

More information

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY

UNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY UNIVERSITY OF NOTTINGHAM Discussion Papers in Economics Discussion Paper No. 0/06 CONSISTENT FIRM CHOICE AND THE THEORY OF SUPPLY by Indraneel Dasgupta July 00 DP 0/06 ISSN 1360-438 UNIVERSITY OF NOTTINGHAM

More information

Generalized Sampling and Variance in Counterfactual Regret Minimization

Generalized Sampling and Variance in Counterfactual Regret Minimization Generalized Sampling and Variance in Counterfactual Regret Minimization Richard Gison and Marc Lanctot and Neil Burch and Duane Szafron and Michael Bowling Department of Computing Science, University of

More information

Design Patent Damages under Sequential Innovation

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

More information

Area I: Contract Theory Question (Econ 206)

Area I: Contract Theory Question (Econ 206) Theory Field Exam Summer 2011 Instructions You must complete two of the four areas (the areas being (I) contract theory, (II) game theory A, (III) game theory B, and (IV) psychology & economics). Be sure

More information

A Shapley Value Analysis to Coordinate the Formation of Procurement Networks

A Shapley Value Analysis to Coordinate the Formation of Procurement Networks Proceedings of the 3rd Annual IEEE Conference on Automation Science and Engineering Scottsdale, AZ, USA, Sept 22-25, 2007 MoRP-B02.3 A Shapley Value Analysis to Coordinate the Formation of Procurement

More information

University of Toronto Department of Economics. Applications and Interviews: Firms' Recruiting Decisions in a Frictional Labor Market

University of Toronto Department of Economics. Applications and Interviews: Firms' Recruiting Decisions in a Frictional Labor Market University of Toronto Department of Economics Working Paper 522 Applications and Interviews: Firms' Recruiting Decisions in a Frictional Labor Market By Ronald Wolthoff November 10, 2014 Applications and

More information

Load Balancing Congestion Games and their Asymptotic Behavior

Load Balancing Congestion Games and their Asymptotic Behavior Load Balancing Congestion Games and their Asymptotic Behavior Eitan Altman, Corinne Touati Inria CRS, LIG, Univ. Grenole Alpes, LIG, F-38000 Grenole, France Email: {eitan.altman, corinne.touati}@inria.fr

More information

Strongly rational expectations equilibria with endogenous acquisition of information

Strongly rational expectations equilibria with endogenous acquisition of information Strongly rational expectations equilibria with endogenous acquisition of information Gabriel Desgranges Maik Heinemann 9 February 004 This paper analyzes conditions for existence of a strongly rational

More information

Regulation of Stock Externalities with Correlated Costs

Regulation of Stock Externalities with Correlated Costs Regulation of Stock Externalities with Correlated Costs Larry Karp and Jiangfeng Zhang January 23, 2003 Astract We study a dynamic regulation model where firms actions contriute to a stock externality.

More information

3 Intertemporal Risk Aversion

3 Intertemporal Risk Aversion 3 Intertemporal Risk Aversion 3. Axiomatic Characterization This section characterizes the invariant quantity found in proposition 2 axiomatically. The axiomatic characterization below is for a decision

More information

Directed Search with Multiple Vacancies

Directed Search with Multiple Vacancies Directed Search with Multiple Vacancies Benjamin Lester University of Western Ontario July 9, 2008 Abstract Preliminary and incomplete: please do not circulate. Contact: blester@uwo.ca. I would like to

More information

Introduction. 1 University of Pennsylvania, Wharton Finance Department, Steinberg Hall-Dietrich Hall, 3620

Introduction. 1 University of Pennsylvania, Wharton Finance Department, Steinberg Hall-Dietrich Hall, 3620 May 16, 2006 Philip Bond 1 Are cheap talk and hard evidence both needed in the courtroom? Abstract: In a recent paper, Bull and Watson (2004) present a formal model of verifiability in which cheap messages

More information

2. What is the fraction of aggregate savings due to the precautionary motive? (These two questions are analyzed in the paper by Ayiagari)

2. What is the fraction of aggregate savings due to the precautionary motive? (These two questions are analyzed in the paper by Ayiagari) University of Minnesota 8107 Macroeconomic Theory, Spring 2012, Mini 1 Fabrizio Perri Stationary equilibria in economies with Idiosyncratic Risk and Incomplete Markets We are now at the point in which

More information

Economic Growth: Lecture 8, Overlapping Generations

Economic Growth: Lecture 8, Overlapping Generations 14.452 Economic Growth: Lecture 8, Overlapping Generations Daron Acemoglu MIT November 20, 2018 Daron Acemoglu (MIT) Economic Growth Lecture 8 November 20, 2018 1 / 46 Growth with Overlapping Generations

More information

HarperCollinsPublishers Ltd

HarperCollinsPublishers Ltd Guidance on the use of codes for this mark scheme M A C P cao oe ft Method mark Accuracy mark Working mark Communication mark Process, proof or justification mark Correct answer only Or equivalent Follow

More information

The Harris-Todaro model

The Harris-Todaro model Yves Zenou Research Institute of Industrial Economics July 3, 2006 The Harris-Todaro model In two seminal papers, Todaro (1969) and Harris and Todaro (1970) have developed a canonical model of rural-urban

More information

Simple Examples. Let s look at a few simple examples of OI analysis.

Simple Examples. Let s look at a few simple examples of OI analysis. Simple Examples Let s look at a few simple examples of OI analysis. Example 1: Consider a scalar prolem. We have one oservation y which is located at the analysis point. We also have a ackground estimate

More information

Exact and Approximate Equilibria for Optimal Group Network Formation

Exact and Approximate Equilibria for Optimal Group Network Formation Exact and Approximate Equilibria for Optimal Group Network Formation Elliot Anshelevich and Bugra Caskurlu Computer Science Department, RPI, 110 8th Street, Troy, NY 12180 {eanshel,caskub}@cs.rpi.edu Abstract.

More information

Discussion of "Persuasion in Global Games with an Application to Stress Testing" by Nicolas Inostroza and Alessandro Pavan

Discussion of Persuasion in Global Games with an Application to Stress Testing by Nicolas Inostroza and Alessandro Pavan Discussion of "Persuasion in Global Games with an Application to Stress Testing" by Nicolas Inostroza and Alessandro Pavan Stephen Morris IUB Stern Workshop March 2017 Basic Question Some policy ingredients:

More information

Lecture Notes: Industrial Organization Joe Chen 1. The Structure Conduct Performance (SCP) paradigm:

Lecture Notes: Industrial Organization Joe Chen 1. The Structure Conduct Performance (SCP) paradigm: Joe Chen 1 1 Introduction 1.1 The Beginning Joe Bain and Edward Mason (the Harvard tradition): Empirical in nature (loose theories) The Structure Conduct Performance (SCP) paradigm: Structure (market structure):

More information

B Search and Rest Unemployment Fernando Alvarez and Robert Shimer Additional Appendixes not for Publication

B Search and Rest Unemployment Fernando Alvarez and Robert Shimer Additional Appendixes not for Publication B Search and Rest Unemployment Fernando Alvarez and Robert Shimer Additional Appendixes not for Publication B.1 Derivation Hamilton-Jacobi-Bellman This appendix proves that if v() is given by: v() = R(

More information

arxiv: v1 [cs.gt] 16 Feb 2012

arxiv: v1 [cs.gt] 16 Feb 2012 Implementing Optimal Outcomes in Social Computing: A Game-Theoretic Approach arxiv:1202.3480v1 [cs.gt] 16 Feb 2012 Arpita Ghosh Yahoo! Research Santa Clara, CA, USA arpita@yahoo-inc.com February 17, 2012

More information

Genetic Algorithms applied to Problems of Forbidden Configurations

Genetic Algorithms applied to Problems of Forbidden Configurations Genetic Algorithms applied to Prolems of Foridden Configurations R.P. Anstee Miguel Raggi Department of Mathematics University of British Columia Vancouver, B.C. Canada V6T Z2 anstee@math.uc.ca mraggi@gmail.com

More information

Teoria das organizações e contratos

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

More information

ONLINE APPENDIX. Upping the Ante: The Equilibrium Effects of Unconditional Grants to Private Schools

ONLINE APPENDIX. Upping the Ante: The Equilibrium Effects of Unconditional Grants to Private Schools ONLINE APPENDIX Upping the Ante: The Equilibrium Effects of Unconditional Grants to Private Schools T. Andrabi, J. Das, A.I. Khwaja, S. Ozyurt, and N. Singh Contents A Theory A.1 Homogeneous Demand.................................

More information

1 Definitions and Things You Know

1 Definitions and Things You Know We will discuss an algorithm for finding stable matchings (not the one you re probably familiar with). The Instability Chaining Algorithm is the most similar algorithm in the literature to the one actually

More information