相关论文: Manipulation-resistant facility location mechanism…

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…

A locating-dominating set is a subset of vertices representing "detectors" in a graph G; each detector monitors its closed neighborhood and can distinguish its own location from its neighbors, and given all sensor input, the system can…

Facility location problems are captivating both from theoretical and practical point of view. In this paper, we study some fundamental facility location problems from the space-efficient perspective. Here the input is considered to be given…

Location privacy-preserving mechanisms (LPPMs) have been extensively studied for protecting a user's location at each time point or a sequence of locations with different timestamps (i.e., a trajectory). We argue that existing LPPMs are not…

We study stable matching problems with locality of information and control. In our model, each agent is a node in a fixed network and strives to be matched to another agent. An agent has a complete preference list over all other agents it…

We study the design of graph filters to implement arbitrary linear transformations between graph signals. Graph filters can be represented by matrix polynomials of the graph-shift operator, which captures the structure of the graph and is…

We present a randomized distributed approximation algorithm for the metric uncapacitated facility location problem. The algorithm is executed on a bipartite graph in the Congest model yielding a (1.861 + epsilon) approximation factor, where…

This paper studies the problem of minimizing group-level inequity in facility location games on the real line, where agents belong to different groups and may act strategically. We explore a fairness-oriented objective that minimizes the…

We study the design of one-to-one matching mechanisms that are strategy-proof for both sides and as stable as possible. Motivated by the impossibility result of Roth (1982), we formulate the mechanism design problem as a linear program that…

In this paper, we study the Facility Location Problem with Scarce Resources (FLPSR) under the assumption that agents' type follow a probability distribution. In the FLPSR, the objective is to identify the optimal locations for one or more…

The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their…

We consider a two-sided matching problem in which the agents on one side have dichotomous preferences and the other side representing institutions has strict preferences (priorities). It captures several important applications in matching…

We study mechanisms for candidate selection that seek to minimize the social cost, where voters and candidates are associated with points in some underlying metric space. The social cost of a candidate is the sum of its distances to each…

We consider a facility location problem, where the objective is to ``disperse'' a number of facilities, i.e., select a given number k of locations from a discrete set of n candidates, such that the average distance between selected…

We study a robust version of the maximum capture facility location problem in a competitive market, assuming that each customer chooses among all available facilities according to a random utility maximization (RUM) model. We employ the…

We study the classical Art Gallery Problem first proposed by Klee in 1973 from a mobile multi-agents perspective. Specifically, we require an optimally small number of agents (also called guards) to navigate and position themselves in the…

We consider facility location problems with a new form of equity criterion. Demand points have preference order on the sites where the plants can be located. The goal is to find the location of the facilities minimizing the envy felt by the…

Indoor localization is a fundamental problem in location-based applications. Current approaches to this problem typically rely on Radio Frequency technology, which requires not only supporting infrastructures but human efforts to measure…

The trapping problem on graph (or network) as a typical focus of great interest has attracted more attention from various science fields, including applied mathematics and theoretical computer science, in the past. Here, we first study this…

In this paper a protection placement problem for power network measurement system data integrity is considered. The placement problem is motivated from the data secure power network design applications in [Dan and Sandberg 2010]. The…