Published in the American Economic Review Volume 102, Issue 1, February 2012, pages doi: /aer

Size: px
Start display at page:

Download "Published in the American Economic Review Volume 102, Issue 1, February 2012, pages doi: /aer"

Transcription

1 Published in the American Economic Review Volume 102, Issue 1, February 2012, pages doi: /aer CONTRACTS VS. SALARIES IN MATCHING FEDERICO ECHENIQUE Abstract. Firms and workers may sign complex contracts that govern many aspects o their interactions. I show that when irms regard contracts as substitutes, bargaining over contracts can be understood as bargaining only over wages. Substitutes is the assumption commonly used to guarantee the existence o stable matchings o workers and irms. Workers and irms may bargain over general, multi-dimensional contracts; they may negotiate over health beneits, housing, retirement plans, etc. Substitutes, on the other hand, is the assumption commonly placed on irms preerences to guarantee the existence o stable matchings o workers and irms. In this note I show that, when irms regard contracts as substitutes, bargaining over contracts can be embedded into a model o bargaining over wages. The economics o the embedding is straightorward, except or a small twist. When a irm and a worker negotiate over a contract, they may bargain over many dimensions. However, the Pareto rontier o contracts is, in a sense, one-dimensional: what is better or the worker is worse or the irm. So Pareto optimal contracts may be viewed as salaries, with the better contracts or the irm meaning lower salaries, and the better contracts or the worker meaning higher salaries. The twist is that a irm s ranking over contracts might be aected by the irm s other hires. For example, health plan A may be better than B or a irm i it has many employees, but B beats A i it has ew. When contracts are substitutes, it turns out that the ranking is not aected in this way. Hatield and Milgrom (2005) present a model o two-sided workerirm matching with contracts. A irm will hire a collection o workers, and will negotiate a contract with each one o them. The model is a generalization o Kelso and Craword (1982), where each irm and each Division o the Humanities and Social Sciences, Caliornia Institute o Technology. ede@caltech.edu I thank Vince Craword, Flip Klijn, Scott Kominers, and Michael Ostrovsky or very useul comments. I am also very grateul to three anonymous reerees or their thoughtul questions and suggestions. 1

2 2 FEDERICO ECHENIQUE worker negotiate a wage. 1 Kelso and Craword show that, when irms demands satisy gross substitutes, the core o the matching market is nonempty. Hatield and Milgrom show that, when the irms preerences over contracts satisy their notion o substitutes, the core o the market is nonempty. I show that Hatield and Milgrom s model can be embedded into the model o Kelso and Craword. Hatield and Milgrom s assumption o substitutability enables an embedding where irms demands or workers satisy Kelso and Craword s notion o gross substitutes. As a result, the nonemptiness o the core ollows rom the argument in Kelso and Craword, and their salary adjustment algorithm inds a stable matching o workers to irms, and a vector o supporting salaries. Hatield and Milgrom s paper is an elegant analysis o two-sided matching. It simpliies matching models, and makes their relationship to auction models more transparent. Their paper contributes much more than showing the nonemptiness o the core when irms and workers can sign general contracts; and my result does not diminish their contribution in the least. I believe, however, that there is value in clariying the relationship between contracts and salaries. One step in that direction is taken by Hatield and Kojima (2010), who investigate conditions on preerences over contracts that are weaker than substitutes and still generate stable matchings. My embedding does not work under Hatield and Kojima s weaker conditions (see 2.3 below). Future research should explain the consequences o the added generality o contracts over salaries in dierent economic environments. A paper that seeks to extend some classical result on matching to matching with contracts would need to sort out to what extent allowing or contracts provides a more general result. It may be that contracts are not more general; which would not by itsel invalidate the exercise, but would be an important eature to understand. 1. Embedding 1.1. Deinitions. I shall describe two models. The model o a matching market with contracts with substitutable choices is due to Hatield and Milgrom (2005). The model o a matching market with salaries and gross substitutes in demand is due to Kelso and Craword (1982) Contracts. A matching market with contracts is described by: 1 Kelso and Craword build on the analysis o Craword and Knoer (1981); see Roth and Sotomayor (1990) or a description o the models.

3 CONTRACTS VS. SALARIES IN MATCHING 3 (inite, disjoint) sets W o workers, F o irms and X o contracts; each contract x X is assigned one worker x W W and one irm x F F ; or each worker w W, a utility unction u w : X { } R; and or each irm F, a utility unction u : 2 X R; all utility unctions are one-to-one (preerences are strict). A irm s utility unction determines a choice rule C : or A X, C (A) is the maximal subset o A according to u. Note that since u is one-to-one, C (A) is uniquely deined. The empty set represents or the option o hiring no workers. For notational convenience, I have not restricted the domain o u to contracts with = x F, but o course we want to sign contracts only in its own name; assume then that x C (A) implies = x F. Assume also that x, x C (A) implies x W x W. For a worker w, represents an outside option: a contract that is always available to her i she chooses to reject the contract some irm oers her. Suppose that i x W w then u w (x) < u w ( ). A set o contracts A is easible i, or all workers w, there is at most one x A with w = x W. A irm s utility satisies substitutability i, or any set o contracts A, and any two contracts x and x, x / C (A {x}) implies x / C (A {x, x }). The tuple (F, W, X, (u ), (u w )) describes a a matching market with contracts. A set o contracts A X is individually rational i, or all x A, u xw (x) u xw ( ); and or all irms, C (A) = {x A : = x F }. A set o contracts A X is stable i it is individually rational and i or any irm and set o contracts A A with A = C (A A ), there is one contract x A such that either u x W (x ) < u x W ( ) or there is x A with x W = x W and u x (x ) < u W x W (x) Salaries. A matching market with salaries is described by: (inite, disjoint) sets W o workers, F o irms, and S R + o salaries; or each worker w W, a utility unction v w : F { } S R; and or each irm F, a utility unction v : A W A S R; all utility unctions are one-to-one (preerences are strict). We can suppose that S is the set {0, 1,... L} o the irst L + 1 nonnegative integers, or some L. For a irm, v deines a demand unction D : S W 2 W by D (s) = argmax A W v ({(w, s w ) : w A}).

4 4 FEDERICO ECHENIQUE I restrict attention to demand unctions, not correspondences, by virtue o Hatield and Milgrom s assumption o strict preerences. Say that D satisies gross substitutes i, or any two vectors o salaries, s and s, i s s and s w = s w then w D(s) implies that w D(s ). A matching is a unction µ : W F { } S. A matching assigns to each worker a irm and a salary; I use the µ(w) = (, 0) notation or when w is unmatched (unemployed). A matching speciies, or each irm a collection o workers with their corresponding salaries: µ 0 () = {(w, s) : (, s) = µ(w)}. The set µ 0 () is thus the set o workers employed by, and their salaries, in the matching µ. The tuple (F, W, S, (v ), (v w )) describes a matching market with salaries. A matching µ is individually rational i, or every and w, v (µ 0 ()) v (B) or all B µ 0 () and v w (µ(w)) v w (, 0). A matching µ is stable i it is individually rational and i, or any irm and A W, i there is a vector o salaries (s w ) w A with v ({(w, s w ) : w A}) > v (µ 0 ()) then there is w A with v w (µ(w)) > v w (, s w ) Embedding. Let (F, W, X, (u ), (u w )) be a matching market with contracts, and (F, W, S, (v ), (v w )) a matching market with salaries. An embedding o (F, W, X, (u ), (u w )) into (F, W, S, (v ), (v w )) is a oneto-one unction g which maps each x X into a triple (x F, x W, s) F W S. Let g be such an embedding and A X. Say that g(a) deines a matching i or any w there is at most one s and with (, w, s) g(a). The matching deined by A under g is the unction µ : W F S deined by µ(w) = (, s) i g 1 (, w, s) A and µ(w) = (, 0) otherwise. Theorem 1. Let (F, W, X, (u ), (u w )) be a matching market with contracts. I irms choices satisy substitutability, then there is a matching market with salaries (F, W, S, (v ), (v w )), and an embedding g o (F, W, X, (u ), (u w )) into (F, W, S, (v ), (v w )) such that (1) irms demand unctions in (F, W, S, (v ), (v w )) satisy gross substitutes; (2) A X is a set o stable contracts i and only i g(a) deines a stable matching. The proo o Theorem 1 works by constructing an embedding. As suggested in the introduction, the Pareto rontier o contracts is onedimensional: what is better or the worker is worse or the irm. So

5 CONTRACTS VS. SALARIES IN MATCHING 5 Pareto optimal contracts may be translated into salaries, with the better contracts or the irm deining lower salaries, and the better contracts or the worker deining higher salaries. The problem is that a irm s ranking over contracts might be aected by the irm s other hires. For example, consider contracts x and x, both involving worker w and irm. Suppose that x is better than x or, and x is better than x or w; so we would map x into a lower salary than x. In the absence o substitutes, this mapping might be aected by the presence o other contracts. However, since x is rejected by when x is available, substitutes make sure that it will continue to be rejected when other workers and contracts are available. So the assumption o substitutes allows or the pairwise mapping o contracts into salaries to work globally, when all workers and irms are considered. The construction uses the salaries 1, 2, 3,...; but any other grid works in exactly the same way. Proo. Say that a contract x is dominated or x F and x W i there is a contract x with x F = x F, x W = x W, u x F (x ) > u xf (x) and u xw (x ) > u xw (x). Let X w be the set o all contracts x with x F = and x W = w that are not dominated or and w. Note that X w can be ordered by u w ; that is, I can enumerate the elements o X w as x 1,..., x Xw with u w(x i ) < u w (x i+1 ). Then I can write X w = {(w, s) : s = 1,..., X w } with the understanding that (w, s) corresponds to oering worker w the contract x s in X w. Note that s < s i and only i u ({w, s}) > u ({w, s }): by deinition, i s < s then u w (, s) < u w (, s ) so u ({w, s}) < u ({w, s }) would imply that (w, s) is dominated. Let K = max{ X w : F, w W } and S = {1, 2,..., K + 1}. For convenience, lets augment the contracts in X w to include (w, s) with X w < s K + 1. Assume that i s > X w then, or all A, (w, s) / C (A). The embedding g is the mapping that takes x X into (, w, s) with (w, s) being the representation o x in X w i x is not dominated, and into (x F, x F, K + 1) i it is. 2 Deine irms and workers utilities as ollows. Let v w (, s) = u w (x), where x X w corresponds to s. Let v ((w 1, s 1 ),..., (w n, s n )) = u ((w 1, s 1 ),..., (w n, s n )). For a vector o wages s = (s w ) w W S W, let X s X be the set o contracts (w, s w ). Deine a demand unction D or irm by D (s) = C (X s ) (this is consistent with our deinition o utility or ). 2 Strictly speaking, or dominated x we would need to set g(x) = (x F, x F, K + l), choosing l 1 so that g remains one-to-one.

6 6 FEDERICO ECHENIQUE I shall now prove that D satisies the GS property. Let X s+ = {(w, s) W S : s s w }, where s w denotes w s salary in s. I irst prove that C (X s) = C (X s+ ). I Xs+ = X s then there is nothing to prove. Let (w, s) X s+ \X s. There must exist some s, with s < s and (w, s ) X s+. Note that s < s implies (w, s) / C ({(w, s), (w, s )}) because u (w, s) < u (w, s ) and C ({(w, s), (w, s )}) cannot contain two contracts with the same worker. So {(w, s), (w, s )} X s+ implies, by the property o substitutability, that (w, s) / C (X s+ ). Thus I have shown that C (X s+ ) C (X s). Since Xs Xs+, the deinition o C implies that C (X s+ ) = C (X s). Now, let s = (s w ) and s = (s w) be vectors with s s while or w 0 W, s w0 = s w 0 and w 0 D (s). Suppose by way o contradiction that w 0 / D (s ). Then (w 0, s w 0 ) / C (X s ) = C (X s + ). But then X s + X s+ so substitutability implies that (w 0, s w 0 ) / C (X s+ ). Now, C (X s+ ) = C (X s) and (w 0, s w0 ) = (w 0, s w 0 ) implies that (w 0, s w0 ) / C (X s ), a contradiction. The proo that A is stable in (F, W, X, (u ), (u w )) i and only i g(a) is stable in (F, W, S, (v ), (v w )) is straightorward. 2. Discussion 2.1. Antecedents. The identiication o contracts and salaries is not new. Both Craword and Knoer (1981), and Kelso and Craword (1982), mention how salaries can be interpreted as contracts. Roth (1984), who presents an early model o matching with contracts, also identiies contracts with salaries. The new observation here is that substitutability is important or the identiication o contracts and salaries. It is not mentioned in the literature that ollows Hatield and Milgrom (2005) Quasilinearity. In Kelso and Craword, irms proits are quasilinear, but their existence proo is more general and does not depend on quasilinearity. One detail is that they require a salary that is high enough so no worker would be hired at that salary (see their Lemma 2). In the embedding in the theorem, we do have such a salary Bilateral substitutes. In a model o matching with contracts, Hatield and Kojima (2010) present a generalization o substitutes, called bilateral substitutes. They show stable matching with contracts exists under bilateral substitutes. Here I show that the model o Hatield-Kojima cannot be embedded into the Kelso-Craword model.

7 CONTRACTS VS. SALARIES IN MATCHING 7 The ollowing example is rom Hatield and Kojima (2010). Let the set o irms be {, }, the set o workers {w, w } and the set o contracts be {x, x, z, z, z }. Let x and x involve irm and worker w, while z and z involve worker w and irm. Contract z is between w and. Suppose that agents utilities are such that their preerences are: w w {x, z} {z } x z { z} x z { x} z {x} {z}. I have omitted the alternatives that are worse than. Suppose that there is a embedding, where x maps to the salary s x and x to the salary s x. Then x / C ({x, x}) means that s x > s x. This would imply that u (x W, z W, s x, s z ) < u ( x W, z W, s x, s z ), as x W = x W, which is incompatible with the preerences above. I should clariy that a deviation rom substitutes does not by itsel prevent the model with contracts rom being embeddable into a model with salaries. The structure o bilateral substitutes is interesting because it is a deviation rom substitutes or which existence is guaranteed Algorithm. Under the embedding, the algorithm proposed by Hatield and Milgrom (2005) is equivalent to the algorithm proposed by Kelso and Craword (1982). It is easy to see that they are equivalent because the two algorithms ind the same matching: the irm-optimal or the worker-optimal matching, depending on how the algorithms are ormulated. Here, I want to show that the algorithms not only calculate the same matchings, but that they also work in essentially the same way: the algorithms take equivalent routes to a stable matching. The Hatield- Milgrom algorithm starts by each irm oering the best contracts or, and the workers sequentially rejecting oers. In the embedding, the best contracts correspond to the lowest salaries; and, in a similar vein, the Kelso-Craword algorithm starts at the lowest salaries. In Hatield-Milgrom, when a contracts gets rejected, it is as i the salary or that worker is raised. Similarly, the Kelso-Craword algorithm works by raising the salaries o workers who reject an oer. Broadly speaking, the steps taken by the Hatield-Milgrom algorithm represent movements along the Pareto rontier o contracts; movements in

8 8 FEDERICO ECHENIQUE a direction which corresponds to higher salaries in the Kelso-Craword model. The ollowing example illustrates the point, and hopeully helps understand the nature o the embedding better. Suppose there are two irms and two workers: F = { 1, 2 } and W = {w 1, w 2 }. Let X = {x 1, x 3, x 2, y 1, y 2 } be the set o contracts. The agents preerences are: 1 2 w1 w2 {x 1 } {y 2 } x 3 y 1 {x 2 } {x 3 } x 2 {y 1 } x 1. The Hatield-Milgrom algorithm takes the steps in the ollowing table. I am using the same notation as Hatield-Milgrom: R W and R F are the rejected contracts o, respectively, workers and irms. X W R W (X W ) X F R F (X F ) 0) X {x 2, y 1, x 3 } 1) {x 1, y 2 } {y 2 } X {x 2, y 1, x 3 } 2) {x 1, y 2 } {y 2 } {x 1, x 2, x 3, y 1 } {x 2, y 1 } 3) {x 1, y 2, x 3 } {x 1, y 2 } {x 1, x 2, x 3, y 1 } {x 2, y 1 } 4) {x 1, y 2, x 3 } {x 1, y 2 } {x 2, x 3, y 1 } {y 1 } 5) {x 1, x 2, x 3, y 2 } {x 1, x 2, y 2 } {x 2, x 3, y 1 } {y 1 } 6) {x 1, x 2, x 3, y 2 } {x 1, x 2, y 2 } {x 3, y 1 } 7) X {x 1, x 2, y 2 } {x 3, y 1 } I shall interpret the iterations so as to simpliy the comparison with Kelso-Craword. In (0) irms oer contracts x 1 and y 2 (they reject contracts {x 2, y 1, x 3 }. In (1) the workers respond by w 1 temporarily accepting x 1, while w 2 rejects y 2. In (2) the irms oer x 1 and x 3. In (3) w 1 accepts x 3 and rejects x 2. In (4) 1 oers x 2 and 2 oers x 3. (5) w 1 rejects x 2. (6) 1 oers y 1 and 2 oers x 3. (7) the workers accept y 1 and x 3. We can embed this market with contracts into a market with salaries. Let the set o salaries be {1, 2}. The relevant part o the agents preerences are: 1 : (w 1, 1) (w 1, 2) (w 2, 1) 2 : (w 2, 1) (w 1, 1) w 1 : ( 2, 1) ( 1, 2) ( 1, 1) w 2 : ( 1, 1)

9 CONTRACTS VS. SALARIES IN MATCHING 9 So, irm 1 preers to hire w 1 at a lower rather than a higher salary; and preers to hire w 1 at either salary over hiring w 2 at a salary o 1. I omit, or example, that or w 1 ( 2, 2) ( 2, 1) because irm 2 is unwilling to hire w 1 at a salary o 2 (she preers to leave the position vacant). Kelso and Craword s algorithm does: w 1 w 2 0) ( 1, 1) ( 2, 1) 1) ( 1, 1)( 2, 1) 2) ( 1, 2)( 2, 1) 3) ( 2, 1) ( 1, 1) The meaning o the iterations is the ollowing. The algorithm starts with all salaries being 1. At his vector o salaries, 1 demands worker w 1 while 2 demands worker w 2. Worker w 2 rejects the oer o irm 2 while w 1 accept the oer rom 1 ; this is indicated by underlining the oer in the table. Since 2 s oer to w 2 was rejected, the salary or that pair increases to 2. At that salary, 2 decides not to oer to w 2 and instead demand w 1 at a salary o 1. The rest o the iterations should be intuitive. In any case, the steps are essentially those o the Hatield-Milgrom algorithm, where workers responses are included within each step in the Kelso-Craword algorithm, and as a separate step in Hatield-Milgrom. A general equivalence result is possible, but requires writing down an algorithm that interprets the steps o one algorithm in terms o the other Law o demand. In a matching model with contracts, a irm satisies the law o aggregate demand i A A implies C (A) C (A ). In a matching model with salaries, a irm satisies the law o aggregate demand i s s implies that D (s ) D (s). Using the embedding o Theorem 1, it is easy to show that i a irm satisies the law o aggregate demand in the matching model with contracts, then it satisies the law o aggregate demand in the embedded matching model with salaries. Reerences Craword, Vincent P. and Elsie M. Knoer, Job Matching with Heterogeneous Firms and Workers, Econometrica, mar 1981, 49 (2), Hatield, John and Paul Milgrom, Matching with Contracts, American Economic Review, Sep 2005, 95 (4),

10 10 FEDERICO ECHENIQUE Hatield, J.W. and F. Kojima, Substitutes and stability or matching with contracts, Forthcoming, Journal o Economic Theory. Kelso, Alexander S. and Vincent P. Craword, Job Matching, Coalition Formation, and Gross Substitutes, Econometrica, 1982, 50, Roth, Alvin and Marilda Sotomayor, Two-sided Matching: A Study in Game-Theoretic Modelling and Analysis, Vol. 18 o Econometric Society Monographs, Cambridge University Press, Cambridge England, Roth, Alvin E., Stability and Polarization o Interests in Job Matching, Econometrica, jan 1984, 52 (1),

On the Correspondence of Contracts to Salaries in (Many-to-Many) Matching

On the Correspondence of Contracts to Salaries in (Many-to-Many) Matching On the Correspondence o Contracts to Salaries in (Many-to-Many) Matching Scott Duke Kominers 1, Becker Friedman Institute or Research in Economics, University o Chicago Abstract In this note, I extend

More information

A Many-to-Many Rural Hospital Theorem

A Many-to-Many Rural Hospital Theorem A Many-to-Many Rural Hospital Theorem Flip Klijn June 2011 Abstract We show that the full version of the so-called rural hospital theorem (Roth, 1986) generalizes to many-to-many matching where agents

More information

A Many-to-Many Rural Hospital Theorem

A Many-to-Many Rural Hospital Theorem A Many-to-Many Rural Hospital Theorem Flip Klijn June 2011 Abstract We show that the full version of the so-called rural hospital theorem (Roth, 1986) generalizes to many-to-many matching where agents

More information

Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts

Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts Matching with Contracts: The Critical Role of Irrelevance of Rejected Contracts Orhan Aygün and Tayfun Sönmez May 2012 Abstract We show that an ambiguity in setting the primitives of the matching with

More information

The Blocking Lemma and Group Strategy-Proofness in Many-to-Many Matchings

The Blocking Lemma and Group Strategy-Proofness in Many-to-Many Matchings The Blocking Lemma and Group Strategy-Proofness in Many-to-Many Matchings Zhenhua Jiao School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China Guoqiang Tian Department

More information

The Blocking Lemma and Strategy-Proofness in Many-to-Many Matchings

The Blocking Lemma and Strategy-Proofness in Many-to-Many Matchings The Blocking Lemma and Strategy-Proofness in Many-to-Many Matchings Zhenhua Jiao Institute for Advanced Research and School of Economics Shanghai University of Finance and Economics Shanghai, 200433, China

More information

Substitutes and Stability for Matching with Contracts

Substitutes and Stability for Matching with Contracts Substitutes and Stability for Matching with Contracts John William Hatfield and Fuhito Kojima February 26, 2008 Abstract We consider the matching problem with contracts of Hatfield and Milgrom (2005),

More information

On Relationships Between Substitutes Conditions

On Relationships Between Substitutes Conditions On Relationships Between Substitutes Conditions Mustafa Oǧuz Afacan and Bertan Turhan August 10, 2014 Abstract In the matching with contract literature, three well-known conditions (from stronger to weaker):

More information

Stable Matching in Large Economies

Stable Matching in Large Economies Stable Matching in Large Economies Yeon-Koo Che, Jinwoo Kim, Fuhito Kojima June 16, 2015 Abstract We study stability o two-side many to one two-sided many-to-one matching in which irms preerences or workers

More information

Documents de Travail du Centre d Economie de la Sorbonne

Documents de Travail du Centre d Economie de la Sorbonne Documents de Travail du Centre d Economie de la Sorbonne On equilibrium payos in wage bargaining with discount rates varying in time Ahmet OZKARDAS, Agnieszka RUSINOWSKA 2014.11 Maison des Sciences Économiques,

More information

Stability and Competitive Equilibrium in Trading Networks

Stability and Competitive Equilibrium in Trading Networks Stability and Competitive Equilibrium in Trading Networks John William Hatfield Scott Duke Kominers Alexandru Nichifor Michael Ostrovsky Alexander Westkamp January 5, 2011 Abstract We introduce a model

More information

The Importance of Irrelevance of Rejected Contracts in Matching under Weakened Substitutes Conditions

The Importance of Irrelevance of Rejected Contracts in Matching under Weakened Substitutes Conditions The Importance of Irrelevance of Rejected Contracts in Matching under Weakened Substitutes Conditions Orhan Aygün and Tayfun Sönmez June 2012 Abstract We show that Hatfield and Kojima 2010) inherits a

More information

MATCHING WITH QUOTAS MIKHAIL FREER MARIA TITOVA

MATCHING WITH QUOTAS MIKHAIL FREER MARIA TITOVA MATCHING WITH QUOTAS MIKHAIL FREER Interdisciplinary Center for Economic Science, George Mason University MARIA TITOVA Department of Economics, UC San Diego Abstract. We characterize the set of solutions

More information

Stability and Competitive Equilibrium in Trading Networks

Stability and Competitive Equilibrium in Trading Networks Stability and Competitive Equilibrium in Trading Networks John William Hatfield Scott Duke Kominers Alexandru Nichifor Michael Ostrovsky Alexander Westkamp December 31, 2010 Abstract We introduce a model

More information

Cadet-Branch Matching

Cadet-Branch Matching Cadet-Branch Matching TAYFUN SÖNMEZ Boston College Prior to 2006, the United States Military Academy (USMA) matched cadets to military specialties (branches) using a single category ranking system to determine

More information

Recent Advances in Generalized Matching Theory

Recent Advances in Generalized Matching Theory Recent Advances in Generalized Matching Theory John William Hatfield Stanford Graduate School of Business Scott Duke Kominers Becker Friedman Institute, University of Chicago Matching Problems: Economics

More information

Core Many-to-one Matchings by Fixed-Point Methods 1

Core Many-to-one Matchings by Fixed-Point Methods 1 Journal of Economic Theory v115(2), April 2004, pp 358-376 Core Many-to-one Matchings by Fixed-Point Methods 1 Federico Echenique Humanities and Social Sciences MC 228-77 California Institute of Technology

More information

Matching with Couples: Semi-Stability and Algorithm

Matching with Couples: Semi-Stability and Algorithm Matching with Couples: Semi-Stability and Algorithm Zhishan Jiang School of Economics Shanghai University of Finance and Economics Shanghai 200433, China Guoqiang Tian Department of Economics Texas A&M

More information

Gross Substitutes and Endowed Assignment Valuations

Gross Substitutes and Endowed Assignment Valuations Gross Substitutes and Endowed Assignment Valuations Michael Ostrovsky Renato Paes Leme August 26, 2014 Abstract We show that the class of preferences satisfying the Gross Substitutes condition of Kelso

More information

Two-Sided Matching. Terence Johnson. September 1, University of Notre Dame. Terence Johnson (ND) Two-Sided Matching September 1, / 37

Two-Sided Matching. Terence Johnson. September 1, University of Notre Dame. Terence Johnson (ND) Two-Sided Matching September 1, / 37 Two-Sided Matching Terence Johnson University of Notre Dame September 1, 2011 Terence Johnson (ND) Two-Sided Matching September 1, 2011 1 / 37 One-to-One Matching: Gale-Shapley (1962) There are two finite

More information

Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS

Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series

More information

Basic mathematics of economic models. 3. Maximization

Basic mathematics of economic models. 3. Maximization John Riley 1 January 16 Basic mathematics o economic models 3 Maimization 31 Single variable maimization 1 3 Multi variable maimization 6 33 Concave unctions 9 34 Maimization with non-negativity constraints

More information

(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results

(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results (C) The rationals and the reals as linearly ordered sets We know that both Q and R are something special. When we think about about either o these we usually view it as a ield, or at least some kind o

More information

Published: Social Choice and Welfare, 33(1), June 2009, pp doi: /s SEQUENTIAL ENTRY IN MANY-TO-ONE MATCHING MARKETS

Published: Social Choice and Welfare, 33(1), June 2009, pp doi: /s SEQUENTIAL ENTRY IN MANY-TO-ONE MATCHING MARKETS Published: Social Choice and Welfare, 33(1), June 2009, pp 87-99 doi:10.1007/s00355-008-0347-3 SEQUENTIAL ENTRY IN MANY-TO-ONE MATCHING MARKETS ELETTE BOYLE AND FEDERICO ECHENIQUE Abstract. We study sequential

More information

Substitutes and stability for matching with contracts

Substitutes and stability for matching with contracts JID:YJETH AID:3794 /FLA [m1+; v 1.118; Prn:29/01/2010; 21:14] P.1 (1-20) Journal of Economic Theory ( ) www.elsevier.com/locate/jet Substitutes and stability for matching with contracts John William Hatfield

More information

STAT 801: Mathematical Statistics. Hypothesis Testing

STAT 801: Mathematical Statistics. Hypothesis Testing STAT 801: Mathematical Statistics Hypothesis Testing Hypothesis testing: a statistical problem where you must choose, on the basis o data X, between two alternatives. We ormalize this as the problem o

More information

Math 216A. A gluing construction of Proj(S)

Math 216A. A gluing construction of Proj(S) Math 216A. A gluing construction o Proj(S) 1. Some basic deinitions Let S = n 0 S n be an N-graded ring (we ollows French terminology here, even though outside o France it is commonly accepted that N does

More information

Online Appendix: The Continuous-type Model of Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye

Online Appendix: The Continuous-type Model of Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye Online Appendix: The Continuous-type Model o Competitive Nonlinear Taxation and Constitutional Choice by Massimo Morelli, Huanxing Yang, and Lixin Ye For robustness check, in this section we extend our

More information

Monotonicity and Nash Implementation in Matching Markets with Contracts

Monotonicity and Nash Implementation in Matching Markets with Contracts Monotonicity and Nash Implementation in Matching Markets with Contracts Claus-Jochen Haake Bettina Klaus March 2006 Abstract We consider general two-sided matching markets, so-called matching with contracts

More information

On a Closed Formula for the Derivatives of e f(x) and Related Financial Applications

On a Closed Formula for the Derivatives of e f(x) and Related Financial Applications International Mathematical Forum, 4, 9, no. 9, 41-47 On a Closed Formula or the Derivatives o e x) and Related Financial Applications Konstantinos Draais 1 UCD CASL, University College Dublin, Ireland

More information

Do new competitors, new customers, new suppliers,... sustain, destroy or create competitive advantage?

Do new competitors, new customers, new suppliers,... sustain, destroy or create competitive advantage? Do new competitors, new customers, new suppliers,... sustain, destroy or create competitive advantage? Glenn MacDonald Olin School o Business Washington University MichaelD.Ryall Melbourne Business School

More information

Stable Matchings and Preferences of Couples

Stable Matchings and Preferences of Couples Stable Matchings and Preferences of Couples Bettina Klaus Flip Klijn April 2004 Abstract: Couples looking for jobs in the same labor market may cause instabilities. We determine a natural preference domain,

More information

Essential Microeconomics : EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, first and second welfare theorems

Essential Microeconomics : EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, first and second welfare theorems Essential Microeconomics -- 5.2: EQUILIBRIUM AND EFFICIENCY WITH PRODUCTION Key ideas: Walrasian equilibrium, irst and second welare teorems A general model 2 First welare Teorem 7 Second welare teorem

More information

Web Appendix for The Value of Switching Costs

Web Appendix for The Value of Switching Costs Web Appendix or The Value o Switching Costs Gary Biglaiser University o North Carolina, Chapel Hill Jacques Crémer Toulouse School o Economics (GREMAQ, CNRS and IDEI) Gergely Dobos Gazdasági Versenyhivatal

More information

Matching with Couples: Semi-Stability and Algorithm

Matching with Couples: Semi-Stability and Algorithm Matching with Couples: Semi-Stability and Algorithm Zhishan Jiang School of Economics Shanghai University of Finance and Economics Shanghai 200433, China Guoqiang Tian Department of Economics Texas A&M

More information

Roberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points

Roberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points Roberto s Notes on Dierential Calculus Chapter 8: Graphical analysis Section 1 Extreme points What you need to know already: How to solve basic algebraic and trigonometric equations. All basic techniques

More information

CS 361 Meeting 28 11/14/18

CS 361 Meeting 28 11/14/18 CS 361 Meeting 28 11/14/18 Announcements 1. Homework 9 due Friday Computation Histories 1. Some very interesting proos o undecidability rely on the technique o constructing a language that describes the

More information

ONLINE APPENDIX TO HOW TO CONTROL CONTROLLED SCHOOL CHOICE (NOT FOR PUBLICATION)

ONLINE APPENDIX TO HOW TO CONTROL CONTROLLED SCHOOL CHOICE (NOT FOR PUBLICATION) ONLINE APPENDIX TO HOW TO CONTROL CONTROLLED SCHOOL CHOICE (NOT FOR PUBLICATION) FEDERICO ECHENIQUE AND M. BUMIN YENMEZ Appendix B. Proofs of Theorems 1-6 The following rationality axiom simply says that

More information

Lone Wolves in Competitive Equilibria

Lone Wolves in Competitive Equilibria Lone Wolves in Competitive Equilibria Ravi Jagadeesan Scott Duke Kominers Ross Rheingans-Yoo Working Paper 18-055 Lone Wolves in Competitive Equilibria Ravi Jagadeesan Harvard University Scott Duke Kominers

More information

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive}

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive} 13 Social choice So far, all of our models involved a single decision maker. An important, perhaps the important, question for economics is whether the desires and wants of various agents can be rationally

More information

arxiv: v1 [cs.gt] 2 Jan 2012

arxiv: v1 [cs.gt] 2 Jan 2012 Testing Substitutability of Weak Preferences Haris Aziz, Markus Brill, Paul Harrenstein Institut für Informatik, Technische Universität München, 85748 Garching bei München, Germany arxiv:1201.0432v1 [cs.gt]

More information

Ordinal and cardinal solution concepts for two-sided matching

Ordinal and cardinal solution concepts for two-sided matching Ordinal and cardinal solution concepts for two-sided matching Federico Echenique 1 California Institute of Technology Alfred Galichon 2 Sciences Po, Paris March 19, 2013 1 Address: Division of the Humanities

More information

A Many-to-Many Rural Hospital Theorem

A Many-to-Many Rural Hospital Theorem A Many-to-Many Rural Hospital Theorem Flip Klijn and Ayşe Yazıcı January 23, 2014 Abstract We show that the full version of the so-called rural hospital theorem generalizes to many-to-many matching problems

More information

On the Maximal Domain Theorem

On the Maximal Domain Theorem On the Maximal Domain Theorem Yi-You Yang April 28, 2016 Abstract The maximal domain theorem by Gul and Stacchetti (J. Econ. Theory 87 (1999), 95-124) shows that for markets with indivisible objects and

More information

Near-Feasible Stable Matchings with Budget Constraints

Near-Feasible Stable Matchings with Budget Constraints Near-Feasible Stable Matchings with Budget Constraints arxiv:1705.07643v4 [cs.gt] 4 Dec 2017 Yasushi Kawase Tokyo Institute of Technology and RIKEN AIP Center, Tokyo, Japan. kawase.y.ab@m.titech.ac.jp

More information

Matching with Couples: Stability and Algorithm

Matching with Couples: Stability and Algorithm Matching with Couples: Stability and Algorithm Zhishan Jiang School of Economics Shanghai University of Finance and Economics Shanghai 200433, China Guoqiang Tian Department of Economics Texas A&M University

More information

(Group) Strategy-proofness and stability in many-to-many matching markets

(Group) Strategy-proofness and stability in many-to-many matching markets (Group) Strategy-proofness and stability in many-to-many matching markets Antonio Romero-Medina Matteo Triossi June 6, 2017 Abstract We study strategy-proofness in many-to-many matching markets. We prove

More information

LABOR MATCHING MODELS: EFFICIENCY PROPERTIES FEBRUARY 1, 2019

LABOR MATCHING MODELS: EFFICIENCY PROPERTIES FEBRUARY 1, 2019 LABOR MATCHING MODELS: EFFICIENCY PROPERTIES FEBRUARY, 209 Eiciency Considerations LABOR-MATCHING EFFICIENCY Social Planning problem Social Planner also subject to matcing TECHNOLOGY t max ( t ct, vt,

More information

Contract Design and Stability in Many-to-Many Matching

Contract Design and Stability in Many-to-Many Matching Contract Design and Stability in Many-to-Many Matching John William Hatfield McCombs School of Business, University of Texas at Austin Scott Duke Kominers Society of Fellows, Department of Economics, Center

More information

Hannu Salonen and Mikko A.A. Salonen Mutually Best Matches. Aboa Centre for Economics

Hannu Salonen and Mikko A.A. Salonen Mutually Best Matches. Aboa Centre for Economics Hannu Salonen and Mikko A.A. Salonen Mutually Best Matches Aboa Centre for Economics Discussion paper No. 109 Turku 2016 The Aboa Centre for Economics is a joint initiative of the economics departments

More information

Stability, Strategy-Proofness, and Cumulative Offer Mechanisms

Stability, Strategy-Proofness, and Cumulative Offer Mechanisms Stability, Strategy-Proofness, and Cumulative Offer Mechanisms John William Hatfield McCombs School of Business University of Texas at Austin Alexander Westkamp Department of Management, Economics, and

More information

TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE

TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE TESTING TIMED FINITE STATE MACHINES WITH GUARANTEED FAULT COVERAGE Khaled El-Fakih 1, Nina Yevtushenko 2 *, Hacene Fouchal 3 1 American University o Sharjah, PO Box 26666, UAE kelakih@aus.edu 2 Tomsk State

More information

Ordinal and cardinal solution concepts for two-sided matching 1

Ordinal and cardinal solution concepts for two-sided matching 1 Ordinal and cardinal solution concepts for two-sided matching 1 Federico Echenique 2 California Institute of Technology Alfred Galichon 3 Sciences Po, Paris April 23, 2014 1 The authors wish to thank Juan

More information

Centre de Referència en Economia Analítica

Centre de Referència en Economia Analítica Centre de Reerència en Economia Analítica Barcelona Economics Working Paper Series Working Paper nº 166 A Theorem on Preerence Aggregation Salvador Barberà July, 2003 A THEOREM ON PREFERENCE AGGREGATION

More information

ON STRATEGY-PROOF SOCIAL CHOICE BETWEEN TWO ALTERNATIVES

ON STRATEGY-PROOF SOCIAL CHOICE BETWEEN TWO ALTERNATIVES Discussion Paper No. 1013 ON STRATEGY-PROOF SOCIAL CHOICE BETWEEN TWO ALTERNATIVES Ahinaa Lahiri Anup Pramanik Octoer 2017 The Institute o Social and Economic Research Osaka University 6-1 Mihogaoka, Iaraki,

More information

A THEORY OF STABILITY IN MANY-TO-MANY MATCHING MARKETS

A THEORY OF STABILITY IN MANY-TO-MANY MATCHING MARKETS A THEORY OF STABILITY IN MANY-TO-MANY MATCHING MARKETS FEDERICO ECHENIQUE AND JORGE OVIEDO Abstract. We develop a theory of stability in many-to-many matching markets. We give conditions under wich the

More information

Lexicographic Choice under Variable Capacity Constraints

Lexicographic Choice under Variable Capacity Constraints Lexicographic Choice under Variable Capacity Constraints Battal Doğan Serhat Doğan Kemal Yıldız May 14, 2017 Abstract In several matching markets, in order to achieve diversity, agents priorities are allowed

More information

EconS Advanced Microeconomics II Handout on Subgame Perfect Equilibrium (SPNE)

EconS Advanced Microeconomics II Handout on Subgame Perfect Equilibrium (SPNE) EconS 3 - Advanced Microeconomics II Handout on Subgame Perfect Equilibrium (SPNE). Based on MWG 9.B.3 Consider the three-player nite game of perfect information depicted in gure. L R Player 3 l r a b

More information

Improving Fairness and Efficiency in Matching with Distributional Constraints: An Alternative Solution for the Japanese Medical Residency Match

Improving Fairness and Efficiency in Matching with Distributional Constraints: An Alternative Solution for the Japanese Medical Residency Match MPRA Munich Personal RePEc Archive Improving Fairness and Efficiency in Matching with Distributional Constraints: An Alternative Solution for the Japanese Medical Residency Match Masahiro Goto and Atsushi

More information

SEPARATED AND PROPER MORPHISMS

SEPARATED AND PROPER MORPHISMS SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN The notions o separatedness and properness are the algebraic geometry analogues o the Hausdor condition and compactness in topology. For varieties over the

More information

TWO-SIDED MATCHING WITH EXTERNALITIES: A SURVEY

TWO-SIDED MATCHING WITH EXTERNALITIES: A SURVEY Journal of the Operations Research Society of Japan Vol. 59, No. 1, January 2016, pp. 35 71 c The Operations Research Society of Japan TWO-SIDED MATCHING WITH EXTERNALITIES: A SURVEY Keisuke Bando Ryo

More information

( x) f = where P and Q are polynomials.

( x) f = where P and Q are polynomials. 9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational

More information

Competition and Resource Sensitivity in Marriage and Roommate Markets

Competition and Resource Sensitivity in Marriage and Roommate Markets Competition and Resource Sensitivity in Marriage and Roommate Markets Bettina Klaus This Version: April 2010 Previous Versions: November 2007 and December 2008 Abstract We consider one-to-one matching

More information

Online Appendix to Strategy-proof tie-breaking in matching with priorities

Online Appendix to Strategy-proof tie-breaking in matching with priorities Online Appendix to Strategy-proof tie-breaking in matching with priorities Lars Ehlers Alexander Westkamp December 12, 2017 Section 1 contains the omitted proofs of Lemma 5, Lemma 6 and Lemma 7 Subsection

More information

Matching Theory. Mihai Manea. Based on slides by Fuhito Kojima. MIT

Matching Theory. Mihai Manea. Based on slides by Fuhito Kojima. MIT Matching Theory Mihai Manea MIT Based on slides by Fuhito Kojima. Market Design Traditional economics focuses mostly on decentralized markets. Recently, economists are helping to design economic institutions

More information

Near Feasible Stable Matchings with Complementarities

Near Feasible Stable Matchings with Complementarities Near Feasible Stable Matchings with Complementarities Thành Nguyen and Rakesh Vohra August 2014 Abstract The National Resident Matching program strives for a stable matching of medical students to teaching

More information

Fair and Efficient Student Placement with Couples

Fair and Efficient Student Placement with Couples Fair and Efficient Student Placement with Couples Bettina Klaus Flip Klijn March 2006 Abstract We study situations of allocating positions to students based on priorities. An example is the assignment

More information

Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching

Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching Von Neumann-Morgenstern Farsightedly Stable Sets in Two-Sided Matching Ana Mauleon, FNRS and CEREC, Facultés Universitaires Saint-Louis, and CORE, University of Louvain. Vincent Vannetelbosch, FNRS and

More information

On High-Rate Cryptographic Compression Functions

On High-Rate Cryptographic Compression Functions On High-Rate Cryptographic Compression Functions Richard Ostertág and Martin Stanek Department o Computer Science Faculty o Mathematics, Physics and Inormatics Comenius University Mlynská dolina, 842 48

More information

Special types of Riemann sums

Special types of Riemann sums Roberto s Notes on Subject Chapter 4: Deinite integrals and the FTC Section 3 Special types o Riemann sums What you need to know already: What a Riemann sum is. What you can learn here: The key types o

More information

Consistency and Monotonicity in One-Sided Assignment Problems

Consistency and Monotonicity in One-Sided Assignment Problems Consistency and Monotonicity in One-Sided Assignment Problems Bettina Klaus Alexandru Nichifor Working Paper 09-146 Copyright 2009 by Bettina Klaus and Alexandru Nichifor Working papers are in draft form.

More information

Volume 31, Issue 1. A solution concept for housing market problems with externalities. Alfredo Salgado-Torres Universidad Carlos III de Madrid

Volume 31, Issue 1. A solution concept for housing market problems with externalities. Alfredo Salgado-Torres Universidad Carlos III de Madrid Volume 31, Issue 1 A solution concept for housing market problems with externalities Alfredo Salgado-Torres Universidad Carlos III de Madrid Abstract Since the core of a housing market with externalities

More information

How to control controlled school choice. WZB Matching Workshop Aug 29, 2014

How to control controlled school choice. WZB Matching Workshop Aug 29, 2014 How to control controlled school choice Federico Echenique Caltech M. Bumin Yenmez Carnegie Mellon WZB Matching Workshop Aug 29, 2014 School choice Example Two schools/colleges: c 1, c 2 Two students:

More information

The Core of Network Problems with Quotas

The Core of Network Problems with Quotas The Core of Network Problems with Quotas Somdeb Lahiri School of Economics and Business Sciences, University of the Witwatersrand at Johannesburg, Johannesburg, South Africa. Email: lahiris@sebs.wits.ac.za

More information

Maximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai

Maximum Flow. Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Maximum Flow Reading: CLRS Chapter 26. CSE 6331 Algorithms Steve Lai Flow Network A low network G ( V, E) is a directed graph with a source node sv, a sink node tv, a capacity unction c. Each edge ( u,

More information

We set up the basic model of two-sided, one-to-one matching

We set up the basic model of two-sided, one-to-one matching Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 18 To recap Tuesday: We set up the basic model of two-sided, one-to-one matching Two finite populations, call them Men and Women, who want to

More information

Cowles Foundation for Research in Economics at Yale University

Cowles Foundation for Research in Economics at Yale University Cowles Foundation for Research in Economics at Yale University Cowles Foundation Discussion Paper No. 1870 MATCHING WITH INCOMPLETE INFORMATION Quingmin Liu, George J. Mailath, Andrew Postlewaite, and

More information

A Dynamic Market Clearing Price Mechanism with Multiple Demands *

A Dynamic Market Clearing Price Mechanism with Multiple Demands * A Dynamic Market Clearing Price Mechanism with Multiple Demands * Marilda Sotomayor ** Abstract We propose a dynamic selling procedure for the generalization of the buyer-seller market game of Shapley

More information

SEQUENTIAL ENTRY IN ONE-TO-ONE MATCHING MARKETS

SEQUENTIAL ENTRY IN ONE-TO-ONE MATCHING MARKETS REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Vol. 54, No. 2, 2013, Pages 1 14 Published online: December 21, 2013 SEQUENTIAL ENTRY IN ONE-TO-ONE MATCHING MARKETS BEATRIZ MILLÁN Abstract. We study in one-to-one

More information

Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values

Supplementary material for Continuous-action planning for discounted infinite-horizon nonlinear optimal control with Lipschitz values Supplementary material or Continuous-action planning or discounted ininite-horizon nonlinear optimal control with Lipschitz values List o main notations x, X, u, U state, state space, action, action space,

More information

Sufficient Conditions for Weak Group-Strategy-Proofness

Sufficient Conditions for Weak Group-Strategy-Proofness Sufficient Conditions for Weak Group-Strategy-Proofness T.C.A. Madhav Raghavan 31 July, 2014 Abstract In this note we study group-strategy-proofness, which is the extension of strategy-proofness to groups

More information

Walrasian equilibrium in large, quasilinear markets

Walrasian equilibrium in large, quasilinear markets Theoretical Economics 8 (2013), 281 290 1555-7561/20130281 Walrasian equilibrium in large, quasilinear markets Eduardo M. Azevedo Wharton School, University of Pennsylvania E. Glen Weyl Department of Economics,

More information

Journal of Mathematical Economics

Journal of Mathematical Economics Journal of Mathematical Economics 46 (2010) 937 949 Contents lists available at ScienceDirect Journal of Mathematical Economics journal homepage: www.elsevier.com/locate/jmateco The Blocking Lemma for

More information

Strong Lyapunov Functions for Systems Satisfying the Conditions of La Salle

Strong Lyapunov Functions for Systems Satisfying the Conditions of La Salle 06 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 6, JUNE 004 Strong Lyapunov Functions or Systems Satisying the Conditions o La Salle Frédéric Mazenc and Dragan Ne sić Abstract We present a construction

More information

Cahier Robust Design in Monotonic Matching Markets : A Case for Firm-Proposing Deferred-Acceptance. Lars Ehlers and Jordi Massó

Cahier Robust Design in Monotonic Matching Markets : A Case for Firm-Proposing Deferred-Acceptance. Lars Ehlers and Jordi Massó Cahier 04-208 Robust Design in Monotonic Matching Markets : A Case or Firm-Proposing Deerred-Acceptance Lars Ehlers and Jordi Massó Le Centre interuniversitaire de recherche en économie quantitative (CIREQ)

More information

Gerard van der Laan, Dolf Talman, and Zaifu Yang

Gerard van der Laan, Dolf Talman, and Zaifu Yang Discussion Papers in Economics No. 18/17 Equilibrium in the Assignment Market under Budget Constraints Gerard van der Laan, Dolf Talman, and Zaifu Yang Department of Economics and Related Studies University

More information

The assignment game: core, competitive equilibria and multiple partnership

The assignment game: core, competitive equilibria and multiple partnership The assignment game: core, competitive equilibria and multiple partnership Marina Núñez University of Barcelona Summer School on Matching Problems, Markets and Mechanisms; Budapest, June 2013 Outline 1

More information

Core and Top Trading Cycles in a Market with Indivisible Goods and Externalities

Core and Top Trading Cycles in a Market with Indivisible Goods and Externalities Core and Top Trading Cycles in a Market with Indivisible Goods and Externalities Miho Hong Jaeok Park December 17, 2017 Abstract In this paper, we incorporate externalities into Shapley-Scarf housing markets.

More information

On Stable and Strategy-Proof Rules in Matching Markets with Contracts

On Stable and Strategy-Proof Rules in Matching Markets with Contracts On Stable and Strategy-Proof Rules in Matching Markets with Contracts Daisuke Hirata Hitotsubashi University Yusuke Kasuya Yokohama National University This Version: September 10, 2015 Abstract This paper

More information

The Blocking Lemma for a Many-to-one Matching Model

The Blocking Lemma for a Many-to-one Matching Model The Blocking Lemma for a Many-to-one Matching Model Ruth Martínez y, Jordi Massó z, Alejandro Neme y, and Jorge Oviedo y December 2006 Abstract: The Blocking Lemma identi es a particular blocking pair

More information

Working Paper Series

Working Paper Series FACULTY OF BUSINESS ADMINISTRATION AND ECONOMICS Working Paper Series Working Paper No. 2014-02 Constitutions and Social Networks Ana Mauleon, Nils Roehl, Vincent Vannetelbosch January 2014 Constitutions

More information

Stability in a many-to-one matching model with externalities among colleagues

Stability in a many-to-one matching model with externalities among colleagues Stability in a many-to-one matching model with externalities among colleagues Omer Ali October 23, 2015 Preliminary and incomplete: comments welcome. Abstract I study a non-transferable utility, many-to-one

More information

Chain Stability in Trading Networks

Chain Stability in Trading Networks Chain Stability in Trading Networks John William Hatfield Scott Duke Kominers Alexandru Nichifor Michael Ostrovsky Alexander Westkamp June 30, 2018 Abstract We show that in general trading networks with

More information

Strategy-Proofness and the Core in House Allocation Problems

Strategy-Proofness and the Core in House Allocation Problems Strategy-Proofness and the Core in House Allocation Problems Eiichi Miyagawa Department of Economics, Columbia University 420 West 118th Street, New York, NY 10027 Email: em437@columbia.edu July 28, 1999

More information

AN ALGORITHM TO COMPUTE THE FULL SET OF MANY-TO-MANY STABLE MATCHINGS. July Journal of Economic Literature Classification Number: C78

AN ALGORITHM TO COMPUTE THE FULL SET OF MANY-TO-MANY STABLE MATCHINGS. July Journal of Economic Literature Classification Number: C78 AN ALGORITHM TO COMPUTE THE ULL SET O MANY-TO-MANY STABLE MATCHINGS by Ruth Martínez, Jordi Massó,AlejandroNeme,andJorgeOviedo July 2003 Journal of Economic Literature Classification Number: C78 Keywords:

More information

Module 16: Signaling

Module 16: Signaling Module 16: Signaling Information Economics (Ec 515) George Georgiadis Players with private information can take some action to signal their type. Taking this action would distinguish them from other types.

More information

CHAPTER 1: INTRODUCTION. 1.1 Inverse Theory: What It Is and What It Does

CHAPTER 1: INTRODUCTION. 1.1 Inverse Theory: What It Is and What It Does Geosciences 567: CHAPTER (RR/GZ) CHAPTER : INTRODUCTION Inverse Theory: What It Is and What It Does Inverse theory, at least as I choose to deine it, is the ine art o estimating model parameters rom data

More information

SEPARATED AND PROPER MORPHISMS

SEPARATED AND PROPER MORPHISMS SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Last quarter, we introduced the closed diagonal condition or a prevariety to be a prevariety, and the universally closed condition or a variety to be complete.

More information

CLASS NOTES MATH 527 (SPRING 2011) WEEK 6

CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 BERTRAND GUILLOU 1. Mon, Feb. 21 Note that since we have C() = X A C (A) and the inclusion A C (A) at time 0 is a coibration, it ollows that the pushout map i

More information

Housing Markets with Indifferences: a Tale of Two Mechanisms

Housing Markets with Indifferences: a Tale of Two Mechanisms Housing Markets with Indifferences: a Tale of Two Mechanisms Haris Aziz, Bart de Keijzer Institut für Informatik, Technische Universität München, 80538 München, Germany CWI Amsterdam, 1098 XG Amsterdam,

More information