个人简介
王晨豪，男，现任北京师范大学珠海校区人工智能与未来网络研究院特聘副研究员，BNU-HKBU联合国际学院（UIC）理工科技学部计算机科学与技术系助理教授。在中国科学院数学与系统科学研究院应用数学研究所获得理学博士学位（运筹学专业），并在香港城市大学电脑科学系获得哲学博士学位（联合培养）。此后，在美国内布拉斯加林肯大学和日本九州大学从事博士后研究。研究兴趣包括算法、AI、计算经济学及相关领域，特别是计算机科学与经济学交叉领域中优化和博弈问题的算法和机制设计。已在高水平国际会议和期刊上发表论文20余篇，其中CCF A/B类论文10余篇。
学习经历
2018/09 – 2020/10：香港城市大学，计算机科学，博士
2015/09 – 2020/07：中国科学院数学与系统科学研究院，运筹学，博士
2011/09 – 2015/06：北京航空航天大学，数学与应用数学，学士
研究领域
算法博弈论与机制设计
计算社会选择（设施选址、投票选举、公平分配等）
组合优化与图论（近似算法、在线算法）
区块链安全问题
近期论文
查看导师最新文章
（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）
Hau Chan, Chenhao Wang: Mechanism Design for Improving Accessibility to Public Facilities. AAMAS 2023: 2116-2124
Minming Li, Chenhao Wang, Mengqi Zhang: Budget feasible mechanisms for facility location games with strategic facilities. Auton. Agents Multi Agent Syst. 36(2): 35 (2022)
Xiaomin Huang, Chenhao Wang: Discrete load balancing on complete bipartite graphs. Inf. Process. Lett. 175: 106224 (2022)
Zhongzheng Tang, Chenhao Wang, Hau Chan: On maximizing a monotone k-submodular function under a knapsack constraint. Oper. Res. Lett. 50(1): 28-31 (2022)
Bo Li, Chenhao Wang, Ruilong Zhang: A note on the online interval scheduling secretary problem. Oper. Res. Lett. 50(1): 72-75 (2022)
Zhongzheng Tang, Chenhao Wang, Hau Chan: Monotone k-submodular secretary problems: Cardinality and knapsack constraints. Theor. Comput. Sci. 921: 86-99 (2022)
Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao: Mechanisms for dual-role-facility location games: Truthfulness and approximability. Theor. Comput. Sci. 932: 69-83 (2022)
Ling Gai, Mengpei Liang, Chenhao Wang: Obnoxious Facility Location Games with Candidate Locations. AAIM 2022: 96-105
Jingwen Chen, Zhongzheng Tang, Chenhao Wang: Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm. AAIM 2022: 144-155
Hau Chan, Minming Li, Chenhao Wang, Yingchao Zhao: Facility Location Games with Ordinal Preferences. COCOON 2022: 138-149
Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang: Approximate Group Fairness for Clustering. CoRR abs/2203.17146 (2022)
Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang: Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. Inf. Process. Lett. 168: 106098 (2021)
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia, Zhongzheng Tang, Chenhao Wang, Ying Zhang: Algorithms for the metric ring star problem with fixed edge-cost ratio. J. Comb. Optim. 42(3): 499-523 (2021)
Chenhao Wang, Xiaoying Wu, Minming Li, Hau Chan: Facility's Perspective to Fair Facility Location Problems. AAAI 2021: 5734-5741
Haris Aziz, Hau Chan, ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang: Multi-Robot Task Allocation-Complexity and Approximation. AAMAS 2021: 133-141
Chenhao Wang, Mengqi Zhang: Fairness and Efficiency in Facility Location Problems with Continuous Demands. AAMAS 2021: 1371-1379
Longteng Duan, Zifan Gong, Minming Li, Chenhao Wang, Xiaoying Wu: Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance. COCOON 2021: 499-511
Ni Yang, Chenhao Wang, Bo Li: Pool Block Withholding Attack with Rational Miners. IJTCS-FAW 2021: 3-22
Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang: Approximate Group Fairness for Clustering. ICML 2021: 6381-6391
Jared Soundy, Chenhao Wang, Clay Stevens, Hau Chan: Game-theoretic Analysis of Effort Allocation of Contributors to Public Projects. IJCAI 2021: 405-411
Hau Chan, Aris Filos-Ratsikas, Bo Li, Minming Li, Chenhao Wang: Mechanism Design for Facility Location Problems: A Survey. IJCAI 2021: 4356-4365
Haris Aziz, Hau Chan, ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang: Multi-Robot Task Allocation - Complexity and Approximation. CoRR abs/2103.12370 (2021)
Zhongzheng Tang, Chenhao Wang, Hau Chan: On maximizing a monotone k-submodular function under a knapsack constraint. CoRR abs/2105.15159 (2021)
Hau Chan, Aris Filos-Ratsikas, Bo Li, Minming Li, Chenhao Wang: Mechanism Design for Facility Location Problems: A Survey. CoRR abs/2106.03457 (2021)
Hau Chan, Minming Li, Chenhao Wang: Facility Location Games with Ordinal Preferences. CoRR abs/2107.01649 (2021)
Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu: The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler. Theor. Comput. Sci. 838: 180-194 (2020)
Xujin Chen, Minming Li, Chenhao Wang: Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space. AAAI 2020: 1894-1901
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao: Mechanism Design for Facility Location Games with Candidate Locations. COCOA 2020: 440-452
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang: Price of Fairness in Budget Division for Egalitarian Social Welfare. COCOA 2020: 594-607
Minming Li, Chenhao Wang, Mengqi Zhang: Budgeted Facility Location Games with Strategic Facilities. IJCAI 2020: 400-406
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang: Price of Fairness in Budget Division for Egalitarian Social Welfare. CoRR abs/2010.09637 (2020)
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao: Mechanism Design for Facility Location Games with Candidate Locations. CoRR abs/2010.09640 (2020)
Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Yingchao Zhao: Truthful Mechanisms for Location Games of Dual-Role Facilities. AAMAS 2019: 1470-1478
Chenhao Wang, Xiaoying Wu: Cake Cutting with Single-Peaked Valuations. COCOA 2019: 507-516
Xujin Chen, Minming Li, Chenhao Wang: Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces. CoRR abs/1911.12109 (2019)
Xujin Chen, Xiaodong Hu, Chenhao Wang: The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. SAGT 2018: 189-200
Xujin Chen, Xiaodong Hu, Xiaohua Jia, Minming Li, Zhongzheng Tang, Chenhao Wang: Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. SAGT 2018: 256-260
Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang, Ying Zhang: Algorithms for the Ring Star Problem. COCOA (2) 2017: 3-16
京公网安备 11010802027423号