Sunday, February 15, 2015

[DMANET] SAGT 2015 - Call for Papers

8th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY

SAGT 2015

http://sagt2015.mpi-inf.mpg.de/

Saarbruecken, Germany, Sep. 28 - Sep. 30, 2015

--------------------------------------------------

IMPORTANT DATES

- Submission: May 1, 2015.
- Notification: July 1, 2015.

--------------------------------------------------

The 8th International Symposium on Algorithmic Game Theory (SAGT) will
take place at Max-Planck-Institute for Informatics in Saarbruecken,
Germany, September 28-30. 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 Computation and Game Theory.


SUBMISSIONS
-----------

Authors are invited to submit contributions for possible presentation at
the conference. 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
- Algorithmic Mechanism Design
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Algorithms and Analysis
- Repeated Games
- Evolution and Learning in Games
- Convergence of Dynamics
- Coalitions, Coordination and Collective Action
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising

Industrial application works and position papers presenting novel ideas,
issues, challenges and directions are also welcome.

Submissions can take the form of regular papers or brief announcements.

Regular Submissions
-------------------

Regular submissions should take the form of an extended abstract of no
more than 12 pages (including title page and references) presenting
original research. They will be evaluated on significance, originality,
technical quality, and exposition. They should clearly establish the
research contribution, its relevance, and its relation to prior
research. The abstract must be prepared with Springer LNCS-style. If
necessary, the submission may be supplemented with a clearly marked
appendix, which will be reviewed at the discretion of the program committee.

The symposium proceedings shall be published by Springer in its LNCS
series. Accepted regular papers are presented in at most 12 pages. In
order to accommodate the publishing traditions of different fields,
authors of accepted papers can publish only a one page abstract in the
proceedings, along with a URL pointing to the full paper. This option is
available to accommodate subsequent publication in journals that would
not consider results that have been published in preliminary form in a
conference proceedings.

Simultaneous submission of regular papers to another conference with
published proceedings is not allowed. Results previously published or
presented at another archival conference prior to SAGT, or published (or
accepted for publication) at a journal prior to the submission deadline,
will not be considered for regular papers. Simultaneous submission of
results to a journal is allowed only if the author intends to publish
the paper as a one page abstract in SAGT'14. Papers that are accepted
and appear as a one page abstract can be subsequently submitted for
publication in a journal but may not be submitted to any other
conference that has published proceedings.

Brief Announcements
-------------------

Brief announcements present research that is original and unpublished,
or published, or currently submitted for publication in another
conference or journal. Submissions for brief announcement must be
prepared in LNCS-style, limited to at most 2 pages, and start their
title with "Brief Announcement:". Accepted brief announcements are
presented in at most 2 pages in the proceedings and by a short
presentation at the conference. Every rejected regular submission will
also be considered for invitation as brief announcement.

It is expected that all accepted contributions, regular papers and brief
announcements, are presented by one of the authors at the conference.

Additional information will be available on the conference webpage at
http://sagt2015.mpi-inf.mpg.de

Submission is done via Easychair:
https://www.easychair.org/conferences/?conf=sagt2015


PROGRAM COMMITTEE
-----------------
- Elliot Anshelevich, RPI
- Felix Brandt, TU Munich
- Edith Elkind, U. Oxford
- Angelo Fanelli, CNRS/U. Caen
- Felix Fischer, U. Cambridge
- Dimitris Fotakis, NTU Athens
- Nick Gravin, MSR New England
- Monika Henzinger, U. Vienna
- Martin Hoefer, MPI (chair)
- Max Klimm, TU Berlin
- Jochen Könemann, U. Waterloo
- Piotr Krysta, U. Liverpool
- Yishay Mansour, Tel Aviv U.
- Vahab Mirrokni, Google
- Peter Bro Miltersen, U. Aarhus
- Herve Moulin, U. Glasgow
- Rahul Savani, U. Liverpool
- Guido Schäfer, CWI
- Alexander Skopalik, Paderborn U.
- Vijay Vazirani, Georgia Tech


STEERING COMMITTEE
------------------
- Elias Koutsoupias, U. Oxford
- Marios Mavronicolas, U. Cyprus
- Dov Monderer, Technion
- Burkhard Monien, Paderborn U.
- Christos Papadimitriou, UC Berkeley
- Giuseppe Persiano, U. Salerno
- Paul Spirakis, U. Liverpool (chair)


ORGANIZING COMMITTEE
--------------------
- Christina Fries, MPI Informatik
- Martin Hoefer, MPI Informatik
- Bojana Kodric, MPI Informatik
- Paresh Nakhe, MPI Informatik


**********************************************************
*
* 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/
*
**********************************************************