Algorithmic Game Theory
In algorithmic game theory we study problems that arise in applications involving the interaction of a large number of rational agents. Typical questions concern the incentives in such environments - will the agents agree on a common outcome? Is there more than one such stable outcome, is it "fair" or "efficient"? How can we adjust the incentives by appropriate means (e.g., payments, taxes, threads of punishment) to induce socially favorable outcomes?
For further information we refer to RWTHonline.