# Two-Sided Matching Theory

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Two-Sided Matching Theory M. Utku Ünver Boston College

2 Introduction to the Theory of Two-Sided Matching To see which results are robust, we will look at some increasingly general models. Even before we look at complex design problems, we can get a head start at figuring out which are our most applicable results by doing this sort of theoretical sensitivity analysis. Discrete models 1 One to one matching: the "marriage" model 2 many to one matching (with simple preferences) : the "college admissions" model 3 many to one matching with money and complex (gross substitutes) preferences These lectures on theory follow Roth and Sotomayor (1990), and theorems are numbered as in the book.

3 One-to-One Matching: The Marriage Model Gale and Shapley, AMM (1962) A marriage market is a triple (M, W, ) with M is a finite set of men W is a finite set of women = ( k ) k M W is a preference profile where m is a preference relation over W {m} w is a preference relation over M {w} Let k be the strict preference relation derived from k i k j means i k j and not j k i. If agent k M W prefers to remain single rather than be matched to agent j, i.e. if k k j, then j is unacceptable to k. (If an agent is not indifferent between any two acceptable mates, or between being matched and unmatched, we ll say he/she has strict preferences. Some theorems below are valid only for strict preferences. If otherwise mentioned we assume that preferences are strict.)

4 One-to-one Matching: The Marriage Model An outcome of the marriage market is a matching µ : M W M W such that µ (m) = w iff µ(w) = m and for all m and either µ(w) M {w} and µ (m) W {m}. A matching µ is blocked by an individual k M W if k prefers being single to being matched with µ(k), i.e.k k µ (k). A matching µ is blocked by a pair (m, w) M W if they each prefer each other to their partners under µ, i.e. w m µ (m) and m w µ (w). A matching is stable if it isn t blocked by any individual or pair of agents. A stable matching is Pareto-efficient.

5 Stability of Marriage: (xkcd.com)

6 (Strong) Core, Weak Core, The Set of Stable Matchings The weak core is the set of matchings µ such that there exists no matching ν and coalition T M W such that for all k T, ν (k) k µ (k) and ν (k) T. The (strong) core is the set of matchings µ such that there exists no matching ν and coalition T M W such that for all k T, ν (k) k µ (k), for some i T, ν(i) i µ(i), and ν (k) T. S: set of stable matchings C W : weak core C S : (strong) core Lemma In the marriage model, when preferences are general, C S C W = S; when preferences are strict, C S = C W = S. A stable matching is also referred to as a core matching.

7 Men-Proposing Deferred Acceptance Algorithm (the Gale-Shapley 1962 version) Step 0 If some preferences are not strict, arbitrarily break ties (e.g. if some m is indifferent between w and w, order them consecutively in an arbitrary manner). Step 1 Each man m proposes to his 1st choice (if he has any acceptable choices). Each woman rejects any unacceptable proposals and, if more than one acceptable proposal is received, holds the most preferred. If no proposals are rejected, and match each woman to the man (if any) whose proposal she is holding and terminate the procedure..

8 Men-Proposing Deferred Acceptance Algorithm (the Gale-Shapley 1962 version) Step k Any man who was rejected at step k 1 makes a new proposal to his most preferred acceptable mate who hasn t yet rejected him. (If no acceptable choices remain, he makes no proposal.) Each woman holds her most preferred acceptable offer to date, and rejects the rest. If no proposals are rejected, and match each woman to the man (if any) whose proposal she is holding and terminate the procedure.

9 Existence of Stable Matchings Theorem (Gale and Shapley, AMM, 1962) A stable matching exists for every marriage market. Proof: Observation: Women get (weakly) better off as the process goes on, and men get (weakly) worse off as the process goes on. the deferred acceptance algorithm always stops. the matching it produces, µ, is always stable with respect to the strict preferences (i.e. after any arbitrary tie-breaking), why? The matching µ cannot be blocked by any individual, since men do not make any offers to unacceptable women, and women immediately reject unacceptable offers. Suppose there is a pair (m, w) blocking the matching. Then m made an offer to w in deferred acceptance algorithm and since they are not matched with each other w rejected m in favor of someone better. A contradiction that (m, w) blocks µ. µ is stable with respect to the original preferences.

10 Side-Optimal Stable Matchings Theorem (Gale and Shapley, AMM, 1962) When all men and women have strict preferences, there always exists an men-optimal stable matching (that every man likes at least as well as any other stable matching), and a women-optimal stable matching. Furthermore, the matching µ M produced by the deferred acceptance algorithm with men-proposing is the men-optimal stable matching. The women-optimal stable matching is the matching µ W produced by the algorithm when the women propose.

11 Side-Optimal Stable Matchings Proof: Terminology: w is achievable for m if there is some stable matching µ such that µ(m) = w. Proof by induction: Inductive step: suppose that up to step k of the algorithm, no man has been rejected by an achievable partner, and that at step k woman w rejects man m (who is acceptable to w) and (therefore) holds on to some m. Then w is not achievable for m. Why? Suppose µ is stable such that µ(m) = w. Then µ(m ) is achievable for m. Then µ can t be stable: by the inductive step, (m, w) would be a blocking pair. Therefore every man in matched with the best acheivable partner under the outcome of the men-proposing deferred acceptance algorithm, µ M meaning that µ M is men-optimal stable matching.

12 Lattice Properties of Set of Stable Matchings Let µ M µ denote that all men like µ at least as well as µ, with at least one man having strict preference. Then M is a partial order on the set of matchings, representing the common preferences of the men. Similarly, define W as the common preference of the women. Theorem (Knuth) When all agents have strict preferences, the common preferences of the two sides of the market are opposed on the set of stable matchings: if µ and µ are stable matchings, then all men like µ at least as well as µ if and only if all women like µ at least as well as µ. That is, µ M µ if and only if µ W µ.

13 Lattice Properties of Set of Stable Matchings Proof: immediate from definition of stability. So the best outcome for one side of the market is the worst for the other. For any two matchings µ and µ, and for all men and women, define µ M µ (join) as the function that assigns each man his more preferred of the two matches, and each woman her less preferred: µ M µ (m) = µ(m) if µ(m) m µ (m) and µ M µ (m) = µ (m) otherwise µ M µ (w) = µ(w) if µ (w) w µ (w) and µ M µ (w) = µ (w) otherwise Define µ M µ (meet) analogously, by reversing the preferences.

14 Lattice: A lattice is a partially ordered set with a unique maximum and unique minimum. The infimum of two elements is defined by (or meet) and the supremum of two elements is defined by (or join). Observe that infimum and supremum of any two elements are well defined for a lattice.

15 Lattice: Example: {0, 1,..., 10} 2 and usual vector partial order

16 Lattice Theorem Theorem (Lattice Theorem (Conway)) When all preferences are strict, if µ and µ are stable matchings, then the functions µ M µ and µ M µ are both matchings and they are both stable.

17 Lattice Theorem So if we think of λ as asking men to point to their preferred mate from two stable matchings, and asking women to point to their less preferred mate, the theorem says that No two men point to the same woman (this follows from the stability of µ and µ ) Every woman points back at the man pointing to her; (the direction [λ(m) = w implies λ(w) = m] follows easily from stability, but the direction [λ(w) = m implies λ(m) = w] takes a bit more work (See the Decomposition Lemma below). And the resulting matching is stable. (again, immediately from the stability of µ and µ )

18 Theorem In a market (M, W, ) with strict preferences, the set of people who are single is the same for all stable matchings. One strategy of proof: What can we say about the number and identity of men and women matched (and hence the number and identity unmatched) at µ M and at µ W? µ M (W ) = µ M (M) (by men optimality) µ W (M) = µ W (W ) (by women optimality) µ M (W )

19 Theorem (Weak Pareto efficientity for Men) There is no individually rational matching µ (stable or not) such that µ(m) m µ M (m) for all m M. Proof: (using the deferred acceptance algorithm) If µ were such a matching it would match every man m to some woman w who had rejected him in the algorithm in favor of some other man m (i.e. even though m was acceptable to w). Hence all of these women, µ(m), would have been matched under µ M. That is, µ M (µ(m)) = M. Hence all of M would have been matched under µ M and µ M (M) = µ(m). But since all of M are matched under µ M any woman who gets a proposal in the last step of the algorithm at which proposals were issued has not rejected any acceptable man, i.e. the algorithm stops as soon as every woman in µ M (M) has an acceptable proposal. So such a woman must be single at µ (since every man prefers

20 Example µ M is not in general (strongly) Pareto efficient for men: M = {m 1, m 2, m 3 } and W = {w 1, w 2, w 3 } m 1 : w 2 w 1 w 3 w 1 : m 1 m 2 m 3 m 2 : w 1 w 2 w 3 w 2 : m 3 m 1 m 2 m 3 : w 1 w 2 w 3 w 3 : m 1 m 2 m 3 µ M = ([m 1, w 1 ], [m 2, w 3 ], [m 3, w 2 ]) = µ W But note that µ M µ M for µ = ([m 1, w 2 ], [m 2, w 3 ], [m 3, w 1 ])

21 Strategic Behavior The Preference Revelation Game Let s consider strategic behavior in centralized matching mechanisms, in which participants submit a list of stated preferences. By the revelation principle, some of the results will apply to decentralized markets also, in which agents have different sets of strategies.

22 Strategic Behavior Consider a marriage market (M, W, ) whose matching outcome will be determined by a centralized clearinghouse, based on a list of preferences that players will state ("reveal" ). If the stated preference profile is, the algorithm employed by the clearinghouse produces a matching φ[ ] assuming M and W are fixed. In general, the matching mechanism φ is defined for all (M, W, ). If the matching produced is always a stable matching with respect to, we ll say that φ is a stable matching mechanism.

23 No Incentive Compatible Mechanism Theorem (Impossibility Theorem, Roth) No stable matching mechanism exists for which stating the true preferences is a dominant strategy for every agent. Remark on proof: for an impossibility theorem, one example for which no stable matching mechanism induces a dominant strategy is sufficient. Consider an example with 2 agents on each side, with preferences as follows: m 1 : w 1 w 2 w 1 : m 2 m 1 m 2 : w 2 w 1 w 2 : m 1 m 2 In this example, what must an arbitrary stable mechanism do? I.e. what is the range of φ[ ] if φ is a stable mechanism?

24 No Incentive Compatible Mechanism Given φ[ ], and the restriction that φ is a stable mechanism, can one of the players k engage in a profitable manipulation by stating some k = k such that k prefers φ[ ] to φ[ ]? Of course, this kind of proof of the impossibility theorem leaves open the possibility that situations in which some participant can profitably manipulate his preferences are rare. The following result suggests otherwise.

25 Theorem When any stable mechanism is applied to a marriage market in which preferences are strict and there is more than one stable matching, then at least one agent can profitably misrepresent his or her preferences, assuming the others tell the truth. (This agent can misrepresent in such a way as to be matched to his or her most preferred achievable mate under the true preferences at every stable matching under the mis-stated preferences.)

26 Incentives facing the men when the men-optimal stable mechanism is used Theorem (Dubins and Freedman 1980, Roth 1982) The men-optimal stable mechanism makes it a dominant strategy for each man to state his true preferences. Theorem (Dubins and Freedman 1980) Let be the true preferences of the agents, and let differ from in that some coalition M of the men mis-state their preferences. Then there is no matching µ, stable for, which is preferred to µ M by all members of M.

27 Decomposition Lemma One more observation about the marriage model that is used in the Lattice property s proof and later in the many-to-one matching model. Suppose µ and µ are stable matchings, and for some m, w = µ(m) m µ (m) = w. Then the stability of µ immediately implies that µ (w) w µ(w) = m. But how about w? Lemma (Decomposition Lemma - Corollary 2.21, Knuth) Let µ and µ be stable matchings in (M, W, ), with all preferences strict. Let M µ (W µ ) be the set of men (women) who prefer µ to µ, and let M µ (W µ ) be those who prefer µ. Then µ and µ both map M µ onto W µ and M µ onto W µ.

28 Decomposition Lemma Proof: Suppose for some m, w = µ(m) m µ (m) = w. Then the stability of µ immediately implies that µ (w) w µ(w) = m. We ve just observed above that µ(m µ ) is contained in W µ. So M µ W µ. Symmetrically, µ (W µ ) is contained in M µ, so M µ W µ. Since µ and µ are one-to-one (and since M µ and W µ are finite), both µ and µ are onto. So, to answer the question posed at the top of the previous slide, a man or woman who prefers one stable matching to another is matched at both of them to a mate with the reverse preferences.

29 Many-to-one Matching: The College Admissions Model A college admissions market (W, F, q, ) consists of A finite set of workers W A finite set of firms F A finite non-negative quota q f for each f F Preference relation of each f F over subsets of W and f : f (assume strict preferences) Preference relation of each w W over F {w}: w (assume strict preferences)

30 Many-to-one Matching We need to specify how firms preferences over matchings, are related to their preferences over individual workers, since they hire groups of workers. The simplest model is: Responsive preferences: for any set of workers S W with S < q f, and any workers w and w W \ S, S {w} f S {w } if and only if w f w, and S {w} f S if and only if w is acceptable to f. A matching µ is individually irrational if µ(w) = f for some worker w and firm f such that either the worker is unacceptable to the firm or the firm is unacceptable to the worker. An individually irrational matching is said to be blocked by the relevant individual.

31 Many-to-one Matching A matching µ is block by a firm-worker pair (f, w) if they each prefer each other to µ: w f w for some w µ(f ) or w f f if µ(f ) < q f, and f w µ(w) As in the marriage model, a matching is pairwise stable if it isn t blocked by any individual or pair of agents.

32 Many-to-one Matching But now that firms employ multiple workers, it might not be enough to concentrate only on pairwise stability. The assumption of responsive preferences allows us to do this, however. A matching µ is blocked by a group A of firms and workers if there exists another matching µ such that for all workers w A, and all firms f A 1 µ (w) A 2 µ (w) w µ(w) 3 w µ (f ) implies w A µ(f ), i.e. every firm in A is matched at µ to new workers only from A, although it may continue to be matched with some of its "old" workers from µ. (This differs from the definition of core...) 4 µ (f ) f µ(f ) A matching is (group) stable if it is not blocked by a group of any size.

33 Lemma When firm preferences are responsive, a matching is stable if and only if it is pairwise stable. Proof: pairwise instability clearly implies instability. Now suppose µ is blocked via group A and outcome µ. Then there must be a worker w and a firm f such that w is in µ (f ) but not in µ(f ) such that w and f block µ. (Otherwise it couldn t be that µ (f ) f µ(f ), since f has responsive preferences.)

34 (Strong) Core, Weak Core, and Set of Stable Matchings Recall that S: Set of (group) stable matchings C W : Weak core C S : (Strong) core Lemma In the many-to-one matching model with strict preferences, S = C S C W.

35 Firm Proposing Deferred Acceptance Algorithm (the Gale-Shapley 1962 version) Step 1 Each firm f proposes to its q f best choice workers (if there are less acceptable choices then all of them). Each worker rejects any unacceptable proposals and, if more than one acceptable proposal is received, holds the most preferred. If no proposals are rejected, and match each worker to the firm (if any) whose proposal she is holding and terminate the procedure..

36 Firm Proposing Deferred Acceptance Algorithm (the Gale-Shapley 1962 version) Step k Any firm who was rejected by l workers at step k 1 makes q f l new proposals to its most preferred acceptable workers who hasn t yet rejected it. (If less acceptable choices remain, it proposes to all of its remaining acceptable workers) Each worker holds her most preferred acceptable offer to date, and rejects the rest. If no proposals are rejected, match each worker to the firm (if any) whose proposal she is holding and terminate the procedure.

37 Worker Proposing Deferred Acceptance Algorithm (the Gale-Shapley 1962 version) Step 1 Each worker w proposes to her best acceptable firm. Each firm f rejects any unacceptable proposals and, if more than q f acceptable proposals are received, holds the most preferred q f group of workers, if less than q f acceptable proposals are received it temporarily holds all of them. If no proposals are rejected, and match each firm to the worker (if any) whose proposal it is holding and terminate the procedure..

38 Firm Proposing Deferred Acceptance Algorithm (the Gale-Shapley 1962 version) Step k Any worker who was rejected at step k 1 makes a new proposal to her most preferred acceptable firm which hasn t yet rejected her. Each firm holds its most preferred q f acceptable offers from this step and the ones it is holding from the previous step, and rejects the rest, if there are more than q f of them. Otherwise, it holds all of the acceptable offers from this step and the ones from the previous step. It rejects all unacceptable offers from this step. If no proposals are rejected, match each worker to the firm (if any) whose proposal she is holding and terminate the procedure.

39 Both of these algorithms find stable matchings. Worker proposing mechanism finds the worker-optimal stable matching. Firm proposing mechanism finds the firm-optimal stable matching. Lattice property of stable matchings still holds in a rather strong form. Worker-optimal stable mechanism is still incentive compatible for workers in dominant strategies. But why?

40 A related marriage market Replace firm f by q f positions of f denoted by f 1, f 2,..., f q f. Each of these positions has f s preferences over individuals. Since each position f i has a quota of 1, we do not need to consider preferences over groups of workers. Each worker s preference list is modified by replacing f, wherever it appears on his list, by the string f 1, f 2,..., f q f, in that order. A matching µ of the many-to-one matching, corresponds to a matching µ in the related marriage market in which the workers in µ(f ) are matched, in the order which they occur in the preferences f, with the ordered positions of f that appear in the related marriage market. (If preferences are not strict, there will be more than one such matching.)

41 Lemma 5.6 Lemma A matching of the many-to-one matching market is stable if and only if the corresponding matching of the related marriage market is stable. (Note: some results from the marriage model will translate immediately)

42 Geographic Distribution Theorem (Theorem 5.12) When all preferences over individuals are strict, the set of workers employed and positions filled is the same at every stable matching. The proof is immediate via the similar result for the marriage market and the construction of the corresponding marriage market (Lemma 5.6). So any firm that fails to fill all of its positions at some stable matching will not be able to fill any more positions at any other stable matching. The next result shows that not only will such a firm fill the same number of positions, but it will fill them with exactly the same interns at any other stable matching.

43 Geographic Distribution Theorem (Theorem 5.13: rural hospitals theorem - Roth 86) When preferences over individuals are strict, any firm that does not fill its quota at some stable matching is assigned precisely the same set of workers at every stable matching.

44 Lemma 5.25 (Roth and Sotomayor) Lemma Suppose firms and workers have strict individual preferences, and let µ and µ be stable matchings for (W, F, q, ), such that µ(f ) = µ (f ) for some f F. Let ˆµ and ˆµ be the stable matchings corresponding to µ and µ in the related marriage market. If ˆµ(f i ) f ˆµ (f i ) for some position f i of f then ˆµ(f i ) f ˆµ (f i ) for all positions f i of f.

45 Lemma 5.25 (Roth and Sotomayor) Proof: It is enough to show that ˆµ(f j ) f ˆµ (f j ) for all j > i. So suppose this is false. Then there exists an index j such that ˆµ(f j ) f ˆµ (f j ), but ˆµ(f j+1 ) f ˆµ (f j+1 ). Theorem 5.12 (constant employment) implies ˆµ (f j ) W. Let w ˆµ (f j ). By the Decomposition Lemma f j ˆµ (w ) w ˆµ(w ). Furthermore, ˆµ(w ) =f j+1, since w f ˆµ (f j+1 ) f ˆµ(f j+1 ) (where the first of these preferences follows from the fact that for any stable matching ˆµ in the related marriage market, ˆµ(f j ) f ˆµ (f j+1 ) for all j). Therefore f j+1 comes right after f j in the preferences of w (or any w) in the related marriage market. So ˆµ is blocked via w and f j+1, contradicting (via Lemma 5.6) the stability of µ. (This proof also establishes the rural hospitals theorem).

46 Theorem 5.27 (Roth and Sotomayor) Theorem (Roth and Sotomayor) Let preferences over individuals be strict, and let µ and µ be stable matchings for (W, F, q, ). If µ(f ) f µ (f ) for some firm f, then w f w for all w µ(f ) and w µ (f ) \ µ(f ). That is, f prefers every worker in its assignment at µ to every worker who is in its assignment at µ but not at µ.

47 Theorem 5.27 (Roth and Sotomayor) Proof: Consider the related marriage market and the stable matchings ˆµ and ˆµ corresponding to µ and µ. Let q f = k, so that the positions of f are f 1,..., f q f. First observe that f fills its quota under µ and µ, since, if not, Theorem 5.13 (Rural hospitals) would imply that µ(f ) = µ (f ). So µ (f ) µ(f ) is a nonempty subset of W, since µ(f ) = µ (f ). Let w = ˆµ (f j ) for some position f j such that w is not in µ(f ). Then ˆµ(f j ) = ˆµ (f j ). By Lemma 5.25 ˆµ(f j ) f ˆµ (f j ) = w. The Decomposition Lemma implies f j w ˆµ(w ). So the construction of the related marriage market implies f w µ(w ), since µ(w ) = f. Thus w f w for all w µ(f ) by the stability of µ, which completes the proof.

48 Comments Consider a firm f with quota 2 and preferences over individuals w 1 f w 2 f w 3 f w 4. Suppose that at various matchings 1-4, f is matched to 1 {w 1, w 4 }, 2 {w 2, w 3 }, 3 {w 1, w 3 }, and 4 {w 2, w 4 }. Which matchings can be simultaneously stable for some responsive preferences over individuals? So long as all preferences over groups are responsive, matchings 1 and 2 cannot both be stable (Lemma 5.25), nor can matchings 3 and 4 (Theorem 5.27).

49 Strategic questions in the Many-to-one Matching Model: Theorem (Roth) A stable matching procedure which yields the worker-optimal stable matching makes it a dominant strategy for all workers to state their true preferences. Proof: immediate from the related marriage market

50 Strategic questions in the Many-to-one Matching Model: Theorem (Roth) No stable matching mechanism exists that makes it a dominant strategy for all firms to state their true preferences.

51 Strategic questions in the Many-to-one Matching Model: Proof: Consider a market consisting of 3 firms and 4 workers. f 1 has a quota of 2, and both other firms have a quota of 1. The preferences are: w 1 : f 3 f 1 f 2 f 1 : w 1 w 2 w 3 w 4 w 2 : f 2 f 1 f 3 f 2 : w 1 w 2 w 3 w 4 w 3 : f 1 f 3 f 2 f 3 : w 3 w 1 w 2 w 4 w 4 : f 1 f 2 f 3 The unique stable matching is {[f 1, w 3, w 4 ], [f 2, w 2 ], [f 3, w 1 ]} But if f 1 instead submitted the preferences w 1 w 4 the unique stable matching is {[f 1, w 1, w 4 ], [f 2, w 2 ], [f 3, w 3 ]}.

### Matching Markets: Theory and Practice

Matching Markets: Theory and Practice Atila Abdulkadiroğlu Duke University Tayfun Sönmez Boston College 1 Introduction It has been almost half a century since David Gale and Lloyd Shapley published their

### We study strategic issues in the Gale-Shapley stable marriage model. In the first part

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications Chung-Piaw Teo Jay Sethuraman Wee-Peng Tan Department of Decision Sciences, Faculty of Business Administration, National

### each college c i C has a capacity q i - the maximum number of students it will admit

n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i

### THE ROOMMATES PROBLEM DISCUSSED

THE ROOMMATES PROBLEM DISCUSSED NATHAN SCHULZ Abstract. The stable roommates problem as originally posed by Gale and Shapley [1] in 1962 involves a single set of even cardinality 2n, each member of which

### What s the Matter with Tie-breaking? Improving Efficiency in School Choice

What s the Matter with Tie-breaking? Improving Efficiency in School Choice By Aytek Erdil and Haluk Ergin Abstract In several school choice districts in the United States, the student proposing deferred

### Stable matching: Theory, evidence, and practical design

THE PRIZE IN ECONOMIC SCIENCES 2012 INFORMATION FOR THE PUBLIC Stable matching: Theory, evidence, and practical design This year s Prize to Lloyd Shapley and Alvin Roth extends from abstract theory developed

### The Student-Project Allocation Problem

The Student-Project Allocation Problem David J. Abraham, Robert W. Irving, and David F. Manlove Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK Email: {dabraham,rwi,davidm}@dcs.gla.ac.uk.

### Chapter 7. Sealed-bid Auctions

Chapter 7 Sealed-bid Auctions An auction is a procedure used for selling and buying items by offering them up for bid. Auctions are often used to sell objects that have a variable price (for example oil)

### Online Appendix. A2 : Description of New York City High School Admissions

Online Appendix This appendix provides supplementary material for Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match. The numbering of sections parallels

### The Role of Priorities in Assigning Indivisible Objects: A Characterization of Top Trading Cycles

The Role of Priorities in Assigning Indivisible Objects: A Characterization of Top Trading Cycles Atila Abdulkadiroglu and Yeon-oo Che Duke University and Columbia University This version: November 2010

### Matching with (Branch-of-Choice) Contracts at United States Military Academy

Matching with (Branch-of-Choice) Contracts at United States Military Academy Tayfun Sönmez and Tobias B. Switzer May 2011 Abstract Branch selection is a key decision in a cadet s military career. Cadets

### The Design of School Choice Systems in NYC and Boston: Game-Theoretic Issues

The Design of School Choice Systems in NYC and Boston: Game-Theoretic Issues Alvin E. Roth joint work with Atila Abdulkadiroğlu, Parag Pathak, Tayfun Sönmez 1 Outline of today s class NYC Schools: design

### Two Algorithms for the Student-Project Allocation Problem

Two Algorithms for the Student-Project Allocation Problem David J. Abraham 1, Robert W. Irving 2, and David F. Manlove 2 1 Computer Science Department, Carnegie-Mellon University, 5000 Forbes Ave, Pittsburgh

### Matching with Waiting Times: The German Entry-Level Labor Market for Lawyers

Matching with Waiting Times: The German Entry-Level Labor Market for Lawyers Philipp D. Dimakopoulos and C.-Philipp Heller Humboldt University Berlin 8th Matching in Practice Workshop, Lisbon, 2014 Dimakopoulos

### An Alternative Characterization of Top Trading Cycles

An Alternative Characterization of Top Trading Cycles Thayer Morrill December 2011 Abstract This paper introduces two new characterizations of the Top Trading Cycles algorithm. The key to our characterizations

### Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that

### Tiers, Preference Similarity, and the Limits on Stable Partners

Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider

### Alok Gupta. Dmitry Zhdanov

RESEARCH ARTICLE GROWTH AND SUSTAINABILITY OF MANAGED SECURITY SERVICES NETWORKS: AN ECONOMIC PERSPECTIVE Alok Gupta Department of Information and Decision Sciences, Carlson School of Management, University

### HOW TO CONTROL CONTROLLED SCHOOL CHOICE ONLINE APPENDIX FEDERICO ECHENIQUE AND M. BUMIN YENMEZ

HOW TO CONTROL CONTROLLED SCHOOL CHOICE ONLINE APPENDIX FEDERICO ECHENIQUE AND M. BUMIN YENMEZ Appendix B. Controlled school choice in the US The legal background on diversity in school admissions is complicated.

### Effective affirmative action in school choice

Theoretical Economics 8 (2013), 325 363 1555-7561/20130325 Effective affirmative action in school choice Isa E. Hafalir Tepper School of Business, Carnegie Mellon University M. Bumin Yenmez Tepper School

### Matching with Contracts

Matching with Contracts By JOHN WILLIAM HATFIELD AND PAUL R. MILGROM* We develop a model of matching with contracts which incorporates, as special cases, the college admissions problem, the Kelso-Crawford

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### About the inverse football pool problem for 9 games 1

Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute

### School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation

School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation Parag A. Pathak Tayfun Sönmez This version: January 2011 Abstract In Fall 2009, officials from

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### arxiv:1112.0829v1 [math.pr] 5 Dec 2011

How Not to Win a Million Dollars: A Counterexample to a Conjecture of L. Breiman Thomas P. Hayes arxiv:1112.0829v1 [math.pr] 5 Dec 2011 Abstract Consider a gambling game in which we are allowed to repeatedly

### CPC/CPA Hybrid Bidding in a Second Price Auction

CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09-074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Dimitris Chatzidimitriou. Corelab NTUA. June 28, 2013

AN EFFICIENT ALGORITHM FOR THE OPTIMAL STABLE MARRIAGE PROBLEM Dimitris Chatzidimitriou Corelab NTUA June 28, 2013 OUTLINE 1 BASIC CONCEPTS 2 DEFINITIONS 3 ROTATIONS 4 THE ALGORITHM DIMITRIS CHATZIDIMITRIOU

### Low upper bound of ideals, coding into rich Π 0 1 classes

Low upper bound of ideals, coding into rich Π 0 1 classes Antonín Kučera the main part is a joint project with T. Slaman Charles University, Prague September 2007, Chicago The main result There is a low

### 17.6.1 Introduction to Auction Design

CS787: Advanced Algorithms Topic: Sponsored Search Auction Design Presenter(s): Nilay, Srikrishna, Taedong 17.6.1 Introduction to Auction Design The Internet, which started of as a research project in

### Re-Reforming the Bostonian System: A Novel Approach to the School Allocation Problem

Re-Reforming the Bostonian System: A Novel Approach to the School Allocation Problem José Alcalde 1 and Antonio Romero Medina 2 1 IUDESP and Dep. of Economics, University of Alicante, 03071 Alicante, Spain

### 2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

### Changing the Boston School Choice Mechanism: Strategy-proofness as Equal Access

Changing the Boston School Choice Mechanism: Strategy-proofness as Equal Access Atila Abdulkadiroğlu Parag A. Pathak Alvin E. Roth Tayfun Sönmez May 18, 2006 Abstract In July 2005 the Boston School Committee

### Separation Properties for Locally Convex Cones

Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

### THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### Two Simple Variations of Top Trading Cycles

Economic Theory manuscript No. (will be inserted by the editor) Two Simple Variations of Top Trading Cycles Thayer Morrill May 2014 Abstract Top Trading Cycles is widely regarded as the preferred method

### Invertible elements in associates and semigroups. 1

Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### Course Bidding at Business Schools

Course Bidding at Business Schools Tayfun Sönmez Koç University and M. Utku Ünver Koç University Abstract Mechanisms that rely on course bidding are widely used at Business Schools in order to allocate

### Two-Sided Bandits and the Dating Market

Two-Sided Bandits and the Dating Market Sanmay Das Center for Biological and Computational Learning and Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology Cambridge,

### THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.

### Summary of Doctoral Dissertation: Voluntary Participation Games in Public Good Mechanisms: Coalitional Deviations and Efficiency

Summary of Doctoral Dissertation: Voluntary Participation Games in Public Good Mechanisms: Coalitional Deviations and Efficiency Ryusuke Shinohara 1. Motivation The purpose of this dissertation is to examine

### Investigación Operativa. The uniform rule in the division problem

Boletín de Estadística e Investigación Operativa Vol. 27, No. 2, Junio 2011, pp. 102-112 Investigación Operativa The uniform rule in the division problem Gustavo Bergantiños Cid Dept. de Estadística e

### Preference Intensities and Risk Aversion in School Choice: A Laboratory Experiment

Preference Intensities and Risk Aversion in School Choice: A Laboratory Experiment Flip Klijn Joana Pais Marc Vorsatz Working Paper 10-093 Copyright 2010 by Flip Klijn, Joana Pais, and Marc Vorsatz Working

### Working Paper Secure implementation in Shapley-Scarf housing markets

econstor www.econstor.eu Der Open-Access-Publikationsserver der ZBW Leibniz-Informationszentrum Wirtschaft The Open Access Publication Server of the ZBW Leibniz Information Centre for Economics Fujinaka,

### 0.0.2 Pareto Efficiency (Sec. 4, Ch. 1 of text)

September 2 Exercises: Problem 2 (p. 21) Efficiency: p. 28-29: 1, 4, 5, 6 0.0.2 Pareto Efficiency (Sec. 4, Ch. 1 of text) We discuss here a notion of efficiency that is rooted in the individual preferences

### Assignment of Arrival Slots

Assignment of Arrival Slots James Schummer Rakesh V. Vohra June 1, 2012 Abstract Industry participants agree that, when inclement weather forces the FAA to reassign airport landing slots, incentives and

### Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

### Age Based Preferences in Paired Kidney Exchange

Age Based Preferences in Paired Kidney Exchange Antonio Nicolò Carmelo Rodríguez-Álvarez November 1, 2013 Abstract We consider a model of Paired Kidney Exchange (PKE) with feasibility constraints on the

### The Common Application and the DA Algorithm in School Assignment. Christopher Avery Cara Nickolaus Parag Pathak June, 2015

The Common Application and the DA Algorithm in School Assignment Christopher Avery Cara Nickolaus Parag Pathak June, 2015 Overview and Motivation Many districts in the US now use matching algorithms to

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES

EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a

### Game Theory: Supermodular Games 1

Game Theory: Supermodular Games 1 Christoph Schottmüller 1 License: CC Attribution ShareAlike 4.0 1 / 22 Outline 1 Introduction 2 Model 3 Revision questions and exercises 2 / 22 Motivation I several solution

### Internet Advertising and the Generalized Second Price Auction:

Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords Ben Edelman, Harvard Michael Ostrovsky, Stanford GSB Michael Schwarz, Yahoo! Research A Few

### Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

### CSC2420 Fall 2012: Algorithm Design, Analysis and Theory

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

Chapter ML:IV IV. Statistical Learning Probability Basics Bayes Classification Maximum a-posteriori Hypotheses ML:IV-1 Statistical Learning STEIN 2005-2015 Area Overview Mathematics Statistics...... Stochastics

### TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS

TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

### COUNTING SUBSETS OF A SET: COMBINATIONS

COUNTING SUBSETS OF A SET: COMBINATIONS DEFINITION 1: Let n, r be nonnegative integers with r n. An r-combination of a set of n elements is a subset of r of the n elements. EXAMPLE 1: Let S {a, b, c, d}.

### Egalitarian Stable Matching for VM Migration in Cloud Computing

Egalitarian Stable Matching for VM Migration in Cloud Computing Hong Xu, Baochun Li Department of Electrical and Computer Engineering University of Toronto {henryxu, bli}@eecg.toronto.edu Abstract Virtual

### 6.042/18.062J Mathematics for Computer Science. Expected Value I

6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### Expanding Choice in School Choice

Expanding Choice in School Choice Atila Abdulkadiroğlu, Yeon-Koo Che, and Yosuke Yasuda February 14, 2012 Abstract: Gale-Shapley s deferred acceptance (henceforth DA) mechanism has emerged as a prominent

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

### 4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

### Making Efficient School Assignment Fairer

Making Efficient School Assignment Fairer Thayer Morrill November, 2013 Abstract Surprisingly, nearly every school district that utilizes a centralized assignment procedure makes a Pareto inefficient assignment.

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

### Near Optimal Solutions

Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### Pascal is here expressing a kind of skepticism about the ability of human reason to deliver an answer to this question.

Pascal s wager So far we have discussed a number of arguments for or against the existence of God. In the reading for today, Pascal asks not Does God exist? but Should we believe in God? What is distinctive

University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

### THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES

THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES ANDREW E.M. LEWIS 1. Introduction This will be a course on the Turing degrees. We shall assume very little background knowledge: familiarity with

### Online Appendix (not for publication) College Admissions as Non-Price Competition: The Case of South Korea Index

Online Appendix (not for publication) College Admissions as Non-Price Competition: The Case of South Korea By Christopher Avery, Soohyung Lee, and Alvin E. Roth Index 1. Additional Background on the Korean

### Incentives in Landing Slot Problems

Incentives in Landing Slot Problems James Schummer Azar Abizada February 12, 2013 Abstract We analyze three applied incentive compatibility conditions within a class of queueing problems motivated by the

### Expanding Choice in School Choice

Expanding Choice in School Choice By Atila Abdulkadiroğlu, Yeon-Koo Che, and Yosuke Yasuda Gale-Shapley s deferred acceptance (henceforth DA) mechanism has emerged as a prominent candidate for placing

### Course Bidding at Business Schools

Course Bidding at Business Schools Tayfun Sönmez M. Utku Ünver 1 Abstract Mechanisms that rely on course bidding are widely used at Business Schools in order to allocate seats at oversubscribed courses.

### Optimal Nonlinear Income Taxation with a Finite Population

Optimal Nonlinear Income Taxation with a Finite Population Jonathan Hamilton and Steven Slutsky Department of Economics Warrington College of Business Administration University of Florida Gainesville FL

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### Settling a Question about Pythagorean Triples

Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:

### 1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### GREATEST COMMON DIVISOR

DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

### Lecture 8 The Subjective Theory of Betting on Theories

Lecture 8 The Subjective Theory of Betting on Theories Patrick Maher Philosophy 517 Spring 2007 Introduction The subjective theory of probability holds that the laws of probability are laws that rational

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

### FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem

Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that