scientific article; zbMATH DE number 2038736

zbMATH Open1060.91514MaRDI QIDQ4449201FDOQ4449201

Aseem Agrawal, Vipul Bansal, Varun S. Malhotra

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190527.htm

Title of this publication is not available (Why is that?)

Recommendations

• Polynomial time algorithm for an optimal stable assignment with multiple partners
• Algorithms – ESA 2004
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• An efficient algorithm for the “stable roommates” problem
• On likely solutions of a stable marriage problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Matching models (91B68)

Cited In (11)

• A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
• Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
• A Size-Popularity Tradeoff in the Stable Marriage Problem
• Title not available (Why is that?)
• A finite decentralized marriage market with bilateral search
• A mechanism implementing the stable rule in marriage problems
• Stable marriage and genetic algorithms: a fertile union
• The stable marriage problem: an interdisciplinary review from the physicist's perspective
• Algorithms – ESA 2004
• A mathematical overview of the monogamous marriage in a multiregion framework: modelling and control
• Review of the theory of stable matchings and contract systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449201)