Chang Wang

arxiv

Contextual Bandits with Knapsacks beyond Worst Cases via Re-Solving (with Rui Ai, Zhaohua Chen, Xiaotie Deng, Yuqi Pan, and Mingwei Yang)

We study the problem of contextual bandit with knapsacks beyond the worst case. Under mild conditions, we establish the first $\tilde{O} (1)$ -regret bound under full information feedback and under partial information feedback. We obtain the results by applying the re-solving heuristic from network revenue management problems.

arxiv

Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties (with Zhaohua Chen, Xiaotie Deng, Jichen Li, and Mingwei Yang)

The 2024 ACM Web Conference (WWW'24 Oral) article

arxiv

Dynamic Budget Throttling in Repeated Second-Price Auctions (with Zhaohua Chen, Xiaotie Deng, Yuqi Pan, Zhuming Shi, and Qian Wang)

The 38th Annual AAAI Conference on Artificial Intelligence (AAAI'24) article

Lecture Notes in Chinese Chemistry Olympiad (with Suhao Lin)

Zhejiang University Press (2023) buy a copy errata

Discrete Math and Structures (with Xiaotie Deng)

Peking University Press (printing in progress) buy a copy

A textbook (in Chinese) designed for sophomore’s honors discrete mathematics course that concentrates on useful techniques in computer science research and features in conciseness and readability. By-product of TAing the discrete math course at PKU.

Working papers

Contextual Bandits with Knapsacks beyond Worst Cases via Re-Solving (with Rui Ai, Zhaohua Chen, Xiaotie Deng, Yuqi Pan, and Mingwei Yang)

Conference papers

Budget-Constrained Auctions with Unassured Priors: Strategic Equivalence and Structural Properties (with Zhaohua Chen, Xiaotie Deng, Jichen Li, and Mingwei Yang)

Dynamic Budget Throttling in Repeated Second-Price Auctions (with Zhaohua Chen, Xiaotie Deng, Yuqi Pan, Zhuming Shi, and Qian Wang)

Journal papers

Expository writings

Lecture Notes in Chinese Chemistry Olympiad (with Suhao Lin)

Discrete Math and Structures (with Xiaotie Deng)