Around the world, algorithms are increasingly being asked to do something once reserved for human judgment: help decide who should remain free and who should be deprived of liberty. In recent years, ...

The auction algorithm is a simple, well-studied alternative to the Hungarian method that: scales well to large problems, is naturally parallelisable and fits JAX’s accelerator model, is widely used in ...

Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price. Unhappy with their meager profits, they meet one night in a ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Google’s June 2025 Core Update just finished. What’s notable is that while some say it was a big update, it didn’t feel disruptive, indicating that the changes may have been more subtle than game ...

Dynamic traffic assignment (DTA) models are integral to modern transportation research, offering frameworks to predict and optimise the flow of vehicles over time within complex networks. These models ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

In a standard paper assignment setting, a set $\mathcal{P}$ of $n^{(p)}$ papers needs to be assigned to a set $\mathcal{R}$ of $n^{(r)}$ reviewers. To ensure each ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: In the field of combinatorial optimization, numerous methods have been developed to address complex problems, including assignment, scheduling, and resource allocation. This paper presents a ...