this is to announce the SAGT2010 PC chairs' decision to extend the paper
submission deadline for one week. Therefore, the new submission deadline
is now May 10, 2010 (23:59 GMT).
An updated version of the SAGT2010 CFP is also attached.
With kind regards,
Spyros Kontogiannis
------------------------------------------------------------------
CALL FOR PAPERS
3rd International Symposium on Algorithmic Game Theory
October 18-20, 2010
Athens, GREECE
http://sagt2010.cti.gr/
------------------------------------------------------------------
IMPORTANT DATES
---------------
[NEW] SUBMISSION DEADLINE May 10, 2010, 23:59 GMT
NOTIFICATION OF AUTHORS June 28, 2010
CAMERA READY SUBMISSION July 27, 2010
SYMPOSIUM DATES October 18-20, 2010
------------------------------------------------------------------
PURPOSE
-------
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.
------------------------------------------------------------------
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
- 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
- Computational Social Choice
------------------------------------------------------------------
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
----------------
Prof. Amos Fiat, Tel Aviv University, ISRAEL
Prof. Paul W. Goldberg, University of Liverpool, UK
------------------------------------------------------------------
SUBMISSIONS
-----------
Authors are invited to submit extended abstracts presenting
original research on any of the research fields related to SAGT2010.
No simultaneous submission to other publication outlets (either a
conference or a journal) is allowed.
Submission Format: An extended abstract submitted to SAGT2010 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 11-point
font (including the references). If the authors believe that more
details are essential to substantiate the main 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.
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.
Our proceedings will be published by the LNCS series of Springer
Publications. Every accepted paper will have a space of at most 12
pages in LNCS style.
------------------------------------------------------------------
PUBLICATION
-----------
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
-----------------
CHAIRS
Elias Koutsoupias, National & Kapodistrian University of Athens, GREECE
Paul Spirakis, R.A. Computer Technology Institute, GREECE
PC MEMBERS
Itai Ashlagi, Harvard Business School, USA
Xi Chen, University of Southern California, USA
Xiaotie Deng, City University of Hong Kong, HONG KONG
Kousha Etessami, University of Edinburgh, UK
Michal Feldman, Hebrew University of Jerusalem, ISRAEL
Dimitris Fotakis, National Technical University of Athens, GREECE
Paul W. Goldberg, University of Liverpool, UK
Rica Gonen, Yahoo! Research, USA
Haim Kaplan, Tel Aviv University, ISRAEL
David Kempe, University of Southern California, USA
Spyros Kontogiannis, University of Ioannina, GREECE
Annamaria Kovacs, Goethe University Frankfurt/Main, GERMANY
Vangelis Markakis, Athens University of Economics and Business, GREECE
Marios Mavronicolas, University of Cyprus, CYPRUS
Aranyak Mehta, Google Research, USA
Maher Said, Microsoft Research New England, USA
Seffi Naor, Technion - Israel Institute of Technology, ISRAEL
Michael Schapira, Yale University and UC Berkeley, USA
Bernhard von Stengel, London School of Economics and Political Science, UK
Berthold Voecking, RWTH Aachen University, GERMANY
------------------------------------------------------------------
STEERING COMMITTEE
------------------
Elias Koutsoupias, National & Kapodistrian University of Athens, GREECE
Marios Mavronicolas, University of Cyprus, CYPRUS
Dov Monderer, Technion-Israel Institute of Technology, ISRAEL
Burkhard Monien, University of Paderborn, GERMANY
Christos Papadimitriou, University of California at Berkeley, USA
Giuseppe Persiano, Universita di Salerno, ITALY
Paul Spirakis, R.A. Computer Technology Institute, GREECE (CHAIR)
Berthold Voecking, RWTH Aachen University, GERMANY
------------------------------------------------------------------
ORGANIZING COMMITTEE
--------------------
Spyros Kontogiannis, University of Ioannina, GREECE (Co-Chair)
Elias Koutsoupias, National & Kapodistrian University of Athens, GREECE
Paul Spirakis, R.A. Computer Technology Institute, GREECE (Co-Chair)
Rozina Efstathiadou, R.A. Computer Technology Institute, GREECE
Aggeliki Stamatopoulou, R.A. Computer Technology Institute, GREECE
------------------------------------------------------------------
SPONSORSHIPS
------------
The 3rd edition of SAGT is co-organized by the Research Academic
Computer Technology Institute and the National & Kapodistrian
University of Athens, in cooperation with the following organizations:
European Association for Theoretical Computer Science (EATCS)
ACM Special Interest Group on Electronic Commerce(SIGECOM)
------------------------------------------------------------------
LAST MODIFIED: 03/05/2010
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************