Search for dissertations about: "matchings."

Showing result 1 - 5 of 11 swedish dissertations containing the word matchings..

  2. 1. Essays on Matching

    Author : Jörgen Kratz; Nationalekonomiska institutionen; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES;

    Abstract : This thesis makes a contribution to matching theory and mechanism design. It consists of four self-contained papers focusing on kidney exchange, object allocation and partnership formation. READ MORE

  4. 2. Simplicial Complexes of Graphs

    Author : Jakob Jonsson; Anders Björner; John Shareshian; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; simplicial complex; monotone graph property; discrete Morse theory; simplicial homology; homotopy type; connectivity degree; Cohen-Macaulay complex; Euler characteristic; decision tree; Algebra och geometri; Algebra and geometry; Algebra och geometri;

    Abstract : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. READ MORE

  5. 3. Making Pairs

    Author : Jens Gudmundsson; Nationalekonomiska institutionen; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; equilibrium; existence; Pairing; matching; stability; algorithms;

    Abstract : This thesis makes a contribution to matching theory. It consists of five self-contained papers. It is a study predominately on the existence of stable outcomes. These are desirable both from a practical and a theoretical standpoint. READ MORE

  6. 4. On Matching Markets

    Author : Jens Gudmundsson; Nationalekonomiska institutionen; []
    Keywords : SAMHÄLLSVETENSKAP; SOCIAL SCIENCES;

    Abstract : This thesis gives a contribution to matching theory. It examines three one-to-one matching models: the roommate problem, the partnership formation problem and the assignment game. In the former two, it is known that stable matchings may not exist. In the latter, stable outcomes do exist; we examine if they still do if we generalize the model. READ MORE

  7. 5. Building and Destroying Urns, Graphs, and Trees

    Author : Fabian Burghart; Cecilia Holmgren; Svante Janson; Klas Markström; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : In this thesis, consisting of an introduction and four papers, different models in the mathematical area of combinatorial probability are investigated.In Paper I, two operations for combining generalised Pólya urns, called disjoint union and product, are defined. READ MORE