Partially Recovering a Graph Alignment in the Correlated Erdös–Renyi Model Given two graphs, how can we partially recover one-to-one mapping between nodes that maximizes edge overlap? This problem, known as graph alignment appears settings such social network deanonymization and cellular biology. In “Partial Recovery Problem,” G. Hall L. Massoulié consider stylized mathematical model of problem...

Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real-life application problems are formalized as Distributed CSPs, they are often over-constrained and have no solution that satis es all constraints. This pap...