The integral stable allocation problem on graphs

Discrete Optimization - Tập 7 - Trang 64-73 - 2010
Péter Biró1, Tamás Fleiner2
1Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK
2Department of Computer Science and Information Theory, Budapest University of Technology and Economics, H-1117, Magyar tudósok körútja 2, Budapest, Hungary

Tài liệu tham khảo

Baïou, 2002, The stable allocation (or ordinal transportation) problem, Math. Oper. Res., 27, 485, 10.1287/moor.27.3.485.310 Alkan, 2003, Stable schedule matching under revealed preference, J. Econom. Theory, 112, 289, 10.1016/S0022-0531(03)00096-6 Eguchi, 2003, A generalized Gale-Shapley algorithm for a discrete-concave stable-marriage model, vol. 2906, 495 Fleiner, 2003, On the stable b-matching polytope, Math. Social Sci., 46, 149, 10.1016/S0165-4896(03)00074-X Cechlárová, 2005, On a generalization of the stable roommates problem, ACM Trans. Algorithms, 1, 143, 10.1145/1077464.1077474 Irving, 2007, The stable fixtures problem—a many-to-many extension of stable roommates, Discrete Appl. Math., 155, 2118, 10.1016/j.dam.2007.05.015 Cechlárová, 2004, The stable crews problem, Discrete Appl. Math., 140, 1, 10.1016/j.dam.2003.05.003 Gale, 1962, College admissions and the stability of marriage, Amer. Math. Monthly, 69, 9, 10.2307/2312726 Roth, 1990, Two-sided matching, vol. 18 Gusfield, 1989, The stable marriage problem: Structure and algorithms Tan, 1991, A necessary and sufficient condition for the existence of a complete stable matching, J. Algorithms, 12, 154, 10.1016/0196-6774(91)90028-W Aharoni, 2003, On a lemma of Scarf, J. Combin. Theory Ser. B, 87, 72, 10.1016/S0095-8956(02)00028-X D. Lebedev, F. Mathieu, L. Viennot, A.-T. Gai, J. Reynier, F. Montgolfier, On using matching theory to understand P2P network design, in: Proceedings of International Network Optimization Conference, 2007. Abraham, 2007, The stable roommates problem with globally-ranked pairs, vol. 4858, 431 Roth, 1990, Random paths to stability in two-sided matching, Econometrica, 58, 1475, 10.2307/2938326 Tan, 1995, A generalization of the stable matching problem, Discrete Appl. Math., 59, 87, 10.1016/0166-218X(93)E0154-Q Pittel, 1994, An upper bound for the solvability probability of a random stable roommates instance, Random Structures Algorithms, 5, 465, 10.1002/rsa.3240050307 Biró, 2008, The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems, Internat. J. Game Theory, 36, 333, 10.1007/s00182-007-0084-3