Computer science tackles 30-year-old economics problem
MIT researchers generalize Nobel winner’s work on single-item auctions to auctions involving multiple items.
MIT researchers generalize Nobel winner’s work on single-item auctions to auctions involving multiple items.
MIT economist Parag Pathak engineers practical solutions to complicated education problems.
New algorithms make it easier to write rules for distributed-computing systems, such as networks of sensors, servers or robots.
If software companies design their algorithms with the sole intention of outperforming each other, the customer can be the loser.
By melding economics and engineering, researchers show that as social networks get larger, they usually get better at sorting fact from fiction.
Constantinos Daskalakis applies the theory of computational complexity to game theory, with consequences in a range of disciplines.