Chenhao Wang

Appl. Math. Comput., April, 2024

Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization.

[BibT_eX]

[DOI]

Jingwen Chen

Theor. Comput. Sci., February, 2024

2023

Facility location games with ordinal preferences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

Discrete facility location games with different preferences.

[BibT_eX]

[DOI]

Ling Gai

Mengpei Liang

J. Comb. Optim., September, 2023

An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization.

[BibT_eX]

[DOI]

Jingwen Chen

Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

Improved Analysis of Greedy Algorithm on k-Submodular Knapsack.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Approval-Based Participatory Budgeting with Donations.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

Mechanism Design for Improving Accessibility to Public Facilities.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022

Monotone k-submodular secretary problems: Cardinality and knapsack constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Mechanisms for dual-role-facility location games: Truthfulness and approximability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

On maximizing a monotone k-submodular function under a knapsack constraint.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

A note on the online interval scheduling secretary problem.

[BibT_eX]

[DOI]

Bo Li

Ruilong Zhang

Oper. Res. Lett., 2022

Discrete load balancing on complete bipartite graphs.

[BibT_eX]

[DOI]

Xiaomin Huang

Inf. Process. Lett., 2022

Budget feasible mechanisms for facility location games with strategic facilities.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2022

Facility Location Games with Ordinal Preferences.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Obnoxious Facility Location Games with Candidate Locations.

[BibT_eX]

[DOI]

Ling Gai

Mengpei Liang

Proceedings of the Algorithmic Aspects in Information and Management, 2022

Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm.

[BibT_eX]

[DOI]

Jingwen Chen

Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021

Algorithms for the metric ring star problem with fixed edge-cost ratio.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Facility Location Games with Ordinal Preferences.

[BibT_eX]

[DOI]

CoRR, 2021

On maximizing a monotone k-submodular function under a knapsack constraint.

[BibT_eX]

[DOI]

CoRR, 2021

Game-theoretic Analysis of Effort Allocation of Contributors to Public Projects.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Mechanism Design for Facility Location Problems: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Approximate Group Fairness for Clustering.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Pool Block Withholding Attack with Rational Miners.

[BibT_eX]

[DOI]

Ni Yang

Bo Li

Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021

Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Fairness and Efficiency in Facility Location Problems with Continuous Demands.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Multi-Robot Task Allocation-Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Facility's Perspective to Fair Facility Location Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Budgeted Facility Location Games with Strategic Facilities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Mechanism Design for Facility Location Games with Candidate Locations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

Price of Fairness in Budget Division for Egalitarian Social Welfare.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space.

[BibT_eX]

[DOI]

Xujin Chen

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces.

[BibT_eX]

[DOI]

Xujin Chen

CoRR, 2019

Cake Cutting with Single-Peaked Valuations.

[BibT_eX]

[DOI]

Xiaoying Wu

Proceedings of the Combinatorial Optimization and Applications, 2019

Truthful Mechanisms for Location Games of Dual-Role Facilities.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty.

[BibT_eX]

[DOI]

Xujin Chen

Xiaodong Hu