Taking as a starting point the theory of matching applied in the case of a problem of college admissions, where one is … students and colleges, in order to achieve the best possible matching that is stable, strategy-proof, Pareto efficient and fair. …

costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition …

-1. We propose an algorithm that computes the nucleolus of an n-player peer group game in O(n2) time directly from the …

Roth is the major force in creating a vibrant field of matching theory and its application to market design. In doing … so, he has discovered many properties of the stable matching problem (especially from the strategic viewpoint of game …

A matching and bargaining model in a market with one seller and two buyers, differing only in their reservation price …

, such as the exploration of stable solutions for matching and exchange, the measurement of power and a deeper understanding …

Given an undirected network G(V, E, c) and a perfect matching M <Superscript>0</Superscript>, the inverse maximum … perfect matching problem is to modify the cost vector as little as possible such that the given perfect matching M … <Superscript>0</Superscript> can form a maximum perfect matching. The modification can be measured by different norms. In this …