The annual meeting of the International Symposium on Algorithmic Game Theory (SAGT) is a worldwide meeting whose aim is to bring together researchers from Computer Science, Economics, Physics, Biology and Mathematics to present and discuss original research at the intersection of Algorithmics and Game Theory. It is intended as a forum covering the diverse areas comforming Algorithmic Game Theory, such as Solution Concepts in Game Theory; Efficiency of Equilibria and Price of Anarchy; Complexity Classes in Game Theory; Computational Aspects of Equilibria; Computational Aspects of Fixed-Point Theorems; Repeated Games; Evolution and Learning in Games; Convergence of Dynamics; Coalitions, Coordination and Collective Action; Reputation, Recommendation and Trust Systems; Graph-theoretic Aspects of Social Networks; Network Games; Cost-Sharing Algorithms and Analysis; Computing with Incentives; Algorithmic Mechanism Design; Computational Social Choice; Decision Theory, and Pricing; Auction Algorithms and Analysis; Economic Aspects of Distributed Computing; Internet Economics and Computational Advertising.
The contributions to this special issue were among the best papers presented at the 5th International Symposium on Algorithmic Game Theory (SAGT 2012) which was held October 22 and 23, 2012 at the Technical University of Catalonia, Barcelona, Spain. Those papers were subsequently invited to the TOCS journal. They were then refereed acording to the usual TOCS standards and accepted for this Special Issue of TOCS devoted to SAGT 2012.
We would like to thank all the authors that responded to our invitation and went through a quite severe refereeing process. Our special thanks to all the reviewers for their careful work that has certainly achieved its purpose. We also want to thank the staff of TOCS and its editor-in-chief Alan L. Selman for making this special issue possible and for their support.Barcelona, July 2015