#### Topics from this paper

#### 96 Citations

A Generalization of the Lone Wolf Theorem

- Economics
- 2014

A non-constructive generalization of the ‘lone wolf’ theorem, which states that in the roommates problem an agent is single in a stable matching if and only if that agent is single in every other… Expand

Many-to-One Stable Matching: Geometry and Fairness

- Mathematics, Computer Science
- Math. Oper. Res.
- 2006

The main result associates a geometric structure with each fractional stable matching, which appears to be interesting in its own right, and can be viewed as a generalization of the lattice structure (for integral stable matchings) to fractionalstable matchings. Expand

Randomized Approximation of the Stable Marriage Problem

- Computer Science
- COCOON
- 2003

A randomized approximation algorithm RANDBRK is given and it is shown that its expected approximation ratio is at most 10/7(< 1.4286) for a restricted but still NP-hard case, where ties occur in only men’s lists, each man writes at most one tie, and the length of ties is two. Expand

Characterization of Super-stable Matchings

- Computer Science
- WADS
- 2021

A polyhedral characterisation of the set of allsuper-stable matchings is given and it is proved that the super-stable matching polytope is integral, thus solving an open problem stated in the book by Gusfield and Irving. Expand

Information and Software Technologies

- Computer Science
- Communications in Computer and Information Science
- 2016

The paper propose methodology for benchmark modelling of adequate costs of utilities services, which is based on the data analysis of the factual cases (key performance indicators of utilities as the… Expand

A Stable Marriage Requires Communication

- Mathematics, Computer Science
- SODA
- 2015

The notion of "distance to stability" is introduced and the lower bound for $\Omega(n^2)$ Boolean queries of any type are indeed required for finding a stable - or even an approximately stable - marriage is given. Expand

An Equitable Solution to the Stable Marriage Problem

- Computer Science
- 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
- 2015

A novel, deterministic approach that treats both genders equally, while eschewing an exhaustive exploration of the space of all stable matchings is proposed, which not only achieves high-quality solutions, but also terminates efficiently and repeatably on all tested large problem instances. Expand

Algorithmics of Matching Under Preferences

- Computer Science
- Bull. EATCS
- 2014

This book builds on the author’s prior research in this area, and also his practical experience of developing algorithms for matching kidney patients to donors in the UK, for assigning medical students to hospitals in Scotland, and for allocating students to elective courses and projects. Expand

An Extended Stable Marriage Problem Algorithm for Clone Detection

- Computer Science
- ArXiv
- 2014

A novel approach to detecting clone software by using a bijective matching technique by extending a well-known stable-marriage problem and demonstrating how matches between code fragments of different files can be expressed. Expand