Distributed stable matching problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 152-166

  Brito, Ismel ^a   Meseguer, Pedro ^a  

^a CSIC   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; INTELLIGENT AGENTS; POLYNOMIALS; PROBLEM SOLVING;

CENTRALIZED ALGORITHMS; STABLE MARRIAGE PROBLEM; STABLE MATCHING PROBLEMS;

COMBINATORIAL MATHEMATICS;

EID: 33646202963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_14     Document Type: Conference Paper

References (9)

1. Brito, I. and Meseguer, P. Distributed Forward Checking. Proc. CP-2003, 801-806, 2003.
2. Gale D. and Shapley L.S. College admissions and the stability of the marriage. American Mathematical Monthly. 69:9-15, 1962.
3. Gale D. and Sotomayor M. Some remarks on the stable matching problem. Discrete Applied Mathematics. 11:223-232, 1985.
4. Gent, I. P. and Irving, R. W. and Manlove, D. F. and Prosser, P. and Smith, B. M. A constraint programming approach to the stable marriage problem. Proc. CP-2001, 225-239, 2001.
5. Gent,I. and Prosser,P. An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists. Proc. ECAI-2002, 141-145, 2002.
6. Gusfield D. and Irving R. W. The Stable Marriage Problem: Structure and Algorithms. The MIT Press, 1989.
7. Meisels A., Kaplansky E., Razgon I., Zivan R. Comparing Performance of Distributed Constraint Processing Algorithms. AAMAS-02 Workshop on Distributed Constraint Reasoning, 86-93, 2002.
8. Lamport L. Time, Clock, and the Ordering of Events in a Distributed System. Communications of the ACM, 21(7), 558-565, 1978.
9. Yokoo M., Durfee E., Ishida T., Kuwabara K. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. Knowledge and Data Engineering 10 (1998) 673-685.