47 citations · 136 across the 8 of their papers we have counts for
11 papers
Random Stable Matchings
Stephan Mertens
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting con…
Proof of the local REM conjecture for number partitioning II: growing energy scales
Christian Borgs, Jennifer Chayes, Stephan Mertens +1
We continue our analysis of the number partitioning problem with weights chosen i.i.d. from some fixed probability distribution with density . In Part I of this work, we est…
Proof of the local REM conjecture for number partitioning I: Constant energy scales
Christian Borgs, Jennifer Chayes, Stephan Mertens +1
The number partitioning problem is a classic problem of combinatorial optimization in which a set of numbers is partitioned into two subsets such that the sum of the numbers in…
Universality in the level statistics of disordered systems
Heiko Bauke, Stephan Mertens
Energy spectra of disordered systems share a common feature: if the entropy of the quenched disorder is larger than the entropy of the dynamical variables, the spectrum is locally…
The Easiest Hard Problem: Number Partitioning
Stephan Mertens
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random…
Threshold values of Random K-SAT from the cavity method
Stephan Mertens, Marc Mezard, Riccardo Zecchina
Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random -s…