中文

 

Call for Papers


Guidelines


Authors are invited to submit an abstract of one page or an extended abstract of no more than 12 pages, excluding references and the front page(s) (authors, affiliation, keywords, abstract, ...), presenting original research on the theory of computer science. All submissions must be formatted in the LIPIcs style and submitted via Easychair to the appropriate track of the conference, using the following link:

https://easychair.org/conferences/?conf=ijtcs2020

The use of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit.

No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are strongly encouraged to also make full versions of their submissions freely accessible in an on-line repository such as ArXiv, HAL, ECCC.

Every accepted paper it is required that at least one author attends the meeting and delivers the talk. The paper may be excluded from the proceedings if none of the authors attends the conference.

 

Topics


Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are:

Track A (Algorithmic Game Theory)


  • 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


Track B (Blockchain)


  • Consensus Algorithms
  • Cryptographic Primitives
  • Decentralized Economy and Finance
  • Network Formation and Analysis
  • Smart Contract Languages
  • Formal Aanlysis
  • Theoretical Studies of Existing Blockchain Systems
  • Privacy and the Right to be Forgotten
  • Scalability
  • Blockchain Interoperbility


Track C (Multi-agent Reinforcement Learning)


  • Communications in MARL
  • Opponent Modeling
  • Cooperation and Coordination
  • Dynamics of Multi-agent Strategies
  • Evaluation of MARL Algorithms
  • Logics for Multi-agent Strategies
  • Credit Assighment
  • Game Theory for MARL
  • MARL for Robot Control
  • MARL Applications


Track D (Learning Theory)


  • Statistical Learning Theory
  • Online learning, Bandit and Reinforcement Learning
  • Theory for Deep Learning
  • Theory for Semi-supervised, Unsupervised, Transfer, Multi-task Learning
  • Optimization for Machine Learning
  • Learning and Game Theory
  • Learning and Multi-agent Systems
  • Federated Learning. Privacy, Security and Robustness in Learning


Track E (Quantum Computing)


  • Quantum Algorithms
  • Models of Quantum Computation
  • Quantum Complexity Theory
  • Quantum Cryptography
  • Quantum Communication Complexity
  • Quantum Information Theory
  • Quantum Simulation
  • Quantum Coding Theory
  • Quantum Machine Learning
  • Fault-tolerant Quantum Computing

Track F (Machine Learning and Formal Method)


Track G (Algorithm and Complexity)