Algorithmic Game Theory

Computational complexity of game-theoretic solutions

🎯 Challenge

💡 Story

🎮 Sandbox

📚 Deep Dive

✅ Quiz

▶️ Simulate

🐛 Debug

When Selfishness Backfires

Why can adding a road make traffic WORSE for everyone?

Algorithmic Game Theory studies what happens when strategic agents interact. It reveals surprising truths about equilibria, efficiency, and the limits of computation.

Braess's Paradox Challenge

A city adds a new highway to reduce commute times. Every driver chooses their route selfishly to minimize their own travel time.

What happens to average commute times after adding the new road?

Price of Anarchy Simulator

100 drivers choose between two routes. What's the cost of selfish routing?

Number of Drivers:

Selfish Equilibrium:

Average time: 50 minutes

Optimal (Coordinated):

Average time: 50 minutes

Price of Anarchy: 1.00x

Selfish routing costs everyone 0% more time!

Try the Braess Paradox challenge above! What happens when everyone acts selfishly?

The Arena

The Arena

The Arena

The Arena

Algorithmic Game Theory

Computational complexity of game-theoretic solutions

When Selfishness Backfires

Why can adding a road make traffic WORSE for everyone?

Braess's Paradox Challenge

Price of Anarchy Simulator

Price of Anarchy: 1.00x

Algorithmic Game Theory

Computational complexity of game-theoretic solutions

When Selfishness Backfires

Why can adding a road make traffic WORSE for everyone?

Braess's Paradox Challenge

Price of Anarchy Simulator

Price of Anarchy: 1.00x