Purpose

The purpose of SAGT is to bring together researchers from Computer Science, Economics, Physics, Biology and Mathematics to present and discuss original research at the intersection of Algorithms and Game Theory.

Scope

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

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

Program

The program will include both invited lectures and regular presentations. Each regular presentation will be accompanied by a paper in the Symposium proceedings.

Invited Speakers

Bruno Codenotti: Computational Game Theory
Xiaotie Deng: Computation and Incentives of Competitive Equilibria in a Matching Market

Submission

Authors are invited to submit extended abstracts presenting original research on any of the research fields related to SAGT2011. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed.

Submission Format: An extended abstract submitted to SAGT2011 should start with the title of the paper, each author's name, affiliation and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results, including motivation and a clear comparison with related work. The extended abstract should not exceed 12 single-spaced pages, using reasonable margins and at least 10-point font (excluding references and title page). If the authors believe that more details are essential to substantiate the claims of the paper, they may include a clearly marked appendix (with no space limit) that will be read at the discretion of the Program Committee. It is strongly recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately.

Submissions are to be made electronically, following the guidelines on the Symposium web page. Authors unable to submit electronically should contact the Program Chair to receive instructions.

Industrial application works and position papers presenting novel ideas, issues, challenges and directions are also welcome. PC members are also eligible to submit papers.

All submissions will be rigorously peer-reviewed and evaluated on the basis of the quality of their contribution, originality, soundness, and significance. The PC-coauthored papers will undergo the typical peer-reviewing procedure, but there will be a separate Committee to judge their quality and significance.

Important Dates

Submission Deadline: May 9, 2011, 23:59 GMT.
Notification: June 28, 2011.
Camera Ready Version: July 24, 2011.
Conference: October 17-19, 2011.

Submission Link

Papers must be submitted electronically to the submission server.

Presentation

It is expected that accepted papers will be presented at the Symposium by one of the authors.

Pubblication

The Symposium proceedings will be published by Springer in its LNCS series (Lecture Notes in Computer Science); they will be available for distribution at the conference. Each paper in the proceedings will be restricted to a maximum of 12 pages (in LNCS format). Extended and revised versions of selected papers will be considered for a Special Issue of the Theory of Computing Systems journal.

Program Committee

Yonatan Aumann, Bar-Ilan University, ISRAEL
Moshe Babaioff, Microsoft Research, USA
George Christodolou, University of Liverpool, UK
Xiatioe Deng, University of Liverpool, UK
Edith Elkind, Nanyang Technological University, SINGAPORE
Amos Fiat, Tel Aviv University, ISRAEL
Christos Kaklamanis, RACTI and University of Patras, GREECE
Elias Koutsoupias, National and Kapodistrian University of Athens, GREECE
Ron Lavi, The Technion -- Israel Institute of Technology, ISRAEL
Yishay Mansour, Tel Aviv University, ISRAEL
Marios Mavronicolas, University of Cyprus, CYPRUS
Peter Bro Miltersen, Aarhus University, DENMARK
Muthu Muthukrishnan, Rutgers University, USA
Paolo Penna, Università di Salerno, ITALY
Giuseppe Persiano, Università di Salerno, ITALY - CHAIR
Ariel Procaccia, Harvard University, USA
Amin Saberi, Stanford University, USA
Guido Schäfer, CWI and VU University Amsterdam, THE NETHERLANDS
James Schummer, Northwestern University, USA
Paul Spirakis, RACTI and University of Patras, GREECE
Berthold Vocking, RWTH Aachen University, GERMANY
Yinyu Ye, Stanford University, USA

Steering Committee

Elias Koutsoupias, National and Kapodistrian University of Athens, GREECE
Marios Mavronicolas, University of Cyprus, CYPRUS
Dov Monderer, The Technion -- Israel Institute of Technology, ISRAEL
Christos Papadimitriou, University of California at Berkeley, USA
Giuseppe Persiano, Università di Salerno, ITALY
Paul Spirakis, RACTI and University of Patras, GREECE - CHAIR
Berthold Vocking, RWTH Aachen University, GERMANY

Organizing Committee

Vincenzo Auletta, Università di Salerno, ITALY - CHAIR
Carlo Blundo, Università di Salerno, ITALY
Diodato Ferraioli, Università di Salerno, ITALY
Luigi Catuogno, Università di Salerno, ITALY
Francesco Pasquale, Università di Salerno, ITALY
Giuseppe Persiano, Università di Salerno, ITALY - CHAIR

Sponsorships

The 4th edition of SAGT is organized by the Università di Salerno in cooperation with the following organizations:

European Association for Theoretical Computer Science (EATCS)
ACM Special Interest Group on Electronic Commerce (SIGECOM)