SAGT2010Overview

The purpose of the Symposium on Algorithmic Game Theory 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. The third edition of SAGT is organized jointly by the Research Academic Computer Technology Institute and the National & Kapodistrian University of Athens, and will take place in Athens, on October 18-20 2010.

Accepted papers of SAGT2010 appear in a special volume devoted to the event, in cooperation with the Lecture Notes in Computer Science (LNCS 6386) series of Springer Publications.

SAGT2010Topics

Authors are invited to submit previously unpublished work for possible presentation at this conference. New foundational work is solicited on topics including but not limited to:

• Solution Concepts in Game Theory
• Game Classes (e.g., Bimatrix, Potential, Bayesian)
• Exact and Approximate Computation of Equilibria
• Convergence and Learning in Games
• Complexity Classes in Game Theory
• Algorithmic Aspects of Fixed-Point Theorems
• Mechanisms, Incentives and Coalitions
• Cost-Sharing Algorithms and Analysis
• Computational Aspects of Market Equilibria
• Computational Problems in Economics, Finance, Decision 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

SAGT2010Previous Editions

• SAGT2009.
• SAGT2008.