default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChenhao Wang 0001
Person information
- unicode name: 王晨豪
- affiliation: Beijing Normal University, Advanced Institute of Natural Sciences, Zhuhai, China
- affiliation: BNU-HKBU United International College (UIC), Zhuhai, China
- affiliation (former): Kyushu University, Fukuoka, Japan
- affiliation (former): University of Nebraska-Lincoln, Department of Computer Science and Engineering, Lincoln, NE, USA
- affiliation (former): City University of Hong Kong, Department of Computer Science, Hong Kong
- affiliation (former): University of Chinese Academy of Sciences, School of Mathematical Sciences, Beijing, China
- affiliation (former): Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing, China
Other persons with the same name
- Chenhao Wang — disambiguation page
- Chenhao Wang 0002 — Kumamoto University, Kumamoto, Japan
- Chenhao Wang 0003 — Shanghai Jiao Tong University, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Ling Gai, Mengpei Liang, Chenhao Wang
:
Two-facility-location games with mixed types of agents. Appl. Math. Comput. 466: 128479 (2024)- [j13]Xujin Chen, Xiaodong Hu, Chenhao Wang, Xiaoying Wu, Mengqi Zhang:
Algorithms for maximum social welfare of online random trading. Discret. Appl. Math. 354: 229-240 (2024) - [j12]Zhongzheng Tang, Jingwen Chen, Chenhao Wang:
Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. Theor. Comput. Sci. 984: 114320 (2024) - 2023
- [j11]Ling Gai, Mengpei Liang, Chenhao Wang:
Discrete facility location games with different preferences. J. Comb. Optim. 46(2): 17 (2023) - [j10]Hau Chan, Zifan Gong, Minming Li, Chenhao Wang, Yingchao Zhao:
Facility location games with ordinal preferences. Theor. Comput. Sci. 979: 114208 (2023) - 2022
- [j9]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) - [j8]Xiaomin Huang, Chenhao Wang:
Discrete load balancing on complete bipartite graphs. Inf. Process. Lett. 175: 106224 (2022) - [j7]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) - [j6]Bo Li, Chenhao Wang, Ruilong Zhang:
A note on the online interval scheduling secretary problem. Oper. Res. Lett. 50(1): 72-75 (2022) - [j5]Zhongzheng Tang, Chenhao Wang, Hau Chan:
Monotone k-submodular secretary problems: Cardinality and knapsack constraints. Theor. Comput. Sci. 921: 86-99 (2022) - [j4]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) - 2021
- [j3]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) - [j2]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) - 2020
- [j1]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)
Conference and Workshop Papers
- 2024
- [c28]Hau Chan, Xinliang Fu, Minming Li, Chenhao Wang:
Mechanism Design for Reducing Agent Distances to Prelocated Facilities. AAMAS 2024: 2180-2182 - [c27]Hau Chan, Jianan Lin, Chenhao Wang, Yanxi Xie:
Mechanism Design for Extending the Accessibility of Facilities. ECAI 2024: 3453-3460 - [c26]Zining Qin, Hau Chan, Chenhao Wang, Ying Zhang:
Mechanism Design for Building Optimal Bridges Between Regions. TAMC 2024: 332-343 - 2023
- [c25]Hau Chan, Chenhao Wang:
Mechanism Design for Improving Accessibility to Public Facilities. AAMAS 2023: 2116-2124 - [c24]Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia:
Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization. COCOA (1) 2023: 287-299 - [c23]Shiwen Wang, Chenhao Wang, Tian Wang, Weijia Jia:
Approval-Based Participatory Budgeting with Donations. COCOON (2) 2023: 404-416 - [c22]Zhongzheng Tang, Chenhao Wang:
Improved Analysis of Greedy Algorithm on k-Submodular Knapsack. ECAI 2023: 2338-2345 - [c21]Zhongzheng Tang, Jingwen Chen, Chenhao Wang:
An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization. IJTCS-FAW 2023: 15-28 - 2022
- [c20]Ling Gai, Mengpei Liang, Chenhao Wang:
Obnoxious Facility Location Games with Candidate Locations. AAIM 2022: 96-105 - [c19]Jingwen Chen, Zhongzheng Tang, Chenhao Wang:
Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm. AAIM 2022: 144-155 - [c18]Hau Chan, Minming Li, Chenhao Wang, Yingchao Zhao:
Facility Location Games with Ordinal Preferences. COCOON 2022: 138-149 - 2021
- [c17]Chenhao Wang, Xiaoying Wu, Minming Li, Hau Chan:
Facility's Perspective to Fair Facility Location Problems. AAAI 2021: 5734-5741 - [c16]Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang:
Multi-Robot Task Allocation-Complexity and Approximation. AAMAS 2021: 133-141 - [c15]Chenhao Wang, Mengqi Zhang:
Fairness and Efficiency in Facility Location Problems with Continuous Demands. AAMAS 2021: 1371-1379 - [c14]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 - [c13]Ni Yang, Chenhao Wang, Bo Li:
Pool Block Withholding Attack with Rational Miners. IJTCS-FAW 2021: 3-22 - [c12]Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang:
Approximate Group Fairness for Clustering. ICML 2021: 6381-6391 - [c11]Jared Soundy, Chenhao Wang, Clay Stevens, Hau Chan:
Game-theoretic Analysis of Effort Allocation of Contributors to Public Projects. IJCAI 2021: 405-411 - [c10]Hau Chan, Aris Filos-Ratsikas, Bo Li, Minming Li, Chenhao Wang:
Mechanism Design for Facility Location Problems: A Survey. IJCAI 2021: 4356-4365 - 2020
- [c9]Xujin Chen, Minming Li, Chenhao Wang:
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space. AAAI 2020: 1894-1901 - [c8]Zhongzheng Tang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao:
Mechanism Design for Facility Location Games with Candidate Locations. COCOA 2020: 440-452 - [c7]Zhongzheng Tang, Chenhao Wang, Mengqi Zhang:
Price of Fairness in Budget Division for Egalitarian Social Welfare. COCOA 2020: 594-607 - [c6]Minming Li, Chenhao Wang, Mengqi Zhang:
Budgeted Facility Location Games with Strategic Facilities. IJCAI 2020: 400-406 - 2019
- [c5]Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang, Yingchao Zhao:
Truthful Mechanisms for Location Games of Dual-Role Facilities. AAMAS 2019: 1470-1478 - [c4]Chenhao Wang, Xiaoying Wu:
Cake Cutting with Single-Peaked Valuations. COCOA 2019: 507-516 - 2018
- [c3]Xujin Chen, Xiaodong Hu, Chenhao Wang:
The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. SAGT 2018: 189-200 - [c2]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 - 2017
- [c1]Xujin Chen, Xiaodong Hu, Zhongzheng Tang, Chenhao Wang, Ying Zhang:
Algorithms for the Ring Star Problem. COCOA (2) 2017: 3-16
Informal and Other Publications
- 2024
- [i10]Zining Qin, Chenhao Wang, Huiling Qin, Weijia Jia:
Brainstorming Brings Power to Large Language Models of Knowledge Reasoning. CoRR abs/2406.06561 (2024) - [i9]Hau Chan, Jianan Lin, Chenhao Wang, Yanxi Xie:
Mechanism Design for Extending the Accessibility of Facilities. CoRR abs/2409.08993 (2024) - 2022
- [i8]Bo Li, Lijun Li, Ankang Sun, Chenhao Wang, Yingfan Wang:
Approximate Group Fairness for Clustering. CoRR abs/2203.17146 (2022) - 2021
- [i7]Haris Aziz, Hau Chan, Ágnes Cseh, Bo Li, Fahimeh Ramezani, Chenhao Wang:
Multi-Robot Task Allocation - Complexity and Approximation. CoRR abs/2103.12370 (2021) - [i6]Zhongzheng Tang, Chenhao Wang, Hau Chan:
On maximizing a monotone k-submodular function under a knapsack constraint. CoRR abs/2105.15159 (2021) - [i5]Hau Chan, Aris Filos-Ratsikas, Bo Li, Minming Li, Chenhao Wang:
Mechanism Design for Facility Location Problems: A Survey. CoRR abs/2106.03457 (2021) - [i4]Hau Chan, Minming Li, Chenhao Wang:
Facility Location Games with Ordinal Preferences. CoRR abs/2107.01649 (2021) - 2020
- [i3]Zhongzheng Tang, Chenhao Wang, Mengqi Zhang:
Price of Fairness in Budget Division for Egalitarian Social Welfare. CoRR abs/2010.09637 (2020) - [i2]Zhongzheng Tang, Chenhao Wang, Mengqi Zhang, Yingchao Zhao:
Mechanism Design for Facility Location Games with Candidate Locations. CoRR abs/2010.09640 (2020) - 2019
- [i1]Xujin Chen, Minming Li, Chenhao Wang:
Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces. CoRR abs/1911.12109 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
