Dear colleagues,
Due to numerous requests, the submission deadline of SAGT 2021 has been extended until Sunday, May 16th, 2021 AoE.
Iannis & Kristoffer
=================================
SAGT 2021 Call for papers
https://events.au.dk/sagt2021/
The 14th International Symposium on Algorithmic Game Theory (SAGT) will take place in Aarhus, Denmark, from September 21th to September 24th, 2021.
The purpose of SAGT is to bring together researchers from Computer Science, Economics, Mathematics, Operations Research, Psychology, Physics, and Biology to present and discuss original research at the intersection of Algorithms and Game Theory.
Scope
The program of SAGT 2021 will include both invited lectures and presentations for refereed submissions. Authors are invited to submit previously unpublished work 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
* Algorithmic Mechanism Design
* Complexity Classes in Game Theory
* Computational Social Choice
* Auction Design and Analysis
* Computational Aspects of Equilibria and Fixed-Point Theorems
* Repeated Games and Convergence of Dynamics
* Computing with Incentives
* Economic Aspects of Security and Privacy
* Economic Aspects of Networks and Distributed Computing
* Strategic Aspects in Machine Learning
* Computational Advertising
Industrial application works and position papers presenting novel ideas, issues, challenges and directions are also welcome
Invited Speakers
* Yiling Chen, Harvard University
* Elias Koutsoupias, University of Oxford
* Rahul Savani, University of Liverpool
Submission instructions
Submissions should take the form of an extended abstract of no more than 14 pages (including title page, but excluding 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<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>. If necessary, the submission may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee.
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 publication as 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 2021.
There will be a SAGT 2021 Best Paper Award, accompanied by a prize of EUR 1,000 offered by Springer. Selected papers from SAGT 2021 will be invited to a special issue of Theoretical Computer Science<https://www.journals.elsevier.com/theoretical-computer-science>
Submission link: https://www.easychair.org/conferences/?conf=sagt2021.
Important Dates
* Submission deadline: May 11, 2021, 23:59 GMT May 16, 2021 AoE
* Notification: June 23, 2021 June 28, 2021
* Camera ready: July 6, 2021 June 12, 2021
* Tutorial Day: September 21, 2021
* Conference Dates: September 22-24, 2021
Contact
For any inquiries regarding SAGT 2021, please contact us by email to sagt2021@easychair.org<mailto:sagt2021@easychair.org>
**********************************************************
*
* 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/
*
**********************************************************