Should we apply brute force techniques to boost your developer profile? Yes, we should!
summary
Company matched.io converts the profile-vs-job matching problem into boolean formulas, encodes constraints as CNF encoding, and uses SAT solvers repeatedly in a binary search over salary to find the highest salary that yields at least ten matches. The pipeline produces concrete numbers: some salaries double (up to ~200%), mean adjusted salary ≈111% of listed, 45–47% of candidates get an upgrade while 43% get a downgrade, and overall matches increase by about 21%, showing the approach is practical for real datasets.
AI-written summary · about
chapters (7)
- 0:00Welcome
- 0:48Decision problems
- 5:43P vs NP question
- 7:05SAT solvers in practice
- 11:46Job matching at Match.io
- 13:13Optimizing developer salaries
- 18:43Conclusion
related talks
15mDivining Profiler Accuracy: An Approach to Approximate Profiler Accuracy Through(…)
56mKaizen-Driven Development: Carve Your Own Path
48mHow Complexity Theory Can Save Your Job
34mHacking The Corporate
01h 21mPerformance Really Matters
15mHeuristic Analysis from Source Code via Symbolic-Guided Optimization
01h 07mHappiness U-Curve: Navigating the AI Validation Bottleneck with Conformance Testing and(…)
01h 09mHow Does a Matching Engine Work