Sciweavers

Share
CORR
2011
Springer
189views Education» more  CORR 2011»
9 years 6 months ago
Peer Effects and Stability in Matching Markets
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college st...
Elizabeth Bodine-Baron, Christina Lee, Anthony Cho...
MOR
2006
122views more  MOR 2006»
9 years 11 months ago
Many-to-One Stable Matching: Geometry and Fairness
Ba
Jay Sethuraman, Chung-Piaw Teo, Liwen Qian
DAM
2007
103views more  DAM 2007»
9 years 11 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
9 years 12 months ago
Circular Stable Matching and 3-way Kidney Transplant
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
Chien-Chung Huang
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
9 years 12 months ago
Understanding the Generalized Median Stable Matchings
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
Christine T. Cheng
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
9 years 12 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
ACID
2006
239views Algorithms» more  ACID 2006»
10 years 1 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
10 years 3 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
ISAAC
2003
Springer
210views Algorithms» more  ISAAC 2003»
10 years 5 months ago
The Student-Project Allocation Problem
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David J. Abraham, Robert W. Irving, David Manlove
HIPC
2003
Springer
10 years 5 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
books