Algorithmics of Matching Under Preferences
暂无分享,去创建一个
[1] Tamás Fleiner,et al. On a lemma of Scarf , 2002, J. Comb. Theory, Ser. B.
[2] Dimitrios Michail,et al. Reducing rank-maximal to maximum weight matching , 2007, Theor. Comput. Sci..
[3] L. B. Wilson,et al. Algorithm 411: Three procedures for the stable marriage problem , 1971, Commun. ACM.
[4] Telikepalli Kavitha,et al. Bounded Unpopularity Matchings , 2008, Algorithmica.
[5] J. Drèze,et al. HEDONIC COALITIONS: OPTIMALITY AND STABILITY , 1980 .
[6] Ning Chen,et al. On Computing Pareto Stable Assignments , 2012, STACS.
[7] Krzysztof R. Apt,et al. Principles of constraint programming , 2003 .
[8] U. Rothblum,et al. Vacancy Chains and Equilibration in Senior-Level Labor Markets , 1997 .
[9] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[10] Katarzyna E. Paluch. Faster and Simpler Approximation of Stable Matchings , 2014, Algorithms.
[11] Meghana Nasre,et al. Popular matchings with variable item copies , 2011, Theor. Comput. Sci..
[12] Zoltán Király. Better and Simpler Approximation Algorithms for the Stable Marriage Problem , 2009, Algorithmica.
[13] Tomomi Matsui,et al. Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists , 2010, OR.
[14] Chung-Piaw Teo,et al. The Geometry of Fractional Stable Matchings and Its Applications , 1998, Math. Oper. Res..
[15] N. S. Mendelsohn,et al. Coverings of Bipartite Graphs , 1958, Canadian Journal of Mathematics.
[16] Vladimir I. Danilov. Existence of stable matchings in some three-sided systems , 2003, Math. Soc. Sci..
[17] A. Roth,et al. The Market for Federal Judicial Law Clerks , 2007 .
[18] Fabien Mathieu,et al. Self-stabilization in preference-based systems , 2008, Peer-to-Peer Netw. Appl..
[19] S. Tijs,et al. Permutation games: Another class of totally balanced games , 1984 .
[20] Vahab S. Mirrokni,et al. Uncoordinated Two-Sided Matching Markets , 2011, SIAM J. Comput..
[21] Graham Farr,et al. Planarization and fragmentability of some classes of graphs , 2008, Discret. Math..
[22] Alvin E. Roth,et al. Sorority Rush as a Two-Sided Matching Mechanism , 1991 .
[23] Jimmy J. M. Tan. A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching , 1991, J. Algorithms.
[24] Chien-Chung Huang,et al. Classified stable matching , 2009, SODA '10.
[25] Eiichi Miyagawa,et al. Random paths to stability in the roommate problem , 2004, Games Econ. Behav..
[26] Richard Matthew McCutchen. The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences , 2008, LATIN.
[27] Federico Echenique,et al. What Matchings Can Be Stable? The Testable Implications of Matching Theory , 2008, Math. Oper. Res..
[28] Sergei Vassilvitskii,et al. Social Networks and Stable Matchings in the Job Market , 2009, WINE.
[29] Brian Aldershof,et al. Stable Marriage and Genetic Algorithms: A Fertile Union , 1999, J. Heuristics.
[30] David Manlove,et al. Hard variants of stable marriage , 2002, Theor. Comput. Sci..
[31] Michael J. Quinn,et al. A note on two parallel algorithms to solve the stable marriage problem , 1985, BIT.
[32] Kurt Mehlhorn,et al. Network Problems with Non-Polynomial Weights And Applications , 2005 .
[33] Leo Võhandu,et al. Majority Voting in Stable Marriage Problem with Couples , 2017, ICEIS.
[34] Daniel J. Dougherty,et al. The complexity of the certification of properties of Stable Marriage , 2004, Inf. Process. Lett..
[35] Marilda Sotomayor,et al. A Non-constructive Elementary Proof of the Existence of Stable Marriages , 1996 .
[36] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[37] Michael Schwarz,et al. Median Stable Matching for Markets with Wages , 2009 .
[38] David Manlove,et al. Stable Marriage with Ties and Bounded Length Preference Lists , 2006, ACiD.
[39] Alvin E. Roth,et al. Stable Matchings, Optimal Assignments, and Linear Programming , 1993, Math. Oper. Res..
[40] Eric McDermid,et al. Popular matchings: structure and algorithms , 2009, J. Comb. Optim..
[41] Kurt Mehlhorn,et al. Pareto Optimality in House Allocation Problems , 2005, ISAAC.
[42] David Manlove,et al. Paired and Altruistic Kidney Donation in the UK , 2012, ACM J. Exp. Algorithmics.
[43] Julián Mestre. Weighted Popular Matchings , 2006, ICALP.
[44] Dan Gusfield,et al. The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments , 1988, SIAM J. Comput..
[45] David Manlove,et al. "Almost Stable" Matchings in the Roommates Problem , 2005, WAOA.
[46] Jirí Sgall,et al. 38th International Colloquium on Automata, Languages and Programming , 2013, Inf. Comput..
[47] David Manlove,et al. Popular Matchings in the Marriage and Roommates Problems , 2010, CIAC.
[48] F. Kojima,et al. Matching and Market Design: An Introduction to Selected Topics , 2011 .
[49] Brian C. Dean,et al. An Efficient Algorithm for Batch Stability Testing , 2009, Algorithmica.
[50] Telikepalli Kavitha,et al. Popularity at Minimum Cost , 2010, ISAAC.
[51] Eric McDermid. A 3/2-Approximation Algorithm for General Stable Marriage , 2009, ICALP.
[52] Varun S. Malhotra. On the Stability of Multiple Partner Stable Marriages with Ties , 2004, ESA.
[53] Eric McDermid,et al. Hardness results on the man-exchange stable marriage problem with short preference lists , 2007, Inf. Process. Lett..
[54] Chien-Chung Huang,et al. How Hard is it to Cheat in the Gale-Shapley Stable Matching Algorithm ? , 2006 .
[55] Samir Khuller,et al. On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..
[56] Hyun Kim,et al. Ant Colony based Algorithm for Stable Marriage Problem , 2007 .
[57] David Manlove,et al. Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems , 2008, J. Comb. Optim..
[58] Nicole Immorlica,et al. Marriage, honesty, and stability , 2005, SODA '05.
[59] Uriel G. Rothblum,et al. Incentive compatibility for the stable matching model with an entrance criterion , 2010, Int. J. Game Theory.
[60] Christine Cheng. The Generalized Median Stable Matchings: Finding Them Is Not That Easy , 2008, LATIN.
[61] Shuichi Miyazaki,et al. Stable Marriage with Ties and Incomplete Lists , 2008, Encyclopedia of Algorithms.
[62] David Gale,et al. Some remarks on the stable matching problem , 1985, Discret. Appl. Math..
[63] Daniël Paulusma,et al. Computing solutions for matching games , 2011, International Journal of Game Theory.
[64] Aytek Erdil,et al. What's the Matter with Tie-Breaking? Improving Efficiency in School Choice , 2008 .
[65] Michel Balinski,et al. Graphs and Marriages , 1998 .
[66] Parag A. Pathak,et al. The New York City High School Match , 2005 .
[67] Mohammad Mahdian,et al. Random popular matchings , 2006, EC '06.
[68] Dimitrios Michail,et al. An experimental comparison of single-sided preference matching algorithms , 2011, JEAL.
[69] Dana Randall,et al. Sampling stable marriages: why spouse-swapping won't work , 2008, SODA '08.
[70] Tamás Fleiner,et al. The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems , 2008, Int. J. Game Theory.
[71] Chien-Chung Huang,et al. Cheating by Men in the Gale-Shapley Stable Matching Algorithm , 2006, ESA.
[72] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[73] Hiroki Yanagisawa. Approximation algorithms for stable marriage problems , 2007 .
[74] Roman Barták,et al. Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework , 2005, FLAIRS.
[75] Flip Klijn,et al. Matching with couples: a Multidisciplinary Survey , 2013, IGTR.
[76] Leslie Ann Goldberg,et al. The complexity of approximately counting stable roommate assignments , 2010, J. Comput. Syst. Sci..
[77] Katarína Cechlárová. Stable Partition Problem , 2008, Encyclopedia of Algorithms.
[78] Tamás Fleiner. The Stable Roommates Problem with Choice Functions , 2009, Algorithmica.
[79] Martin Hoefer,et al. Locally Stable Matching with General Preferences , 2012, ArXiv.
[80] R. Ravi,et al. Matching markets: design and analysis , 2009 .
[81] Seiki Kyan,et al. Genetic algorithm for sex-fair stable marriage problem , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.
[82] David A. Cohen,et al. Tractability by Approximating Constraint Languages , 2003, CP.
[83] Tamás Fleiner. A Matroid Generalization of the Stable Matching Polytope , 2001, IPCO.
[84] Petr A. Golovach,et al. Solutions for the Stable Roommates Problem with Payments , 2012, WG.
[85] A. J. Stothers. On the complexity of matrix multiplication , 2010 .
[86] Pedro Meseguer,et al. Distributed Stable Matching Problems , 2005, CP.
[87] Iris Hui-Ru Jiang,et al. ECOS: Stable Matching Based Metal-Only ECO Synthesis , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.
[88] Alvin E. Roth,et al. Incentives in two-sided matching with random stable mechanisms , 1991 .
[89] Ran Duan,et al. A scaling algorithm for maximum weight matching in bipartite graphs , 2012, SODA.
[90] Donald E. Knuth,et al. Stable Networks and Product Graphs , 1995 .
[91] Alvin E. Roth,et al. Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions , 1985, Math. Oper. Res..
[92] Arif A. Anwar,et al. Student project allocation using integer programming , 2003, IEEE Trans. Educ..
[93] Shuichi Miyazaki,et al. Improved approximation bounds for the Student-Project Allocation problem with preferences over projects , 2011, J. Discrete Algorithms.
[94] Toby Walsh,et al. Stable marriage problems with quantitative preferences , 2010, ArXiv.
[95] Marilda Sotomayor,et al. Two-Sided Matching Models , 2009, Encyclopedia of Complexity and Systems Science.
[96] Barry O'Sullivan,et al. From Marriages to Coalitions: A Soft CSP Approach , 2009, CSCLP.
[97] Xiao-Dong Hu,et al. The Maximum-Weight Stable Matching Problem: Duality and Efficiency , 2012, SIAM J. Discret. Math..
[98] Hyunyoung Lee. Online stable matching as a means of allocating distributed resources , 1999, J. Syst. Archit..
[99] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[100] Robert W. Irving,et al. Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists , 2013, Algorithms.
[101] Katia Sycara,et al. Two-Sided Matching for the U . S . Navy Detailing Process with Market Complication ∗ , 2003 .
[102] Bettina Klaus,et al. Median Stable Matching for College Admissions , 2006, Int. J. Game Theory.
[103] Shuichi Miyazaki,et al. The Hospitals/Residents Problem with Quota Lower Bounds , 2011, ESA.
[104] Eric McDermid,et al. A structural approach to matching problems with preferences , 2011 .
[105] David Gale,et al. The Two-Sided Matching Problem: Origin, Development and Current Issues , 2001, IGTR.
[106] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[107] Avrim Blum,et al. Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.
[108] Daniel S. Hirschberg,et al. Three-Dimensional Stable Matching Problems , 1991, SIAM J. Discret. Math..
[109] Jordi Massó,et al. An algorithm to compute the full set of many-to-many stable matchings , 2004, Math. Soc. Sci..
[110] Jana Hajduková,et al. Computational complexity of stable partitions with B-preferences , 2003, Int. J. Game Theory.
[111] Georges Dussart,et al. Two's company, three's a crowd , 1998 .
[112] Gerhard J. Woeginger,et al. The complexity of economic equilibria for house allocation markets , 2003, Inf. Process. Lett..
[113] Philippe Golle,et al. A Private Stable Matching Algorithm , 2006, Financial Cryptography.
[114] Telikepalli Kavitha,et al. Popular Matchings with Variable Job Capacities , 2009, ISAAC.
[115] Elette Boyle,et al. Sequential entry in many-to-one matching markets , 2009, Soc. Choice Welf..
[116] Joseph Douglas Horton,et al. Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..
[117] Stephen G. Hartke,et al. Stable Matchings in the Couples Problem , 2001 .
[118] Bettina Klaus,et al. Stable matchings and preferences of couples , 2005, J. Econ. Theory.
[119] David F. Manlove,et al. Pareto optimality in the Roommates Problem , 2004 .
[120] Shuichi Miyazaki,et al. An improved approximation lower bound for finding almost stable maximum matchings , 2009, Inf. Process. Lett..
[121] Lin Zhou. On a conjecture by gale about one-sided matching problems , 1990 .
[122] Katarína Cechlárová,et al. Stability in coalition formation games , 2000, Int. J. Game Theory.
[123] Tamás Fleiner,et al. The integral stable allocation problem on graphs , 2010, Discret. Optim..
[124] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[125] Jimmy J. M. Tan. A maximum stable matching for the roommates problem , 1990, BIT.
[126] Kurt Mehlhorn,et al. Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem , 2007, TALG.
[127] Martin Hoefer. Local matching dynamics in social networks , 2013, Inf. Comput..
[128] Christine T. Cheng. Understanding the Generalized Median Stable Matchings , 2009, Algorithmica.
[129] Yufei Yuan,et al. Residence exchange wanted: A stable residence exchange problem , 1996 .
[130] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory, Ser. B.
[131] L. Shapley,et al. The assignment game I: The core , 1971 .
[132] F. Kojima,et al. Stability and Strategy-Proofness for Matching with Constraints: A Problem in the Japanese Medical Match and Its Solution , 2012 .
[133] Tayfun Sönmez,et al. Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy , 2013 .
[134] David Manlove,et al. Strong Stability in the Hospitals/Residents Problem , 2003, STACS.
[135] Kurt Mehlhorn. Assigning Papers to Referees , 2009, ICALP.
[136] Chien-Chung Huang. Circular Stable Matching and 3-way Kidney Transplant , 2009, Algorithmica.
[137] Dániel Marx,et al. Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties , 2009, Algorithmica.
[138] Hiroyuki Adachi. On a characterization of stable matchings , 2000 .
[139] Ahmet Alkan,et al. On the properties of stable many-to-many matchings under responsive preferences , 1999 .
[140] Bettina Klaus,et al. Smith and Rawls share a room: stability and medians , 2010, Soc. Choice Welf..
[141] M. de Klerk,et al. The Dutch algorithm for allocation in living donor kidney exchange. , 2005, Transplantation proceedings.
[142] Richard M. Karp,et al. Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.
[143] Shuichi Miyazaki,et al. Approximation algorithms for the sex-equal stable marriage problem , 2007, TALG.
[144] Kimmo Eriksson,et al. Stable matching in a common generalization of the marriage and assignment models , 2000, Discret. Math..
[145] Parag A. Pathak,et al. Changing the Boston School Choice Mechanism , 2006 .
[146] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[147] Eric McDermid,et al. "Almost stable" matchings in the Roommates problem with bounded preference lists , 2012, Theor. Comput. Sci..
[148] Leo Võhandu,et al. Stable marriage problem and college admission , 2005 .
[149] Elliot Anshelevich,et al. Anarchy, stability, and utopia: creating better matchings , 2009, Autonomous Agents and Multi-Agent Systems.
[150] A. Roth,et al. The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.
[151] Robert W. Irving. An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.
[152] Robert E. Tarjan,et al. A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..
[153] Katarína Cechlárová,et al. On the complexity of exchange-stable roommates , 2002, Discret. Appl. Math..
[154] Chung-Piaw Teo,et al. A Polynomial-time Algorithm for the Bistable Roommates Problem , 2001, J. Comput. Syst. Sci..
[155] Thomas Quint,et al. On Houseswapping, the Strict Core, Segmentation, and Linear Programming , 2003, Math. Oper. Res..
[156] Eric McDermid,et al. Maximum Locally Stable Matchings , 2013, Algorithms.
[157] N GabowHarold. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976 .
[158] David Manlove,et al. Popular Matchings in the Capacitated House Allocation Problem , 2006, ESA.
[159] Patrick Prosser,et al. A Specialised Binary Constraint for the Stable Marriage Problem , 2005, SARA.
[160] F. Echenique,et al. A Theory of Stability in Many-to-Many Matching Markets , 2004 .
[161] Tayfun Sönmez,et al. Core in a simple coalition formation game , 2001, Soc. Choice Welf..
[162] Dániel Marx,et al. Stable assignment with couples: Parameterized complexity and local search , 2009, Discret. Optim..
[163] Chris Unsworth,et al. A specialised constraint approach for stable matching problems , 2008 .
[164] Bettina Klaus,et al. Paths to stability for matching markets with couples , 2007, Games Econ. Behav..
[165] Xiaotie Deng,et al. Majority Equilibrium for Public Facility Allocation (Preliminary Version) , 2003, COCOON.
[166] David Cantala,et al. Restabilizing matching markets at senior level , 2004, Games Econ. Behav..
[167] Patrick Prosser,et al. SAT Encodings of the Stable Marriage Problem with Ties and Incomplete Lists , 2002 .
[168] Martin Dyer,et al. The Stable Marriage Problem: Structure and Algorithms , 1991 .
[169] Michael A. Trick,et al. Stable matching with preferences derived from a psychological model , 1986 .
[170] A. Roth. On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets , 1986 .
[171] Toby Walsh,et al. Stability in Matching Problems with Weighted Preferences , 2011, ICAART.
[172] D. S. Johnson,et al. On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..
[173] Erkki Mäkinen,et al. The Stable Roommates Problem and Chess Tournament Pairings , 1999 .
[174] Chien-Chung Huang,et al. Cheating to Get Better Roommates in a Random Stable Matching , 2007, STACS.
[175] L. G. Proll,et al. A Simple Method of Assigning Projects to Students , 1972 .
[176] Laurent Viennot,et al. Acyclic Preference Systems in P2P Networks , 2007, Euro-Par.
[177] P. Hall. On Representatives of Subsets , 1935 .
[178] K. Iwama,et al. A Survey of the Stable Marriage Problem and Its Variants , 2008, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008).
[179] Thayer Morrill,et al. The roommates problem revisited , 2008, J. Econ. Theory.
[180] Atila Abdulkadiroglu,et al. Advances in Economics and Econometrics: Matching Markets: Theory and Practice , 2013 .
[181] B. Korte,et al. An Analysis of the Greedy Heuristic for Independence Systems , 1978 .
[182] Tamás Fleiner,et al. A Fixed-Point Approach to Stable Matchings and Some Applications , 2003, Math. Oper. Res..
[183] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[184] Toby Walsh,et al. Weights in stable marriage problems increase manipulation opportunities , 2011, TARK XIII.
[185] Ning Chen,et al. Strongly Stable Assignment , 2010, ESA.
[186] Ahmed H. Abu El-Atta,et al. Student Project Allocation with Preference Lists over (Student, Project) Pairs , 2009, 2009 Second International Conference on Computer and Electrical Engineering.
[187] Robert W. Irving,et al. The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..
[188] Toby Walsh,et al. A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice , 2011, A Short Introduction to Preferences.
[189] Zoltán Király. Linear Time Local Approximation Algorithm for Maximum Stable Marriage , 2013, Algorithms.
[190] Katarína Cechlárová,et al. Pareto optimality in the kidney exchange problem , 2008, Kybernetika.
[191] Marina Papatriantafilou,et al. Overlays with preferences: Approximation algorithms for matching with preference lists , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).
[192] L. B. Wilson,et al. The stable marriage problem , 1971, Commun. ACM.
[193] Christine Jolls,et al. The Market for Federal Judicial Law Clerks , 2007 .
[194] Michel Balinski,et al. The stable admissions polytope , 2000, Math. Program..
[195] Aseem Agrawal,et al. Polynomial time algorithm for an optimal stable assignment with multiple partners , 2007, Theor. Comput. Sci..
[196] David Cantala. Matching Markets: the Particular Case of Couples , 2004 .
[197] Dai Tri Man Le,et al. The complexity of the comparator circuit value problem , 2012, TOCT.
[198] Steven Orla Kimbrough,et al. On heuristics for two-sided matching: revisiting the stable marriage problem as a multiobjective problem , 2010, GECCO '10.
[199] Nicole Immorlica,et al. The Unsplittable Stable Marriage Problem , 2006, IFIP TCS.
[200] Guillaume Ratier,et al. On the stable marriage polytope , 1996, Discret. Math..
[201] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[202] Elena Molis,et al. Random paths to P-stability in the roommate problem , 2008, Int. J. Game Theory.
[203] Telikepalli Kavitha,et al. Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems , 2006, ISAAC.
[204] Matthew O. Jackson,et al. The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..
[205] D. Manlove,et al. Keeping partners together: algorithmic results for the hospitals/residents problem with couples , 2010, J. Comb. Optim..
[206] F. Claas,et al. The Dutch National Living Donor Kidney Exchange Program , 2005, American journal of transplantation : official journal of the American Society of Transplantation and the American Society of Transplant Surgeons.
[207] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[208] David Manlove,et al. Two algorithms for the Student-Project Allocation problem , 2007, J. Discrete Algorithms.
[209] Pedro Meseguer,et al. Distributed Stable Matching Problems with Ties and Incomplete Lists , 2006, CP.
[210] Alvin E. Roth,et al. Pairwise Kidney Exchange , 2004, J. Econ. Theory.
[211] David Manlove,et al. Student-Project Allocation with Preferences over Projects , 2008, ACiD.
[212] David F. Manlove,et al. Stable Marriage with Ties and Unacceptable Partners , 1999 .
[213] Michael E. Saks,et al. Every finite distributive lattice is a set of stable matchings for a small stable marriage instance , 1987, J. Comb. Theory, Ser. A.
[214] David Manlove,et al. The structure of stable marriage with indifference , 2002, Discret. Appl. Math..
[215] Marilda Sotomayor,et al. The pareto-stability concept is a natural solution concept for discrete matching markets with indifferences , 2011, Int. J. Game Theory.
[216] F. Kojima,et al. Efficiency in Matching Markets with Regional Caps: The Case of the Japan Residency Matching Program , 2010 .
[217] Julián Mestre,et al. Weighted popular matchings , 2006, TALG.
[218] Elena Molis,et al. The stability of the roommate problem revisited , 2010 .
[219] H. Scarf. The Core of an N Person Game , 1967 .
[220] David Manlove,et al. Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.
[221] Si-Qing Zheng,et al. A Parallel Iterative Improvement Stable Matching Algorithm , 2003, HiPC.
[222] Chien-Chung Huang,et al. Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems , 2007, ESA.
[223] Sang Won Bae,et al. Geometric stable roommates , 2009, Inf. Process. Lett..
[224] Eric McDermid,et al. Three-Sided Stable Matchings with Cyclic Preferences , 2010, Algorithmica.
[225] David Manlove,et al. The College Admissions problem with lower and common quotas , 2010, Theor. Comput. Sci..
[226] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[227] L. Shapley,et al. On cores and indivisibility , 1974 .
[228] Michel Balinski,et al. The Stable Allocation (or Ordinal Transportation) Problem , 2002, Math. Oper. Res..
[229] Péter Biró,et al. Analysis of stochastic matching markets , 2013, Int. J. Game Theory.
[230] Jana Hajduková,et al. Stable partitions with W -preferences , 2004, Discret. Appl. Math..
[231] David Manlove,et al. Efficient algorithms for generalized Stable Marriage and Roommates problems , 2007, Theor. Comput. Sci..
[232] Christian Bessiere,et al. Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.
[233] Celina M. H. de Figueiredo,et al. The stable marriage problem with restricted pairs , 2003, Theor. Comput. Sci..
[234] Atila Abdulkadiroglu,et al. School Choice: A Mechanism Design Approach , 2003 .
[235] Kazutoshi Ando,et al. 安定 b-マッチング問題に対する線型時間アルゴリズム A Linear Time Algorithm for the Stable b-matching Problem 安藤和敏 , 2006 .
[236] Robert W. Irving,et al. Stable matching with couples: An empirical study , 2011, JEAL.
[237] Jean-François Puget,et al. Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming , 2001, Interfaces.
[238] Andrew V. Goldberg,et al. Scaling algorithms for the shortest paths problem , 1995, SODA '93.
[239] Uriel G. Rothblum,et al. Canonical monotone decompositions of fractional stable matchings , 1996 .
[240] Marilda Sotomayor,et al. An elementary non-constructive proof of the non-emptiness of the core of the Housing Market of Shapley and Scarf , 2005, Math. Soc. Sci..
[241] L. Lovász,et al. Annals of Discrete Mathematics , 1986 .
[242] Tomás Feder,et al. Network flow and 2-satisfiability , 1994, Algorithmica.
[243] Nimrod Megiddo,et al. A sublinear parallel algorithm for stable matching , 1994, SODA '94.
[244] M. Utku Ünver,et al. Efficient Kidney Exchange: Coincidence of Wants in a Markets with Compatibility-Based Preferences , 2009 .
[245] Tamás Fleiner,et al. A Matroid Approach to Stable Matchings with Lower Quotas , 2012, Math. Oper. Res..
[246] Uriel G. Rothblum,et al. "Timing Is Everything" and Marital Bliss , 2002, J. Econ. Theory.
[247] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[248] Ashok Subramanian,et al. A New Approach to Stable Matching Problems , 1989, SIAM J. Comput..
[249] Yu Zhang,et al. The Determinants of National College Entrance Exam Performance in China - With an Analysis of Private Tutoring , 2011 .
[250] Robert E. Tarjan,et al. Faster scaling algorithms for general graph matching problems , 1991, JACM.
[251] Andrew Postlewaite,et al. Weak Versus Strong Domination in a Market with Indivisible Goods , 1977 .
[252] Toby Walsh,et al. Manipulation complexity and gender neutrality in stable marriage procedures , 2009, Autonomous Agents and Multi-Agent Systems.
[253] Robert W. Irving,et al. An efficient algorithm for the “optimal” stable marriage , 1987, JACM.
[254] David Manlove,et al. Finding large stable matchings , 2009, JEAL.
[255] Arthur T. Benjamin,et al. How Do I Marry Thee? Let Me Count the Ways! , 1995, Discret. Appl. Math..
[256] Uriel G. Rothblum,et al. Characterization of stable matchings as extreme points of a polytope , 1992, Math. Program..
[257] Akihisa Tamura,et al. Transformation from Arbitrary Matchings to Stable Matchings , 1993, J. Comb. Theory, Ser. A.
[258] Ernst W. Mayr,et al. The Complexity of Circuit Value and Network Stability , 1992, J. Comput. Syst. Sci..
[259] Parag A. Pathak,et al. Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match , 2009 .
[260] Dimitris Magos,et al. Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem , 2012, INFORMS J. Comput..
[261] Fabien Mathieu,et al. Upper Bounds for Stabilization in Acyclic Preference-Based Systems , 2007, SSS.
[262] Vijay Kumar,et al. Assignment Problems in Rental Markets , 2006, WINE.
[263] Boris Spieker. The Set of Super-stable Marriages Forms a Distributive Lattice , 1995, Discret. Appl. Math..
[264] Gregg O'Malley,et al. Modelling and Solving the Stable Marriage Problem Using Constraint Programming , 2005 .
[265] Alvin E. Roth,et al. Matching and Market Design , 2008 .
[266] Adam Wierman,et al. Peer Effects and Stability in Matching Markets , 2011, SAGT.
[267] Robert W. Irving,et al. An Upper Bound for the Solvability of a Random Stable Roommates Instance , 1994, Random Struct. Algorithms.
[268] Frédéric Maffray,et al. Kernels in perfect line-graphs , 1992, J. Comb. Theory, Ser. B.
[269] Michel Balinski,et al. Of Stable Marriages and Graphs, and Strategy and Polytopes , 1997, SIAM Rev..
[270] Paul G. Spirakis,et al. Algorithmic Game Theory, N. Nisan, T. Roughgarden, È. Tardos, V. Vazirani (Eds.). Cambridge University Press (2007), Foreword by C.H. Papadimitriou , 2009 .
[271] A. Roth. Stability and Polarization of Interests in Job Matching , 1984 .
[272] Dai Tri Man Le,et al. A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem , 2011, CSL.
[273] Coralio Ballester,et al. NP-completeness in hedonic games , 2004, Games Econ. Behav..
[274] David Manlove. Hospitals/Residents Problem , 2008, Encyclopedia of Algorithms.
[275] J. V. Vate. Linear programming brings marital bliss , 1989 .
[276] Bhaskar Dutta,et al. Stability of matchings when individuals have preferences over colleagues , 1997 .
[277] Nicole Immorlica,et al. Two-sided matching with partial information , 2013, EC '13.
[278] A. Roth,et al. Random paths to stability in two-sided matching , 1990 .
[279] V. Rich. Personal communication , 1989, Nature.
[280] Telikepalli Kavitha,et al. Efficient algorithms for maximum weight matchings in general graphs with small edge weights , 2012, SODA.
[281] Akihisa Tamura,et al. A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model , 2003, ISAAC.
[282] Lars-Gunnar Svensson. Strategy-proof allocation of indivisible goods , 1999 .
[283] Toby Walsh,et al. Male optimal and unique stable marriages with partially ordered preferences , 2009, CARE 2009.
[284] Zhengnan Shi,et al. A Self-stabilizing Algorithm for Maximum Popular Matching of Strictly Ordered Preference Lists , 2009 .
[285] Günter J. Hitsch,et al. Matching and Sorting in Online Dating , 2008 .
[286] Nick McKeown,et al. Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..
[287] Tamás Fleiner,et al. Egerváry Research Group on Combinatorial Optimization on the Stable B-matching Polytope on the Stable B-matching Polytope , 2022 .
[288] Telikepalli Kavitha,et al. Popular matchings in the stable marriage problem , 2011, Inf. Comput..
[289] David Cantala. Agreement toward stability in matching markets , 2011 .
[290] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[291] Uriel G. Rothblum,et al. Paths to Marriage Stability , 1995, Discret. Appl. Math..
[292] Dan Gusfield,et al. Three Fast Algorithms for Four Problems in Stable Marriage , 1987, SIAM J. Comput..
[293] Eric McDermid,et al. Sex-Equal Stable Matchings: Complexity and Exact Algorithms , 2012, Algorithmica.
[294] Ahmed H. Abu El-Atta,et al. A Visual Implementation of Student Project Allocation , 2011 .
[295] A. Roth. The college admissions problem is not equivalent to the marriage problem , 1985 .
[296] Katarína Cechlárová,et al. On the stable b-matching problem in multigraphs , 2008, Discret. Appl. Math..
[297] U. Rothblum,et al. Truncation Strategies in Matching Markets-in Search of Advice for Participants , 1999 .
[298] Gregg O'Malley,et al. Algorithmic aspects of stable matching problems , 2007 .
[299] Antonio Romero-Medina,et al. Implementation of stable solutions in a restricted matching market , 1998 .
[300] David Manlove,et al. Popular matchings in the weighted capacitated house allocation problem , 2010, J. Discrete Algorithms.
[301] Ioannis Mourtos,et al. Finding a minimum-regret many-to-many Stable Matching , 2013 .
[302] Charles Blair,et al. The Lattice Structure of the Set of Stable Matchings with Multiple Partners , 1988, Math. Oper. Res..
[303] Ahmet Alkan,et al. A class of multipartner matching markets with a strong lattice structure , 2002 .
[304] Tobias Langner,et al. Stability vs. Cost of Matchings , 2011, ArXiv.
[305] Pontus Strimling. How unstable are matching from decentralized mate search , 2005 .
[306] Vijay V. Vazirani,et al. A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..
[307] Katarína Cechlárová,et al. The Kidney Exchange Game , 2005 .
[308] Eytan Ronn,et al. On the complexity of stable matchings with and without ties , 1986 .
[309] Christopher Umans,et al. The Complexity of Rationalizing Matchings , 2008, ISAAC.
[310] Tomomi Matsui,et al. Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists , 2010, Algorithmica.
[311] Mirco Gelain. Reasoning with incomplete and imprecise preferences , 2011 .
[312] Frank Harary,et al. Maximum versus minimum invariants for graphs , 1983 .
[313] Akihisa Tamura. Stable Marriage and Discrete Convex Analysis , 2016, Encyclopedia of Algorithms.
[314] David Manlove,et al. A Constraint Programming Approach to the Stable Marriage Problem , 2001, CP.
[315] Michel Balinski,et al. Admissions and Recruitment , 2003, Am. Math. Mon..
[316] Uriel G. Rothblum,et al. Courtship and linear programming , 1995 .
[317] Tal Malkin,et al. How Should We Solve Search Problems Privately? , 2008, Journal of Cryptology.
[318] David Manlove,et al. An algorithm for a super-stable roommates problem , 2011, Theor. Comput. Sci..
[319] Peter C. Fishburn,et al. Preference Structures and Their Numerical Representations , 1999, Theor. Comput. Sci..
[320] David Manlove,et al. The stable marriage problem with master preference lists , 2008, Discret. Appl. Math..
[321] Tayfun Sönmez,et al. Manipulation via Capacities in Two-Sided Matching Markets , 1997 .
[322] Boris Pittel,et al. The stable roommates' problem with random preferences , 1993 .
[323] Yuang-Cheh Hsueh,et al. A unifying approach to the structures of the stable matching problems , 1991 .
[324] Bob P. Weems,et al. Bistable Versions of the Marriages and Roommates Problems , 1999, J. Comput. Syst. Sci..
[325] A. Roth. Incentive compatibility in a market with indivisible goods , 1982 .
[326] Weijia Jia,et al. Cyclic stable matching for three-sided networking services , 2013, Comput. Networks.
[327] Patrick Prosser,et al. An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists , 2002, ECAI.
[328] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[329] Boris G. Pittel,et al. An Upper Bound for the Solvability Probability of a Random Stable Roommates Instance , 2006 .
[330] L. S. Shapley,et al. College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..
[331] Ernst W. Mayr,et al. The complexity of circuit value and network stability , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[332] Ahmet Alkan,et al. On preferences over subsets and the lattice structure of stable matchings , 2001 .
[333] Patrick Prosser,et al. An n-ary Constraint for the Stable Marriage Problem , 2013, ArXiv.
[334] Marc Demange,et al. Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs , 2008, TAMC.
[335] Alvin E. Roth. Deferred acceptance algorithms: history, theory, practice, and open questions , 2008, Int. J. Game Theory.
[336] Olle Häggström,et al. Instability of matchings in decentralized markets with various preference structures , 2008, Int. J. Game Theory.
[337] Kimmo Eriksson,et al. Three-dimensional stable matching with cyclic preferences , 2006, Math. Soc. Sci..
[338] David Manlove,et al. The Hospitals/Residents Problem with Ties , 2000, SWAT.
[339] Sandy Scott,et al. A Study Of Stable Marriage Problems With Ties , 2005 .
[340] Shuichi Miyazaki,et al. A 1.875: approximation algorithm for the stable marriage problem , 2006, SODA '07.
[341] S. Muthukrishnan,et al. General auction mechanism for search advertising , 2008, WWW '09.
[342] Haris Aziz. Stable marriage and roommate problems with individual-based stability , 2013, AAMAS.
[343] Florian M. Biermann,et al. A Measure to Compare Matchings in Marriage Markets , 2011 .
[344] Telikepalli Kavitha. Popularity vs maximum cardinality in the stable marriage setting , 2012, SODA.
[345] Haim Kaplan,et al. Unique maximum matching algorithms , 1999, STOC '99.
[346] Yan Chen,et al. Improving Efficiency of On-Campus Housing: An Experimental Study , 2002 .
[347] Yann Chevaleyre,et al. A Short Introduction to Computational Social Choice , 2007, SOFSEM.
[348] Katarzyna E. Paluch. Popular and clan-popular b-matchings , 2012, Theor. Comput. Sci..
[349] Ngo Anh Vien,et al. Multiobjective Fitness Functions for Stable Marriage Problem using Genetic Algrithm , 2006, 2006 SICE-ICASE International Joint Conference.
[350] Daniel S. Hirschberg,et al. Complexity of the stable marriage and stable roommate problems in three dimensions , 1988 .
[351] Paul A. Robards,et al. Applying Two-Sided Matching Processes to the United States Navy Enlisted Assignment Process , 2001 .
[352] Edward G. Thurber. Concerning the maximum number of stable matchings in the stable marriage problem , 2002, Discret. Math..
[353] Robert W. Irving. The cycle roommates problem: a hard case of kidney exchange , 2007, Inf. Process. Lett..
[354] Michel Balinski,et al. Erratum: The Stable Allocation (or Ordinal Transportation) Problem , 2002, Math. Oper. Res..
[355] Jimmy J. M. Tan,et al. A Generalization of the Stable Matching Problem , 1995, Discret. Appl. Math..
[356] M. Utku Ünver,et al. Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration , 2006, Int. J. Game Theory.
[357] Xiaotie Deng,et al. On the complexity of equilibria , 2002, STOC '02.
[358] Boaz Patt-Shamir,et al. On the complexity of distributed stable matching with small messages , 2010, Distributed Computing.
[359] Qiwen Wang,et al. Majority Equilibrium of Distribution Centers Allocation in Supply Chain Management , 2005, WINE.
[360] Alvin E. Roth,et al. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .
[361] Atila Abdulkadiroglu,et al. RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .
[362] David A. Freedman,et al. Machiavelli and the Gale-Shapley Algorithm , 1981 .
[363] Shuichi Miyazaki,et al. A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties , 2010, ESA.
[364] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[365] Christine T. Cheng,et al. Stable Roommates Matchings, Mirror Posets, Median Graphs, and the Local/Global Median Phenomenon in Stable Matchings , 2011, SIAM J. Discret. Math..
[366] Telikepalli Kavitha,et al. Dynamic Matching Markets and Voting Paths , 2006, SWAT.
[367] Katarína Cechlárová,et al. The stable crews problem , 2004, Discret. Appl. Math..
[368] Lawrence Bodin,et al. High Tech for a Higher Authority: The Placement of Graduating Rabbis from Hebrew Union College - Jewish Institute of Religion , 2003, Interfaces.
[369] Laurent Viennot,et al. On Using Matching Theory to Understand P2P Network Design , 2006, ArXiv.
[370] Marilda Sotomayor. Three remarks on the many-to-many stable matching problem , 1999 .
[371] Jimmy J. M. Tan. Stable matchings and stable partitions , 1991, Int. J. Comput. Math..
[372] David Manlove,et al. The Stable Roommates Problem with Ties , 2002, J. Algorithms.
[373] T. Fleiner. Stable and crossing structures , 2000 .
[374] Brian Aldershof,et al. Refined Inequalities for Stable Marriage , 1999, Constraints.
[375] Matthew K. Franklin,et al. Improved Efficiency for Private Stable Matching , 2007, CT-RSA.
[376] Stephan Mertens,et al. Random stable matchings , 2005 .
[377] Magnús M. Halldórsson,et al. Inapproximability Results on Stable Marriage Problems , 2002, LATIN.
[378] David Manlove,et al. The Stable Roommates Problem with Globally Ranked Pairs , 2007, WINE.
[379] Marina Papatriantafilou,et al. Adaptive Distributed b-Matching in Overlays with Preferences , 2012, SEA.
[380] David Manlove,et al. The Student-Project Allocation Problem , 2003, ISAAC.
[381] A. Roth,et al. New physicians: a natural experiment in market organization , 1990, Science.
[382] Marilda Sotomayor,et al. The lattice structure of the set of stable outcomes of the multiple partners assignment game , 1999, Int. J. Game Theory.
[383] J. S. Hwang. The algebra of stable marriages , 1986 .
[384] Tamás Fleiner,et al. Some results on stable matchings and fixed points , 2002 .
[385] Brian C. Dean,et al. The Generalized Stable Allocation Problem , 2009, WALCOM.
[386] Ahmet Alkan,et al. NONEXISTENCE OF STABLE THREESOME MATCHINGS , 1988 .
[387] Chung-Piaw Teo,et al. Many-to-One Stable Matching: Geometry and Fairness , 2006, Math. Oper. Res..
[388] Leslie Ann Goldberg,et al. The complexity of approximately counting stable matchings , 2010, Theor. Comput. Sci..
[389] Alexander Schrijver,et al. Median graphs and Helly hypergraphs , 1979, Discret. Math..
[390] Tayfun Sönmez,et al. CAN PRE-ARRANGED MATCHES BE AVOIDED IN TWO-SIDED MATCHING MARKETS? , 1999 .
[391] Parag A. Pathak,et al. The Boston Public School Match , 2005 .
[392] Péter Biró. Student Admissions in Hungary as Gale and Shapley Envisaged , 2008 .
[393] Akihisa Tamura,et al. A general two-sided matching market with discrete concave utility functions , 2006, Discret. Appl. Math..
[394] Magnús M. Halldórsson,et al. Improved Approximation of the Stable Marriage Problem , 2003, ESA.
[395] Toby Walsh,et al. Local Search for Stable Marriage Problems with Ties and Incomplete Lists , 2010, PRICAI.
[396] Péter Biró,et al. College admissions with stable score-limits , 2015, Central Eur. J. Oper. Res..
[397] Jinpeng Ma,et al. On randomized matching mechanisms , 1996 .
[398] Daniël Paulusma,et al. On Solution Concepts for Matching Games , 2010, TAMC.
[399] Paula Jaramillo,et al. The Difference Indifference Makes in Strategy-Proof Allocation of Objects , 2012, J. Econ. Theory.
[400] Toby Walsh,et al. Local search for stable marriage problems , 2010, ArXiv.
[401] Fabien Mathieu. Acyclic Preference-Based Systems A Self-Stabilizing Approach for P2P Systems , .
[402] Bettina Klaus,et al. Corrigendum: Stable Matchings and Preferences of Couples , 2007 .
[403] A. Roth,et al. The Effects of the Change in the NRMP Matching Algorithm , 1997 .
[404] Harold N. Gabow,et al. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.
[405] Péter Biró,et al. Inapproximability of the kidney exchange problem , 2007, Inf. Process. Lett..
[406] Tomás Feder,et al. A New Fixed Point Approach for Stable Networks and Stable Marriages , 1992, J. Comput. Syst. Sci..
[407] Noriyoshi Sukegawa,et al. Preference profiles determining the proposals in the Gale–Shapley algorithm for stable matching problems , 2012 .
[408] Valentin Polishchuk,et al. Almost Stable Matchings by Truncating the Gale–Shapley Algorithm , 2009, Algorithmica.
[409] Telikepalli Kavitha,et al. Popular mixed matchings , 2009, Theor. Comput. Sci..
[410] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[411] Harold N. Gabow,et al. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.
[412] M. Utku Ünver,et al. Matching, Allocation, and Exchange of Discrete Resources , 2009 .
[413] Magnús M. Halldórsson,et al. Randomized Approximation of the Stable Marriage Problem , 2003, COCOON.
[414] Brian Aldershof,et al. Stable Matchings with Couples , 1996, Discret. Appl. Math..
[415] M. Balinski,et al. A Tale of Two Mechanisms: Student Placement , 1999 .
[416] Jay Liebowitz,et al. Computational efficiencies for multi-agents: a look at a multi-agent system for sailor assignment , 2005, Electron. Gov. an Int. J..
[417] Shuji Kijima,et al. On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings , 2012, Math. Oper. Res..
[418] Tomás Feder. A new fixed point approach for stable networks stable marriages , 1989, STOC '89.
[419] Jana Hajduková,et al. Coalition Formation Games: a Survey , 2006, IGTR.
[420] Eytan Ronn,et al. NP-Complete Stable Matching Problems , 1990, J. Algorithms.
[421] Shuji Kijima,et al. Finding a Level Ideal of a Poset , 2009, COCOON.
[422] Telikepalli Kavitha,et al. Near-Popular Matchings in the Roommates Problem , 2011, SIAM J. Discret. Math..
[423] Uriel G. Rothblum,et al. A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion , 2008, Int. J. Game Theory.
[424] Kenji Onaga,et al. Autonomous Mechanism for Partner Exchanging in Distributed Stable Marriage Problems (Special Section of Papers Selected from ITC-CSCC'96) , 1997 .
[425] David Gale,et al. Ms. Machiavelli and the Stable Matching Problem , 1985 .
[426] Robert W. Irving. Stable matching problems with exchange restrictions , 2008, J. Comb. Optim..
[427] Daniel Monte,et al. The Daycare Assignment Problem , 2011 .
[428] Akiko Kato,et al. Complexity of the sex-equal stable marriage problem , 1993 .
[429] David Manlove,et al. A Constraint Programming Approach to the Hospitals / Residents Problem , 2007, CPAIOR.
[430] Leonard Pitt,et al. A bounded approximation for the minimum cost 2-sat problem , 1992, Algorithmica.
[431] Martin E. Dyer,et al. The Relative Complexity of Approximate Counting Problems , 2000, Algorithmica.
[432] Tamás Fleiner,et al. Stable roommates with free edges Kataŕına Cechlárová and Tamás Fleiner , 2009 .
[433] Robert W. Irving. Stable Marriage and Indifference , 1994, Discret. Appl. Math..
[434] José Alcalde Pérez,et al. Exchange-Proofness or Divorce-Proofness? Stability in One-Sided Matching Markets , 1995 .
[435] David Manlove,et al. Approximability results for stable marriage problems with ties , 2003, Theor. Comput. Sci..
[436] Chung-Piaw Teo,et al. Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications , 1999, IPCO.
[437] Shlomi Dolev,et al. Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..
[438] R. Zeckhauser,et al. The Efficient Allocation of Individuals to Positions , 1979, Journal of Political Economy.
[439] Katarína Cechlárová,et al. Stability Of Partitions Under WB-Preferences And BW-Preferences , 2004, Int. J. Inf. Technol. Decis. Mak..
[440] P. Gärdenfors. Match making: Assignments based on bilateral preferences , 1975 .
[441] Dorothea Kübler,et al. Telling the Truth May Not Pay Off : An Empirical Study of Centralized University Admissions in Germany , 2011 .
[442] Ioannis Mourtos,et al. Hyperarc Consistency for the Stable Admissions Problem , 2007 .
[443] Kim-Sau Chung,et al. On the Existence of Stable Roommate Matchings , 2000, Games Econ. Behav..
[444] Sushil Kumar,et al. Matchmaking using Fuzzy Analytical Hierarchy Process, Compatibility Measure and Stable Matching for , 2012 .
[445] D. J. Ho,et al. A systematic approach to the implementation of final year project in an electrical engineering undergraduate course , 1998 .
[446] Atila Abdulkadiroglu,et al. HOUSE ALLOCATION WITH EXISTING TENANTS , 1999 .
[447] Brian C. Dean,et al. Faster Algorithms for Stable Allocation Problems , 2010, Algorithmica.
[448] Daniel S. Hirschberg,et al. Lower Bounds for the Stable Marriage Problem and its Variants , 1990, SIAM J. Comput..
[449] Naoyuki Kamiyama,et al. A New Approach to the Pareto Stable Matching Problem , 2012, Math. Oper. Res..
[450] Katarína Cechlárová,et al. On a generalization of the stable roommates problem , 2005, TALG.
[451] Robert W. Irving. Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme , 1998, ESA.
[452] Uriel G. Rothblum,et al. Stable Matchings and Linear Inequalities , 1994, Discret. Appl. Math..
[453] Parag A. Pathak,et al. Matching with Couples: Stability and Incentives in Large Markets , 2010 .
[454] Katarína Cechlárová,et al. The kidney exchange problem: How hard is it to find a donor? , 2012, Ann. Oper. Res..
[455] Haris Aziz,et al. Housing Markets with Indifferences: A Tale of Two Mechanisms , 2012, AAAI.
[456] Bettina Klaus,et al. Procedurally fair and stable matching , 2004 .
[457] Telikepalli Kavitha,et al. Optimal popular matchings , 2009, Discret. Appl. Math..
[458] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[459] Ran Giladi,et al. Distributed Weighted Stable Marriage Problem , 2010, SIROCCO.
[460] Eric McDermid,et al. A unified approach to finding good stable matchings in the hospitals/residents setting , 2008, Theor. Comput. Sci..
[461] Chung-Piaw Teo,et al. On a cutting plane heuristic for the stable roommates problem and its applications , 2000, Eur. J. Oper. Res..
[462] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[463] David Gale,et al. A further note on the stable matching problem , 1987, Discret. Appl. Math..
[464] Katarína Cechlárová,et al. Rotations in the stable b-matching problem , 2010, Theor. Comput. Sci..
[465] R. Fleischer,et al. Dynamic Pareto Optimal Matching , 2008, 2008 International Symposium on Information Science and Engineering.
[466] Toby Walsh,et al. Procedural fairness in stable marriage problems , 2011, AAMAS.
[467] A. Roth. A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom. , 1991, The American economic review.
[468] Arpita Ghosh,et al. Algorithms for Pareto Stable Assignment , 2010 .
[469] Shuichi Miyazaki,et al. A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem , 2005, ISAAC.
[470] Eric McDermid,et al. Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices , 2011, ICALP.
[471] Fabien Mathieu,et al. Stratification in P2P Networks: Application to BitTorrent , 2006, ICDCS.
[472] Kimmo Eriksson,et al. Stable outcomes of the roommate game with transferable utility , 2000, Int. J. Game Theory.
[473] Chung-Piaw Teo,et al. LP based approach to optimal stable matchings , 1997, SODA '97.
[474] Magnús M. Halldórsson,et al. Randomized approximation of the stable marriage problem , 2004, Theor. Comput. Sci..
[475] Vladimir Gurvich,et al. Stable matchings in three-sided systems with cyclic preferences , 2004, Discret. Math..
[476] Osamu Watanabe,et al. Weighted random popular matchings , 2010, Random Struct. Algorithms.
[477] A. Roth,et al. Market Culture: How Norms Governing Exploding Offers Affect Market Performance , 2004 .
[478] Michel Balinski,et al. Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) , 2000, Discret. Appl. Math..
[479] Alvin E. Roth,et al. The Economics of Matching: Stability and Incentives , 1982, Math. Oper. Res..
[480] Chi-Jen Lu,et al. Communication Requirements for Stable Marriages , 2010, CIAC.
[481] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..
[482] Pascal Van Hentenryck,et al. A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..
[483] S. P. Avann. Metric ternary distributive semi-lattices , 1961 .
[484] Jorge Alcalde-Unzu,et al. Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms , 2009, Games Econ. Behav..
[485] Michel Balinski,et al. Student admissions and faculty recruitment , 2004, Theor. Comput. Sci..
[486] Ioannis Damianidis,et al. The Stable Marriage Problem – Optimizing Different Criteria Using Genetic Algorithms , 2011 .
[487] Robert W. Irving. Optimal Stable Marriage , 2008, Encyclopedia of Algorithms.
[488] A. Roth,et al. Jumping the Gun: Imperfections and Institutions Related to the Timing of Market Transactions , 1994 .
[489] Colin T. S. Sng,et al. Efficient algorithms for bipartite matching problems with preferences , 2008 .
[490] Lars Ehlers,et al. Truncation Strategies in Matching Markets , 2008, Math. Oper. Res..
[491] M. Ostrovsky. Stability in Supply Chain Networks , 2005 .
[492] Yosef Blum,et al. Stable matchings and linear programming , 1996 .
[493] Shuichi Miyazaki,et al. A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem , 2004, SWAT.
[494] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[495] David Manlove,et al. The exchange-stable marriage problem , 2005, Discret. Appl. Math..
[496] A. Roth,et al. Turnaround Time and Bottlenecks in Market Clearing: Decentralized Matching in the Market for Clinical Psychologists , 1997, Journal of Political Economy.
[497] Makoto Yokoo,et al. Optimization in Private Stable Matching with Cost of Privacy Loss , 2008 .
[498] Felix Brandt,et al. Pareto Optimality in Coalition Formation , 2011, SAGT.
[499] Fan Wang,et al. A Survey on Reviewer Assignment Problem , 2008, IEA/AIE.
[500] Richard M. Karp,et al. Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).