| 2025 | Mechanism Design for Auctions with Externalities on Budgets. | Yusen Zheng, Yukun Cheng, Chenyang Xu, Xiaotie Deng |
| 2025 | A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs. | Junyue Zhang, Yifen Mu |
| 2025 | TBDS: Transaction-Based Data Sharing. | Wu Xin, Hongyin Chen, Xiaoqi Dong, Jichen Li, Xiaotie Deng, Zhonghai Wu, Bin Xiao |
| 2025 | An LP-Rounding Based Algorithm for Soft Capacitated Facility Location Problem with Submodular Penalties. | Hanyin Xiao, Jiaming Zhang, Zhikang Zhang, Weidong Li |
| 2025 | Fair Value Distribution in Cooperative Committee Election. | Ying Qin, Zeyu Ren, Zihe Wang, Jie Zhang |
| 2025 | Oblivious Robots Under Round Robin: Gathering on Rings. | Alfredo Navarra, Francesco Piselli |
| 2025 | Large-Scale Contextual Market Equilibrium Computation Through Deep Learning. | Yunxuan Ma, Yide Bian, Hao Xu, Weitao Yang, Jingshu Zhao, Zhijian Duan, Feng Wang, Xiaotie Deng |
| 2025 | The Subinterval Cover Problem. | Kelin Luo, Chenran Yang, Zonghan Yang, Yuhao Zhang |
| 2025 | Finding a Set of Long Common Substrings with Repeats from m Input Strings. | Tiantian Li, Lusheng Wang, Daming Zhu |
| 2025 | Approximation Algorithms for Individual Preference Facility Location. | Shuilian Liu, Yicheng Xu, Yong Zhang |
| 2025 | The Online Power Cover Problem on a Line. | Zhonghao Liu, Man Xiao, Xiaofei Liu, Weidong Li |
| 2025 | Exact Algorithms for the Maximum k-Balanced Weighted Biclique Problem. | Jingyi Liu, Jianxin Wang, Qilong Feng, Feng Shi |
| 2025 | Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems. | Hongtao Liu, Weiran Shen, Yiheng Shen |
| 2025 | Improved Approximation of Maximin Share Fair Allocation Under Generalized Assignment Constraints. | Bo Li, Md. Habibur Rahman Sifat, Ankang Sun |
| 2025 | From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances. | Sangram K. Jena, K. Subramani |
| 2025 | Multiplication of 0-1 Matrices via Clustering. | Jesper Jansson, Miroslaw Kowaluk, Andrzej Lingas, Mia Persson |
| 2025 | Regularized Minimax-V Learning for Solving Randomly Terminating Two-Player Zero-Sum Markov Games. | Xinxiang Guo, Yifen Mu |
| 2025 | The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives. | Zifan Gong, Alexander Lam, Momcilo Mrkaic, Yachao Yan, Yingchao Zhao |
| 2025 | Minimizing Blocking Agents for Stable Matching with Partial Approval Information. | Yitian Gao, Jiaxue Li, Junjie Luo, Yiheng Zhang |
| 2025 | Characterizing Strategyproofness Through Score Functions in Voting Mechanisms. | Felipe V. Furquim, Valentin Dardilhac, Daniel Cordeiro, Johanne Cohen |
| 2025 | Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources. | Zhengyan Deng, Yusen Zheng, Chenliang Sheng, Shaowen Qin |
| 2025 | Less-Excludable Mechanism for DAOs in Public Good Auctions. | Jing Chen, Wentao Zhou |
| 2025 | A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer. | Zhou Chen, Qi Qi, Hao Sun, Muyang Zhao |
| 2025 | Mixed Graph Covering with Target Constraints. | Xujin Chen, Xiyuan Deng, Xiao-Dong Hu, Changjun Wang |
| 2025 | Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model. | Felix Buld, Andreas S. Schulz |