Algorithmic Game Theory First International Symposium, SAGT 2008, Paderborn, Germany, April 30 - May 2, 2008, Proceedings

ThisvolumecontainsthepaperspresentedattheFirstInternationalSymposium on Algorithmic Game Theory (SAGT 2008) held from April 30 to May 2 in Paderborn, Germany. The purpose of SAGT is to bring together researchers from computer science, economics and mathematics to present and discuss original research at the intersection of algorithms and game theory. It is intended to cover all important areas of algorithmic game theory, such as: solution concepts in game theory; game classes (e. g., bimatrix, potential, Bayesian); exact and appro- mate computation of equilibria; convergence and learning in games; complexity classesingametheory;algorithmicaspectsof?xed-pointtheorems;mechanisms, incentives and coalitions; cost-sharing algorithms and analysis; computational aspects of market equilibria; computational problems in economics, ?nance, - cision theory and pricing; auction algorithms and analysis; price of anarchy and its relatives; representations of games and their complexity; economic aspects of distributed computing and the Internet; network formation on the Internet; congestion, routing and network design games; game-theoretic approaches to networking problems; Byzantine game theory. There were 60 submissions. Each submission was reviewed by three P- gramme Committee members. The committee decided to accept 28 papers. The programme also included three invited talks from outstanding researchers ChristosPapadimitriou, NobelMemorialPrizewinnerReinhardSeltenandPaul Spirakis. We would like to thank all the Programme Committee members and the external reviewers who assisted them in their work. The members of the Organizing Committee as well as the developer of the EasyChair conference system deserve our gratitude for their contributions throughout the preparations.