=================================================================== 19th International Symposium on Algorithmic Game Theory (SAGT) 2026 15th-18th September 2026, University of Augsburg, Germany https://www.uni-augsburg.de/de/fakultaet/fai/conferences/sagt-2026/ =================================================================== *** Accompanied by a Workshop on Mechanisms with Predictions by *** *** Vasilis Gkazelis and Guido Schäfer *** *** 14th-15th September 2026, University of Augsburg *** =================================================================== The purpose of SAGT is to bring together researchers from Computer Science, Economics, Mathematics, Operations Research, and related fields to present and discuss original research at the intersection of Algorithms and Game Theory. Foundational work is solicited on topics including but not limited to: Solution Concepts in Game Theory Efficiency of Equilibria and Price of Anarchy Computational Aspects of Equilibria Learning and Dynamics in Games Game-Theoretic Aspects of Networks Auction Design and Analysis Algorithmic Contract Design Mechanism Design and Pricing Internet Economics and Computational Advertising Reputation, Recommendation and Trust Systems Economic Aspects of Distributed Computing Blockchain and Cryptocurrencies Decision Theory and Information Design Computational Social Choice and Fair Division Market Design and Matching Markets Cooperative Game Theory =============== IMPORTANT DATES =============== Abstract Submission: 20 May 2026, anywhere on Earth Full-Paper Submission: 26 May 2026, anywhere on Earth Notification: 09 July 2026 Camera-Ready Submission: 15 July 2026 Conference: 15 - 18 September 2026 ======================= SUBMISSION INSTRUCTIONS ======================= Authors are invited to submit original research for possible presentation at the conference. Each paper will be evaluated on significance, originality, technical quality, and exposition. It should clearly establish the research contribution, its relevance, and its relation to prior research. *** Where to Submit *** SAGT 2026 uses Easychair. Submission server: https://easychair.org/conferences/?conf=sagt2026 The submission server is open! *** Submission Guidelines *** Submissions must be anonymous. SAGT 2026 will use double-blind reviewing like WINE, EC, and all other major conferences. Submissions should not reveal the identity of the authors in any way. In particular, authors’ names, affiliations, and email addresses should not appear anywhere in the submission. (In LNCS, \author{} and \institute{} fields should not be included.) Authors should refer to their prior work in a neutral manner (for example, say “XYZ showed” instead of “we showed”). Submissions may include work that has been publicly presented (as long as it has not appeared in published proceedings) or posted on arXiv or similar online repositories, provided that the submission itself is properly anonymized. Submissions may be up to 18 pages long (including title page and references) in LNCS format. Note that SAGT 2026 requires submissions in LNCS format (provided as part of Springer's LaTeX2e package). In addition, an appendix may be included at the end of the paper and will be read at the discretion of the reviewers. Submissions deviating from these guidelines may be rejected without review. Authors are strongly encouraged to structure their paper in a way that includes a clear presentation of the merits of the paper and a discussion of the importance of the results, as well as an exposition of the key conceptual and technical ideas. *** Author Guidelines *** The symposium proceedings will be published by Springer as a Lecture Notes in Computer Science (LNCS) proceedings volume. Accepted papers will be allocated at most 18 pages (including title page and references) in LNCS format in the proceedings. Please refer to Springer's Information for Authors for detailed guidelines on how to prepare the final manuscript. To accommodate the publishing traditions of different fields, authors of accepted papers can choose to publish a one-page abstract of their paper in the proceedings. The paper must then provide a URL referring to the full version of the paper; authors should guarantee the link to be reliable for at least two years. Such papers must be formatted and submitted just like regular papers (as described above). 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. Simultaneous submission to WINE 2026 is explicitly allowed. In case the paper is accepted for publication at SAGT, the authors have to withdraw the paper from WINE 2026. Simultaneous submission to other conferences with published proceedings is not allowed. Simultaneous submission of results to a journal is allowed only if the authors publish the paper as a one-page abstract in SAGT 2026. *** Proceedings and Special Issue *** Conference participants will have free access to the online conference proceedings of SAGT 2026. SAGT 2026 will extend invitations to a selection of accepted papers for publication in a dedicated special issue of the ACM Transactions on Economics and Computation (TEAC) (details will be communicated in due course). ======= CONTACT ======= The conference is organized by Pascal Lenzner (University of Augsburg) and Daniel Schmand (University of Bremen). Contact: SAGT2026@informatik.uni-augsburg.de =============================================================================================== ********************************************************** * * 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/ * **********************************************************