Agents cracked another open problem I worked on during my phd (seems legit, not human reviewed)

2-list stable matching in subquadratic time

github.com/nmamano/two-list-stable-matching-research

If you think all the O(n log^9999999999999999999999999 n) results are ridiculous, this improvement is even smaller.

The new runtime is smaller than Θ(n^2) but larger than Θ(n^(2-eps)) for any eps > 0.