Algorithmic and Computational Game Theory

Game theory and computing have a long history: Von Neumann, the founder of game theory, was also one of the founders of computing, and the standard architecture for the digital computer is named the Von Neumann architecture in his honour. This century, there has been a huge expansion of interest in the use of game theoretic ideas in computing, largely driven by the expansion of the internet, and the need for new models for computer systems that recognise the importance of self-interest and strategic decision making.

This section therefore focusses on work at the intersection of game theory and computer science. On the one hand, we consider game theory from the perspective of computer science (How can solution concepts be efficiently computed? How can computation be used to make precise notions such as bounded rationality? What solution concepts are appropriate when decision-makers are computer programs?) On the other hand, we consider computation from the perspective of game theory (How can game theory inform the design of computer systems? How can game theoretic concepts inform the models used to give a semantic basis to computer systems?) In addition, the section will cover innovative applications involving game theoretic ideas in computing, and computational techniques in game theory, including system descriptions and benchmark data sets.