Results 261 to 270 of about 963,583 (273)
Some of the next articles are maybe not open access.
1983
Given a set of men and a set of women, a matching is a set of pairs, each pair containing one man and one woman, such that no person is in more than one pair. We shall be interested in finding matchings satisfying various criteria. The first problem we’ll consider is called the stable marriage problem. We assume that there are the same number of men as
George Pólya +2 more
openaire +1 more source
Given a set of men and a set of women, a matching is a set of pairs, each pair containing one man and one woman, such that no person is in more than one pair. We shall be interested in finding matchings satisfying various criteria. The first problem we’ll consider is called the stable marriage problem. We assume that there are the same number of men as
George Pólya +2 more
openaire +1 more source
Stable Matching with Proportionality Constraints
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017School choice programs seek to give students the option to choose their school but also close an opportunity gap. To be fair in the assignment of students, it is usually argued that the assignment of students to schools should be stable. This second concern is usually expressed in terms of proportions. As an example, in 1989, the city of White Plains,
Thành Nguyen, Rakesh Vohra
openaire +1 more source
Stable Matching of Difference Schemes
SIAM Journal on Numerical Analysis, 1972Approximations that result from the natural matching of two stable dissipative difference schemes across a coordinate line are shown to be stable. The basic idea is to reformulate the matching scheme consistent to an equivalent initial boundary value problem and to verify the algebraic conditions for stability of such systems. An interesting comparison
openaire +2 more sources