Popular matchings in the weighted capacitated house allocation problem

Abdulkadiroǧlu, 1998, Random serial dictatorship and the core from random endowments in house allocation problems, Econometrica, 66, 689, 10.2307/2998580 Abraham, 2004, Pareto optimality in house allocation problems, vol. 3341, 3 Abraham, 2007, Popular matchings, SIAM Journal on Computing, 37, 1030, 10.1137/06067328X Abraham, 2006, Dynamic matching markets and voting paths, vol. 4059, 65 Brassard, 1996 Chung, 2000, On the existence of stable roommate matchings, Games and Economic Behavior, 33, 206, 10.1006/game.1999.0779 Gabow, 1983, An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, 448 Gärdenfors, 1975, Match making: Assignments based on bilateral preferences, Behavioural Science, 20, 166, 10.1002/bs.3830200304 Huang, 2008, Bounded unpopularity matchings, vol. 5124, 127 Irving, 2006, Rank-maximal matchings, ACM Transactions on Algorithms, 2, 602, 10.1145/1198513.1198520 T. Kavitha, M. Nasre, Optimal popular matchings, in: Proceedings of Match-UP 2008: Workshop on Matching Under Preferences – Algorithms and Complexity, held at ICALP 2008, 2008, pp. 46–54 Kavitha, 2006, Efficient algorithms for weighted rank-maximal matchings and related problems, vol. 4288, 153 Mahdian, 2006, Random popular matchings, 238 Manlove, 2006, Popular matchings in the Capacitated House Allocation problem, vol. 4168, 492 McCutchen, 2008, The least-unpopularity-factor and least-unpopularity-margin criteria for matching problems with one-sided preferences, vol. 4957, 593 McDermid, 2009, Popular matchings: Structure and algorithms, vol. 5609, 506 Mestre, 2006, Weighted popular matchings, vol. 4051, 715