Algorithmic game theory (source code)

= Algorithmic game theory
{wiki}

<Algorithmic game theory> studies the interaction of <algorithms> with strategic behavior. It asks both how hard equilibria are to compute and how mechanisms should be designed when participants choose actions to improve their own <utility>.

For example, a shortest-path <algorithm> optimizes <travel time> for one specified traveler, while a <routing game> asks what happens when many travelers each choose a route. A <Nash equilibrium> can have a larger total delay than a centrally chosen allocation. Quantifying that loss by a <price of anarchy> links incentives with computational optimization. The input representation, <equilibrium> concept and allowed <running time> must all be specified.