Mariage stable / Stable marriage Stable marriage refers to a particular matching with constraints, introduced in the economic context of two-sided markets. The problem has a lot of other applications in different domains, like cloud computing, Internet content delivery or student affectation. Most of the up to now solutions are given for the synchronous model, in which executions proceed by rounds, and assume initialization. In this talk, we consider a distributed and asynchronous context, without initialization and asking for some sort of confidentiality. We propose a solution based on the ideas of the Gale and Shapley's solution, with the same complexity of O(n2) moves.