Understanding the Generalized Median Stable Matchings

ISSN： 0178-4617

Source： Algorithmica, Vol.58, Iss.1, 2010-09, pp. : 34-51

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

By Floréen Patrik Kaski Petteri Polishchuk Valentin Suomela Jukka

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 102-118

Springer Publishing Company

Access to resources Recommend Favorite

Three-Sided Stable Matchings with Cyclic Preferences

By Biró Péter McDermid Eric

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 5-18

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games

By Wako Jun

Algorithmica, Vol. 58, Iss. 1, 2010-09 ,pp. : 188-220

Springer Publishing Company

Access to resources Recommend Favorite

Application of generalized median voter schemes to designing strategy-proof mechanisms of multicriteria active expertise

By Burkov V. Iskakov M. Korgin N.

Automation and Remote Control, Vol. 71, Iss. 8, 2010-08 ,pp. : 1681-1694

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Almost Exact Matchings

By Yuster Raphael

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 39-50

Springer Publishing Company

Access to resources Recommend Favorite