Charles Explorer logo
🇬🇧

Desk-mates (Stable Matching) with Privacy of Preferences, and a new Distributed CSP Framework

Publication at Faculty of Mathematics and Physics |
2005

Abstract

The paper describes a new distributed CSP approach to solving stable matching problems with privacy of preferences.