International Joint Conference On Theoretical Computer Science

August 16-20, 2021, Peking University, Beijing


Invited Speakers

Track A (Algorithmic Game Theory)

· Strongly Robust Exotic Option Pricing Via No-Regret Learning. ---- Ye Du (Southwestern University of Finance and Economics)

· Learning Utilities and Equilibria in Non-Truthful Auctions. ---- Hu Fu (SHUFE)

· Assortment games under Markov Chain Choice Model. ---- Changjun Wang (Chinese Academy of Sciences)

· Abstract Market Games with Gross Substitutes/Complements. ---- Zhigang Cao (Bejing Jiaotong University)



Track B (Game Theory in Blockchain)

· Speculative Smart Contracts. ---- Jing Chen (Stony Brook University and Algorand Inc)

· Framework and algorithms for identifying honest blocks in blockchain. ---- Xu Wang (Tsinghua University)

· Enabling an alternative trust model with Blockchain DB. ---- Artem Barger (Interdisciplinary research organization IDEAS)

· Sublinear-Round Byzantine Broadcast under Corrupt Majority ---- Hubert Chan (University of Hong Kong)

· Maximal Information Propagation via Lotteries. ---- Bo Li (The Hong Kong Polytechnic University)

· Dynamical Analysis of the EIP-1559 Ethereum Fee Market. ---- Georgios Piliouras (Singapore University of Technology and Design)

· A Study on Selection of Mining Block with Different Size Based on Evolutionary Game. ---- Yukun Cheng (SHUFE)

· Pool Block Withholding Attack with Rational Miners. ---- Chenhao Wang(Beijing Normal University at Zhuhai)

· Block-CES: Multi-institution collaborative credit evaluation system based on blockchain. ---- Yuncheng Qiao (Hunan University)

· An intelligent electric vehicle charging system for new energy companies based on consortium blockchain. ---- Zhengtang Fu (Beijing Institute of Technology)



Track C (Multi-agent Learning, Multi-agent System, Multi-agent Games)

· Model-based Digital Engineering and Verification of Intelligent Systems. ---- Holger Hermanns (Saarland University)

· Integrating knowledge-based and data-driven paradigms for collective intelligence decision making: algorithms and experiments. ---- Zhiqiang Pu (Chinese Academy of Sciences)

· MALib: A Parallel Framework for Population-based Multi-agent Reinforcement Learning. ---- Ying Wen (Shanghai Jiao Tong University)

· Reinforcement Learning for Incomplete Information Games. ---- Chao Yu (Sun Yat-sen University)

· Dealing with Non-transitivity in Two-player Zero-sum Games. ---- Yaodong Yang (King's College London)



Track D (Learning Theory)

· Provable Representation Learning. ---- Simon S. Du (University of Washington)

· Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning. ---- Lin Yang (University of California, Los Angeles)

· The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces. ---- Chi Jin (Princeton University)


Track E (Quantum Computing)

· 基于玻色模式的量子纠错与容错.---- 孙麓岩(清华大学)

· Quantum Artificial Intelligence  The Recent Advances. ---- Dongling Deng (Tsinghua University)

· Perturbative quantum simulation. ---- Xiao Yuan (Peking University)

· Quantum Algorithms for Semidefinite Programs with Applications to Machine Learning. ---- Tongyang Li (Peking University)


Track F (Machine Learning and Formal Method)

· Explaining Deep Neural Networks using Statistical Fault Localization. ---- Youcheng Sun (Queen's University Belfast)

· Safety Verification of Neural-Network Controlled Systems. ---- Chao Huang (University of Liverpool)

· Robustness Analysis for DNNs from the Perspective of Model Learning. ---- Cheng-chao Huang (Nanjing Institute of Software Technology)

· BDD4BNN: A BDD-based Quantitative Analysis Framework for Binarized Neural Networks. ---- Fu Song (ShanghaiTech University)

· Model-based Digital Engineering and Verification of Intelligent Systems. ---- Holger Hermanns (Saarland University)


Track G (The 15th Frontiers of Algorithmics Workshop)

· Fast sampling constraint satisfaction solutions via the Lovász local lemma. ---- Yitong Yin (Nanjing University)

· Tight Online Algorithms for Unrelated Machine Load Balancing with Predictions. ---- Shi Li (University at Buffalo)

· Approximation algorithms for the directed path partition problems. ---- Yong Chen (Hangzhou Dianzi University)

· Hardness and Algorithms for Electoral Manipulation under Media Influence. ---- Liangde Tao (Zhejiang University)

· Improved approximation algorithms for multiprocessor scheduling with testing. ---- Mingyang Gong (University of Alberta)

· Faster Algorithms for k-Subset Sum and variations. ---- Manolis Vasilakis (National Technical University of Athens)


Track H (EconCS)

· Candidate Selections with Proportional Fairness Constraints. ---- Shengxin Liu (Harbin Institute of Technology, Shenzhen)

· Multiplayer bandit learning, from competition to cooperation ---- Simina Brânzei (Purdue University)

· Fair division of indivisible goods. ---- Jugal Garg (University of Illinois at Urbana-Champaign)

· Eliciting Expert Information without Verification. ---- Grant Schoenebeck (University of Michigan)


Track I (Conscious Turing Machine)

· Insights from the Conscious Turing Machine. ---- Manuel Blum (Carnegie Mellon University, Emeritus) and Lenore Blum (Carnegie Mellon University, Emeritus)

· Mathematical Foundations of CTM. ---- Rui Ding (Peking University) and Lingxiao Zheng (Peking University)

· Doorway CTM: Explaning forgetting via Conscious Turing Machine. ---- Lan Lyu (Peking University), Chang Ma (Peking University) and Bowen Su (Peking University)

· MusiCTM: On Music Composing by CTM. ---- Shuchen Li (Peking University)


Undergraduate Research Forum

· The Smoothed Complexity of Computing Kemeny and Slater Rankings. ---- Weiqiang Zheng (Peking University)

· Optimal Multi-Dimensional Mechanisms are not Local. ---- Zixin Zhou (Peking University)

· Timely Information from Prediction Markets. ---- Chenkai Yu (Tsinghua University)

· Random Order Vertex Arrival Contention Resolution Schemes For Matching, With Applications. ---- Jinzhao Wu (Peking University)

· Maximizing Surprise with a Bonus. ---- Zhihuan Huang (Peking University)

· Recent Progress on Bandits and RL with Nonlinear Function Approximation. ---- Jiaqi Yang (Tsinghua University)

· Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma. ---- Xin Lyu (Tsinghua University)

· Faster algorithms for distance sensitivity oracles. ---- Hanlin Ren (Tsinghua University)


Female Forum

· Optimal Advertising for Information Products. ---- Shuran Zheng (Harvard University)

· Debiasing Evaluations That Are Biased by Evaluations. ---- Jingyan Wang (Carnegie Mellon University)

· Designing a Combinatorial Financial Options Market. ---- Xintong Wang (Harvard University)


Young PhD Forum

· Making Method of Moments Great Again? -- How can GANs learn distributions. ---- Zehao Dou (Yale University)

· Cursed yet Satisfied Agents. ---- Juntao Wang (Harvard University)

· Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions. ---- Zhe Feng (Google Research)

· Counting solutions to random CNF formulas ---- Kuan Yang (Shanghai Jiao Tong University)

· Optimal Mixing of Glauber Dynamics via Spectral Independence Approach. ---- Zongchen Chen (MIT)

· Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. ---- Jiaheng Zhang (UC Berkeley)

· Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time. ---- Peixin Wang (University of Oxford)

· Maximin Fairness with Mixed Divisible and Indivisible Goods. ---- Xinhang Lu (Nanyang Technological University)

· Almost Tight Approximation Hardness for k-DST. ---- Chao Liao (Shanghai Jiao Tong Univerisity)


Young Faculty in TCS at CFCS

· Perturbative quantum simulation. ---- Xiao Yuan (Peking University)

· Quantum Algorithms for Semidefinite Programs with Applications to Machine Learning. ---- Tongyang Li (Peking University)

· Streaming Algorithms for Geometric Steiner Forest. ---- Shaofeng Jiang (Peking University)

· Efficient Document Exchange and Error Correcting Codes with Asymmetric Information. ---- Kuan Cheng (Peking University)

· Optimizing Multi-task Peer Prediction. ---- Yuqing Kong (Peking University)