<journal article>
The Popular Condensation Problem under Matroid Constraints

Creator
Language
Publisher
Date
Source Title
First Page
Last Page
Publication Type
Access Rights
Related DOI
Related DOI
Related DOI
Related DOI
Related URI
Related URI
Related HDL
Relation
Abstract The popular matching problem introduced by Abraham, Irving, Kavitha, and Mehlhorn is one of assignment problems in strategic situations. It is known that a given instance of this problem may admit no ...popular matching. For coping with such instances, Wu, Lin, Wang, and Chao introduced the popular condensation problem whose goal is to transform a given instance so that it has a popular matching by deleting a minimum number of agents. In this paper, we consider a matroid generalization of the popular condensation problem, and give a polynomial-time algorithm for this problem.show more

Hide fulltext details.

pdf MI2014-4 pdf 119 KB 541  

Details

Record ID
Peer-Reviewed
ISBN
eISBN
DOI
Notes
Created Date 2014.03.24
Modified Date 2024.01.10

People who viewed this item also viewed