Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

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. Imagine a town with two widget merchants. Customers prefer cheaper widgets, so the merchants must compete to set the lowest price.