SAGT 2018

The 11th International Symposium on Algorithmic Game Theory

 

Call for Papers

 

SAGT 2018 will be held at Peking University.

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
  • Complexity Classes in Game Theory
  • Computational Aspects of Equilibria
  • Computational Aspects of Fixed-Point Theorems
  • Repeated Games and Convergence of Dynamics
  • Reputation, Recommendation and Trust Systems
  • Network Games and Graph-Theoretic Aspects of Social Networks
  • Cost-Sharing Algorithms and Analysis
  • Algorithmic Mechanism Design
  • Computing with Incentives
  • Computational Social Choice
  • Decision Theory, and Pricing
  • Auction Design 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.

It is expected that every accepted paper will be presented at the symposium by one of the authors.

Submissions must be prepared in LNCS-style and limited to at most 12 pages. Additional material can be added in a clearly marked appendix. Accepted papers are presented in at most 12 pages in the proceedings. Alternatively, authors of accepted papers can publish only a one page abstract in the proceedings, along with a URL pointing to the full paper.

For more detailed submission guidelines and instructions see the conference webpage at SAGT 2018.

The submission is done via Easychair: https://easychair.org/conferences/?conf=sagt2018.