Skip to main content

12 Result(s)

within Chapter Remove this filter **nhao Wang Remove this filter Discrete Mathematics in Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Approval-Based Participatory Budgeting with Donations

    Participatory budgeting (PB) is a democratic process that allows voters to directly participate in the decision-making process regarding budget spending. The process typically involves presenting voters with a...

    Shiwen Wang, Chenhao Wang, Tian Wang, Weijia Jia in Computing and Combinatorics (2024)

  2. No Access

    Chapter and Conference Paper

    Mechanism Design for Building Optimal Bridges Between Regions

    We study the bridge-building problem from the mechanism design perspective. In this problem, a social planner is tasked with building a bridge to connect two regions separated by an obstacle (e.g., a river or ...

    Zining Qin, Hau Chan, Chenhao Wang… in Theory and Applications of Models of Compu… (2024)

  3. No Access

    Chapter and Conference Paper

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

    We focus on maximizing a non-negative k-submodular function under a knapsack constraint. As a generalization of submodular functions, a k-submodular function considers k distinct, non-overlap** subsets instead ...

    Zhongzheng Tang, **gwen Chen, Chenhao Wang in Frontiers of Algorithmics (2023)

  4. No Access

    Chapter and Conference Paper

    Obnoxious Facility Location Games with Candidate Locations

    We study obnoxious facility location games with facility candidate locations. For obnoxious single facility location games under social utility objective, we present a group strategy-proof mechanism with appro...

    Ling Gai, Mengpei Liang, Chenhao Wang in Algorithmic Aspects in Information and Management (2022)

  5. No Access

    Chapter and Conference Paper

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

    This paper studies the problem of maximizing a non-negative monotone k-submodular function. A k-submodular function is a generalization of a submodular function, where the input consists of k disjoint subsets, in...

    **gwen Chen, Zhongzheng Tang, Chenhao Wang in Algorithmic Aspects in Information and Man… (2022)

  6. No Access

    Chapter and Conference Paper

    Pool Block Withholding Attack with Rational Miners

    We revisit pool block withholding (PBW) attack in this work, while taking miners’ rationality into consideration. It has been shown that a malicious mining pool in Bitcoin may attack other pools by sending som...

    Ni Yang, Chenhao Wang, Bo Li in Frontiers of Algorithmics (2022)

  7. No Access

    Chapter and Conference Paper

    Facility Location Games with Ordinal Preferences

    We consider a new setting of facility location games with ordinal preferences. In such a setting, we have a set of agents and a set of facilities. Each agent is located on a line and has an ordinal preference ...

    Hau Chan, Minming Li, Chenhao Wang, Yingchao Zhao in Computing and Combinatorics (2022)

  8. No Access

    Chapter and Conference Paper

    Cake Cutting with Single-Peaked Valuations

    In the cake cutting problem, one allocates a heterogeneous divisible resource (cake) to n participating agents. The central criteria of an allocation to satisfy and optimize is envy-freeness and efficiency. In th...

    Chenhao Wang, **aoying Wu in Combinatorial Optimization and Applications (2019)

  9. No Access

    Chapter and Conference Paper

    Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance

    This paper is devoted to the two-opposite-facility location games with a penalty whose amount depends on the distance between the two facilities to be opened by an authority. The two facilities are “opposite” ...

    Xu** Chen, **aodong Hu, **aohua Jia, Minming Li… in Algorithmic Game Theory (2018)

  10. No Access

    Chapter and Conference Paper

    The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty

    We study an atomic routing game in a network with interval uncertainty, where the cost of each edge is load-dependent, and can be any value in a given interval whose lower and upper limits are expressed as fun...

    Xu** Chen, **aodong Hu, Chenhao Wang in Algorithmic Game Theory (2018)

  11. No Access

    Chapter and Conference Paper

    Algorithms for the Ring Star Problem

    We address the Ring Star Problem (RSP) on a complete graph \(G=(V,E)\) ...

    Xu** Chen, **aodong Hu, Zhongzheng Tang… in Combinatorial Optimization and Applications (2017)

  12. No Access

    Chapter and Conference Paper

    Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem

    Bidimensionality theory provides a general framework for develo** subexponential fixed parameter algorithms for NP-hard problems. In this framework, to solve an optimization problem in a graph G, the branchwidt...

    Chunhao Wang, Qian-** Gu in Algorithms and Computation (2011)