1 Introduction
In this paper, we study the facility location problem with capacity constraints (FLPCC) from the algorithmic and mechanism design perspectives. In this version of the facility location problem, we have a set of agents and a set of facilities, where each agent is located somewhere on a line, and each facility has a capacity limiting the number of agents it can serve. From the algorithmic perspective, the locations of the agents are publicly known, and we are interested in the question of how to best locate the facilities to minimize the total travel distance/cost or the maximum cost of the agents to the located facilities. On the other hand, in our mechanism design setting, the locations of the agents are privately known to the agents themselves, and our goal is to design mechanisms that elicit the true locations of the agents and locate the facilities to minimize the total or maximum cost of the agents subject to the agents’ reported locations.
Our FLPCC models many realworld problems. The problems include locating schools, hospitals, warehouses, and libraries, all of which actually face capacity constraints. In the onedimensional setting, our models could be used to describe the setting of locating wastewater plants along a river or distribution centres along a highway. There are also various nongeographical settings that can be viewed as onedimensional facility location problems (e.g. choosing the temperature for a classroom, or selecting a committee to represent people with different political views). In addition, there are settings where we can use the onedimensional problem to solve more complex problems (e.g. decomposing the 2d rectilinear problem into a pair of 1d problems). The onedimensional problem is also the starting point to consider more complex metrics (e.g., trees and networks).
In FLPCC, we have agents located on the real line, and we need to locate facilities on the line to serve all the agents^{1}^{1}1Our problem naturally generalizes to higher dimensions as well as to nonEuclidean distance metrics.. The th facility can serve up to agents. We assume that so that every agent can be served. Each agent is at location , and we suppose that the agents are ordered so that . Given an agent , let denote the facility that agent is assigned and let denote the set of agents assigned to facility , i.e., . A solution is a location for each facility , and an assignment of agents to facilities such that the capacity constraint of each facility is not exceeded, i.e., for all . Accordingly, a solution is denoted by . We consider a utilitarian measure: the total cost, ; and an egalitarian measure: the maximum cost, . Our goal is to locate facilities on the line and assign agents to these facilities to minimize the total or maximum cost.
Contribution. Our main contributions are as follows. Firstly, for FLPCC, we provide algorithmic results identifying the complexity of the corresponding optimization problem (NPhard) but also provide tractability results, via dynamic programs (DPs), for various restricted settings. Secondly, we explore the mechanism design challenges introduced by this new setting. We show that many mechanisms which are considered desirable in uncapitated FLPs become undesirable (with respect to strategyproofness and/or approximation ratio bounds) in FLPCC. We introduce the innerpoint mechanism which performs relatively well in special cases, and characterize this mechanism as the only such strategyproof mechanism within a larger class of mechanisms, which we call rank mechanisms. Finally, we introduce a new strategyproof mechanism, extended endpoint mechanism (EEM), which achieves approximation guarantees that almost match the lower bounds. We summarize our contributions in Table 1.
Algorithmic Results  Total Cost  Max. Cost 
NPhard  Exact  Exact 
DP  Exact  Exact 
SP Mechanisms  Total Cost  Max. Cost 
Median  Unbounded  Unbounded 
Endpoint  Unbounded  Unbounded 
Innerpoint  2  
EMM  4 
SP = Strategyproof, *two facilities, when ,
when
We leave open the question of upper bounds for three facilities which has remained open since the seminal work [Procaccia and Tennenholtz2009, Procaccia and Tennenholtz2013], even when all facilities have infinite capacities.
1.1 Background
Algorithmic Perspective. The classic FLP with a single uncapacitated facility can be solved optimally in polynomial time when the objective is to minimize the total or maximum cost (e.g., Procaccia and Tennenholtz ptacmtec2013). Similarly, when extending to the setting with multiple uncapacitated facilities, the optimization problem remains tractable admitting a polynomial time solution for either objective function [Megiddo et al.1981, Megiddo, Zemel, and Hakimi1983]. If there are multiple facilities with identical capacity constraints, the problem is tractable if the objective is to minimize the total cost but becomes intractable (NPhard) for more general objective functions [Brimberg et al.2001]. Complementing these results, we show in the present paper that for our setting, i.e., the multiple capacitated FLP with nonidentical capacity constraints, that minimizing either objective function is NPhard. The intractability result in Brimberg et al. BKEM01 does not imply intractability in our setting for our objective functions. Moreover, we provide an alternate dynamic program to minimize the total cost for the identical capacity constraint setting studied by Brimberg et al. BKEM01. Finally, we note that our setting is different from the “capacitated facility location problem” (see e.g., [Pal, Tardos, and Wexler2001, Levi, Shmoys, and Swamy2012, Aardal et al.2015]) where the set of potential facility locations is countable and bounded while, in ours, the set of facility locations is infinite (i.e., the real line). Thus, we cannot use previous results in the literature directly.
Mechanism Design Perspective. The classic FLP focuses on the setting where a single facility with unlimited capacity, i.e., an uncapacitated facility, must be located along a line with the goal of satisfying certain properties (most importantly strategyproofness) and/or optimizing some objective function. This setting escapes the famous impossibility result of GibbardSatterhwaite gs1,gs2 and inherits many wellknown characterization results from social choice, such as those from Moulin moulin1980.
Two extensions of the classic FLP have attracted attention in the literature: multiple but uncapacitated facilities (see e.g., Miyagawa miyagawa2001, Heo heo2013, Fotakis and Tzamos ft2013, and Golowich, Narasimhan, and Parkes gnpijcai18), and, to a lesser extent, a single capacitated facility. Considering the mechanism design problem for facilities with capacity constraints has only recently been considered by Aziz, Chan, Lee, and Parkes aclp18 for a single facility. In their setting, additional strategic complications arise since some agents will not be served. The set of agents served by the facility is determined via an equilibrium outcome arising from the induced subgame.^{2}^{2}2They show an impossibility result that ‘reasonable’ mechanisms which dictate the agents served can never be strategyproof. We do not have such an issue since all our agents can be serviced. Another closely related work is by Procaccia and Tennenholtz ptacmtec2013 which considers the problem of designing strategyproof mechanisms with approximation guarantees on an objective function (such as total cost and egalitarian welfare) for one or two facilities without capacity constraints. The works of [Fotakis and Tzamos2013, Lu et al.2010] prove that any deterministic strategyproof mechanism has an approximation ratio of for the total cost. Our EEM mechanism has approximation guarantees that almost match the lower bound of the uncapacitated setting.
2 An Algorithmic Perspective
We first show that it is intractable to find a solution that minimizes either the total or maximum cost. This result complements the result in Brimberg et al. [Theorem 2]BKEM01 where intractability is proven for facilities with identical capacity constraints and a total cost objective function that can be nonmonotonic in the distance between agents and facilities.
Theorem 1.
Computing a solution that minimizes the total or maximum cost is NPhard even when there is no spare capacity in the FLPCC.
Proof.
We show that the problem is NPhard by reducing from the 3partition problem, which is known to be strongly NPhard [Garey and Johnson1979]. In a 3partition problem, we are given a multiset of positive integers of size , and we want to know if can be partitioned into subsets , each of size three, such that the sum of the numbers in each subset is the same. Let . In particular, we consider the 3partition instances in which and integers are polynomially bounded in and for all such that is a positive integer and the integers are at least 1. Take such instance of 3partition, we reduce it to the decision version of FLPCC where we want to place the facilities to achieve the total cost and maximum cost of 0. We let to be the number of facilities, and, for each facility , , set capacity . With a slight abuse of notation, we let to be the number of agents such that there are groups of agents which are equally spaced apart and the agents in the same group are located at a single location.
Suppose that the instance of the 3partition problems has a solution. It follows that there are such that each sum up to . For each group of agents, we place three facilities of capacities at the location of group . Clearly, we achieve the total cost or maximum cost of 0.
Suppose that we have a solution to the constructed problem. We have a location for each facility such that the total cost or maximum cost is 0. In fact, this is the best cost we can obtain where the agents do not have to travel at all. Moreover, each facility must be located on the location of one of the groups and all of the agents within each group can use one of the facilities at its location. Since the capacity of facility is , each location of the group has at least three facilities. Also since the total number of facilities is and there are groups, the number of facilities at each group is exactly 3. Finally, the sum of the capacities of the three facilities is . Thus, for each group , we can construct by take elements with the same values as capacities of the facilities located at group .
To conclude, the problem instance above is of polynomial size bounded by and we obtain our claimed result. ∎
We observe that the computational complexity of finding an optimal solution does not come from having to decide where to distribute any spare capacity. The reduction uses a FLPCC instance where the facilities have a total capacity exactly equal to the number of agents to be served. The computational complexity comes from having to find the best of the possible left to right orderings of these facilities.
As we show next, to minimize the maximum cost (total cost), we locate each facility in the midpoint (median) of the continuous region of agents it serves. Thus, for a fixed number of facilities or facilities of identical capacity, we can use dynamic programming to compute the optimal (total or maximum cost) solution in polynomial time.
Order the set of agents such that . We say that a set of agents is continuous if for some .
Lemma 1.
For either objective function (total cost or maximum cost), there exists an optimal solution such that each is continuous.
Proof.
Suppose that the solution provides minimal total cost but is such that there exists for which is not continuous. That is, the exists some pair of agents such that (1) , and , or (2) , and . Both cases are dealt with similarly and so we assume the first case.
Let . For any location of , if , then swapping from and from leads to strictly lower total cost. On the other hand, if , then swapping from and from leads to no change in total cost. Repeating this method until each set is continuous leads to a solution with at least as low total cost. Since the original solution was optimal, we conclude that there exists an optimal solution with each continuous.
Now consider the maximum cost objective. A similar argument applies. The only difference is that in the case where we can only guarantee weakly lower maximum cost. Nonetheless, the same conclusion is reached — there exists an optimal maximum cost solution such that each is continuous. ∎
The above lemma shows that partitions, or sets , must be continuous but it does not require that facilities be located ‘inside’ such a partition. However, it is wellknown that the median of a set of points minimizes the sum of absolute deviations and the midpoint minimizes the maximum deviation. This leads to the following corollary.
Corollary 1.
An optimal solution is given by by continuous partitions of the agents which correspond to facilities such that each facility locates at the median and midpoint of its associated partition for total cost and maximum cost, respectively.
The above results show that to solve FLPCC for total and maximum costs, it suffices to look for continuous sets which match the capacity of each facility and locate the facility at the median or midpoint of each set.
2.1 Bounded Number of Facilities
Total Cost.
We compute the optimal way (for minimizing the total cost) of locating facilities and partition agents into parts using dynamic program. We will use to denote the set of agents for any . We use to represent the optimal total cost when agents are partitioned into parts, and are in the th partition, and is the subset of facilities used to serve agents . We will make use of a array , whose entries are initially set to empty. We will use to store . We use to denote the optimal total cost when agents are served by facility (with capacity ). In order to compute we can simply try to locate at each of the agent locations and serve nearest agents.^{3}^{3}3The optimal point will be the median of those subset of agents who are actually served.
We invoke (Algorithm 1) to compute the optimal total cost and recover the solution from the values stored in .
Theorem 2.
Algorithm 1 computes the optimal total cost solution in time. Hence, it is fixed parameter tractable in .
Proof.
It is easy to see that the running time of Algorithm 1 is . We argue for the proof of correctness. The base case is clear. The total cost is zero if there are no agents or no facilities. Suppose we want to compute and we have already computed values for where or or or . We distinguish between two cases depending on whether is covered by the last facility in .
In the first case, is equivalent to . In the second case we know that is not served by the last facility in but is. Hence, if is served by facility , then is equivalent to . ∎
Maximum Cost.
In a similar way, we use to represent the optimal maximum cost when agents are partitioned into parts, and are in the th partition, and is the subset of facilities. We use to denote optimal maximum cost when agents are partitioned into parts, and and are in the th partition, and is the subset of facilities. We will make use of a array , whose entries are initially set to empty. We will use to store . We use to denote the optimal maximum cost when agents are covered by (with capacity ). We invoke to compute the optimal maximum cost and recover the solution from the values stored in . The subroutine to solve OPT is summarized as Algorithm 2.
Theorem 3.
Algorithm 2 computes the optimal total cost solution in time. Hence, it is fixed parameter tractable in .
Identical capacities
When facilities have the same capacity, we can use a different dynamic program to compute an optimal solution with minimum total cost. We exploit the property that an optimal solution consists of continuous regions served by a facility located at the median agent of the region. We construct an array which is the optimal total cost supposing the leftmost agents are served by the first facilities. Let be the capacity of the facilities. We initialize with . In the first round, we set for in to with the optimal total cost for the first agents served by a single facility. In the th round, for each from to and from 1 to we update with the minimum of and plus the total cost of serving the th to the th agents from left by the th facility. In the final round, the optimal total cost will be computed at . The runtime to update each of the entries is giving a total cost of . Note that we can suppose otherwise the optimal solution will have zero total cost. Similarly, we can suppose . Hence, the total cost is polynomial in . We can construct a similar dynamic program to compute the optimal maximum cost, exploiting the fact that an optimal solution consists in this case of continuous regions served by a facility located at the midpoint between the leftmost and rightmost agents served by the facility. The total run time, in this case, is . These results complement those in Brimberg et al. BKEM01 where an alternate dynamic program with run time is provided for minimizing the total cost when facilities have identical capacities.
Theorem 4.
There exists an time algorithm to compute the optimal total cost and an time algorithm to compute the optimal maximum cost with agents when all facilities have the same capacity .
3 A Mechanism Design Perspective
In our mechanism design setting, each agent ’s position is her private information and a mechanism operates on the reported locations of all agents, which may be different from their actual locations. Based on the reported locations, the mechanism locates facilities, , and allocates disjoint sets of agents to each facility while respecting the capacity constraints (i.e., assign for each agent where for each facility ). The total and maximum costs of a mechanism are defined in the same way. Accordingly, every agent ’s cost is and they prefer mechanism outcomes that allocate them to a facility closer to their true location . A mechanism is said to be strategyproof if for every agent and for any profile of other agent reports, agent weakly prefers the mechanism outcome achieved by reporting her true location to the outcome achieved by any other report . Our goal in this section is to find strategyproof mechanisms.
When and , locating the facility at the median location is strategyproof and optimal for minimizing the total cost. As a result, we focus on the case of two facilities. When and , Procaccia and Tennenholtz ptacmtec2013 first argue that no deterministic strategyproof mechanism is guaranteed to return the optimal solution for either the total or the maximum cost.
In general, if we set the capacities of the locations high enough, we can inherit the lower bounds results from existing lower bound results. Particularly, [Lu et al.2010] proved that any deterministic strategyproof mechanism has an approximation ratio for the total cost of at least , which is further improved to be by [Fotakis and Tzamos2013]. Procaccia and Tennenholtz ptacmtec2013 proved that any deterministic strategyproof mechanism has an approximation ratio for the maximum cost of at least . An approximation ratio of (w.r.t. some objective function to be minimized) implies that, across all instances of agent locations, the mechanism outcome evaluated according to the objective function is no more than a factor of larger than the optimal outcome.
3.1 Limitations of Existing Approaches
The first contender is the median mechanism which has been studied for the case of one facility with unlimited capacity. We can extend this mechanism to two or even more facilities with capacity constraints as follows: locate all facilities at the median agent. The mechanism remains strategyproof. However, we can no longer bound the approximation ratio for either the total or maximum cost. Suppose, for instance, most of the facilities are concentrated at the end points in the optimal solution. We next explore the idea of placing facilities at the endpoints with the endpoint mechanism which locates the facilities at the reported endpoints [Procaccia and Tennenholtz2009]. With two uncapacitated facilities, the endpoint mechanism has several nice properties. It is, for instance, strategyproof and returns a 2approximation of the maximum cost, which is proved to be optimal by [Procaccia and Tennenholtz2009]. Unfortunately, it is not hard to verify that, when we add (even uniform) capacities, the endpoint mechanism is not strategyproof (i.e., agents can strategically exploit capacity limits to ensure a more favourable outcome). The main difficulty here is how to allocate the agents to the facilities.
3.2 Mechanisms for Two Facilities with Equal Capacity for Total and Maximum Costs
We now present another mechanism for two capacitated facilities. Suppose we have two facilities of capacities and where . If we order agents from left to right, the innerpoint mechanism places one facility at the th agent from left, serving the leftmost agents, and the other facility at the th agent from the left, serving the rightmost agents. If , we suppose as before that the order of facilities is fixed in advance of the agents reporting.
Theorem 5.
When is even and 2 facilities have equal capacity , the innerpoint mechanism is strategyproof and has a bounded approximation ratio of 2 for maximum cost and a ratio of for total cost.
Proof.
To show strategyproofness, we consider three cases. In the first, consider one of the leftmost agents. The only way they can change the outcome is if they report a location to the right of the th agent. But this will give them a worst outcome. In the second case, consider the th agent from the left. They have zero cost. Reporting any other location leaves this the same or worse. In the third case, consider one of the rightmost agents. This case is analogous to the first two cases. In all cases, misreporting is not beneficial.
To determine the approximation ratio for the maximum cost, we rescale the problem so leftmost agent is at 0, and rightmost agent at 1. This does not affect the approximation ratio. By assumption, the two facilities have equal capacity . Suppose the th agent from left is at , and the th agent is at . The maximum cost is then . An optimal location of facilities would put one facility at , and the other at . This has a maximum cost half as much of . Hence, the approximation ratio is 2.
To determine the approximation ratio for the total cost, we again rescale the problem so the leftmost agent is at 0, and the rightmost agent at 1. Suppose the th agent from left is at , and the th agent is at . The worst case for the total cost has agents at 0, the th agent at , the th agent at and the remaining agents at 1. This gives a total cost of . That is, . The optimal solution, in this case, puts one facility at 0 and the other at 1, giving a total cost of . That is, . Hence, the approximation ratio for the total cost is at least (or ). ∎
Unfortunately, innerpoint no longer has a bounded approximation ratio for the total or maximum cost when facilities have spare capacity i.e., . The following theorem can be proved by constructing a suitable example.
Theorem 6.
With 4 agents, and 2 capacitated facilities of size 3 or larger, the innerpoint mechanism has an unbounded approximation ratio for the total or maximum cost.
Proof.
Suppose two agents are at 0, one at and the fourth agent at 1. The innerpoint mechanism will locate one facility at 0, serving the two leftmost agents, and the other at , serving the two rightmost agents. The total and maximum costs are both while the optimal total and maximum costs for two facilities with capacity 3 or greater are both . The approximation ratio for total or maximum costs is therefore which tends to infinity as tends to zero. ∎
Inspired by the median, endpoint and innerpoint mechanisms, we introduce a family of mechanisms that generalize all three. Given facilities and agents, we let the capacity of the th facility be and agent report location where . We suppose . The rank mechanism has parameters, to with and a permutation of to . The mechanism locates facility at . Agents are then allocated to the facilities from left to right (while also respecting each facility’s capacity constraint). If facilities have identical capacities, then we can ignore the permutation. We also note that our rank mechanism is similar to the percentile mechanisms introduced in [Sui, Boutilier, and Sandholm2013], but the later only works for uncapacitated facilities.
We now provide a simple characterization of those rank mechanisms which are strategyproof.
Theorem 7.
The rank mechanism with parameters to and is strategyproof if and only if either for any and , or there exists with and .
Proof.
(Necessity) There are two cases. In the first case, for any and . All facilities are located at the same location. An agent to the left of this can only misreport and move the location of the facilities to the right which is not in their interest. Similarly, an agent to the right can only misreport and move the location of the facilities to the left which is not in their interest. In the second case, there exists with and . We can view this as equivalent to lumping the facilities into two “super” facilities, setting , and . This is the innerpoint mechanism which we have shown previously to be strategyproof.
(Sufficiency). There are again two cases. In the first case, . We give a counterexample for strategyproofness for . For greater
, we pad the counterexample with additional facilities and agents. We give a counterexample for
and . Similar counterexamples can be constructed for other values of . We suppose facilities have capacity 2, and , , , , , . Agent 2 has an incentive to misreport their position as location 7. In the second case, and . We give a counterexample for and . Similar counterexamples can be constructed for other values of and . Suppose the two facilities have capacity 2, and , , , . Agent 2 has an incentive to misreport their location to be position 5. ∎As an example, consider the quartile mechanism
that places one facility at the first quartile, and the second at the third quartile. It follows immediately from the last theorem that the quartile mechanism is not strategyproof.
We now provide a simple necessary condition for the rank mechanism to have bounded approximation ratio.
Theorem 8.
With 2 (or more) facilities with capacity constraints, if the rank mechanism has bounded approximation ratio for the total and maximum cost it must be that and (recall that ), where is the capacity of facility .
Proof.
Consider an instance where agents located at 0 and the remaining agents are located at . The optimal total and maximum costs are zero. If either or holds, since for all , all facilities will be located at the same location (either or ). This necessarily gives nonzero total and maximum costs and hence unbounded approximation ratios. ∎
Theorem 5, Theorem 7, and Theorem 8 collectively lead to the following theorem which characterizes the innerpoint mechanism as the only strategyproof rank mechanism with bounded approximation ratio (for either total or maximum cost) when there are two facilities of equal capacities.
Theorem 9.
With 2 capacitated facilities of equal capacity, the only rank mechanism which is both strategyproof and provides a bounded approximation ratio for both the maximum and total cost is the innerpoint mechanism, i.e, and .
In summary, the mechanisms in this section are either unbounded or not strategyproof or only satisfy the desirable properties if . Next we present a new mechanism that is strategyproof and provides bounded approximations even for two capacitated facilities and the case where there may be spare capacities.
3.3 Mechanisms for Two Facilities with Arbitrary Capacities for Total and Maximum Costs
In this section, we present a more general strategyproof mechanism that almost matches the existing lower bounds of [Lu et al.2010] and [Fotakis and Tzamos2013]. Let be the location profile such that and be the capacities such that . Let and be the output locations of the two facilities.
Extended Endpoint Mechanism (EEM)
Let and . If , execute one of the following three cases.
 Case 1.

If and , and . Agents in are allocated to and the others are allocated to .
 Case 2.

If and , and . Agents are allocated to and the others are allocated to .
 Case 3.

If and , and . Agents in are allocated to and the others are allocated to .
If , switch the roles of the two facilities in above cases and execute one of them.
EEM is essentially an endpoint mechanism, but to restore strategyproofness, it locates one facility outside of . Although EEM has slightly poorer performance than the classical endpoint mechanism, with respect to the lower bound results, EEM is actually optimal up to a constant.
Theorem 10.
EEM is strategyproof.
Proof.
Without loss of generality, assume as the other case is symmetric. Note that and always hold for some .
For Case 1 where and , each agent is served by the facility located at the nearest endpoint to her, and the two endpoint agents get the best possible solution. If any agent except the two endpoint agents deviates and the resulting locations of the two facilities change, she can only be worse off as under no situation she could be served by a facility located in . Thus our mechanism is strategyproof in this case.
Next we consider Case 2 where and .

For any agent , and is served by the facility located at .
Under EEM, any deviation by agent to will continue to allocate agent to the left most facility whose location either remains unchanged at , or, if Case 1 occurs, is moved to . It is straightforward to see that neither of these cases is profitable for the agent, and so we restrict our attention to deviations . Let and be the new partitions of the EEM. If are such that Case 1 or Case 2 holds then agent is now allocated to , this is never a profitable deviation. Finally, we note that Case 3 can never occur since this would require that and which contradicts and . Thus cannot be better off by deviating.

Next, we consider agent . If she reports some location on the left of , then agent will replace the role of in the mechanism thus and is connected to . However, , thus does not profit from the misreporting their location. Note that ’s deviation cannot cause the number of agents in to be less than the number of agents in . Otherwise, , then must be at least as large as as and , Thus Case 1 must happen when tells the truth. Accordingly, if reports some location on the right of , she is still connected to (or even the right of ), no matter which case happens after the deviation. Thus never benefits from misreporting.
By a similar argument as for Case 2, EEM is strategyproof under Case 3. ∎
Theorem 11.
For the objective of total cost, EEM has an approximation ratio of .
Proof.
Again, without loss of generality, assume . We first note that the optimal solution has the following form: partition of the agents into left successive agents and right successive successive agents and locate each facility at the median point of each subset of the agents.
For Case 1, EEM is exactly the same as the classical Endpoint Mechanism [Procaccia and Tennenholtz2009], thus has an approximation of .
For Case 2, . This is because in the optimal solution, all the agents in cannot be served by a single facility as . Thus at least one of the agents in has to be grouped with . Moreover,
For Case 3, . This is because in the optimal solution cannot be served by one facility and by another facility. Thus either at least one of the agents in has to be grouped with or at least one of the agents in has to be grouped with . No matter which case happens, there is one group such that the longest distance between each pair of agents of this group is at least . Moreover,
The second inequality is because . The third inequality is because the term in the second line is maximized when as . ∎
Theorem 12.
For the objective of maximum cost, EEM has an approximation ratio of .
Proof.
For Case 1, EEM is exactly the same as the classical Endpoint Mechanism [Procaccia and Tennenholtz2009], thus has an approximation of .
For Case 2, let . We claim that . We first note that is a feasible solution with the announced cost, i.e. an optimal solution. Let be any solution. It is easy to see that to guarantee a cost that is not greater than , as agent has to be connected to one of them. Moreover, since the capacity of the leftmost facility is at most , at least one of agents has to be grouped with agent , thus the optimal solution is to put into ’s group and its serving facility is located at . We see that the cost of cannot be smaller than .
Let be the output of EEM. Then . Thus, , which is a 2approximation.
Case 3 is similar to Theorem 11. Since the optimal solution cannot serve by one facility and by another facility, either one of the agents in has to be grouped with or one of the agents in has to be grouped with . Thus . Again, since . , which is a 4approximation. ∎
4 Conclusion and Discussion
We considered the FLPCC both algorithmically and from a mechanism design perspective. See Table 1 for a summary of our results. Collectively, our results show that the addition of capacity constraints to the FLP makes it more difficult compared to the uncapacitated case to solve optimally and to design mechanisms with desirable properties (e.g., strategyproofness and bounds on the approximation ratio). There are many directions for future work. The most important question is to understand whether any meaningful upper bound can be established for the case of three locations. Moreover, can we extend results beyond one dimension to trees, networks, or twodimensional rectilinear and Euclidean metrics? Finally, it is interesting to consider if randomization can help to design more efficient and better algorithms or mechanisms for FLPCC.
Acknowledgements
Aziz is supported by a UNSW Scientia Fellowship, and Defence Science and Technology (DST) under the project “Auctioning for distributed multi vehicle planning” (DST 9190). Lee is supported by a Data61 and a UNSW Scientia PhD fellowship. Li is supported by the ERC grant number 639945 (ACCORD). Walsh is funded by the ERC under Horizon 2020 via AMPLify 670077.
References
 [Aardal et al.2015] Aardal, K.; van den Berg, P. L.; Gijswijt, D.; and Li, S. 2015. Approximation algorithms for hard capacitated kfacility location problems. European Journal of Operational Research 242(2):358–368.
 [Aziz et al.2019] Aziz, H.; Chan, H.; Lee, B. E.; and Parkes, D. C. 2019. The capacity constrained facility location problem. In Proceedings of the 15th Conference on Web and Internet Economics (WINE), To appear.
 [Brimberg et al.2001] Brimberg, J.; Korach, E.; EbenChaim, M.; and Mehrez, A. 2001. The capacitated facility location problem on the real line. International Transactions in Operations Research 8:727–738.
 [Fotakis and Tzamos2013] Fotakis, D., and Tzamos, C. 2013. On the power of deterministic mechanisms for facility location games. In Fomin, F.; Freivalds, R.; Kwiatkowska, M.; and Peleg, D., eds., Automata, Languages, and Programming, 449–460.
 [Garey and Johnson1979] Garey, M., and Johnson, D. 1979. Computers and intractability : a guide to the theory of NPcompleteness. W.H. Freeman.
 [Gibbard1973] Gibbard, A. 1973. Manipulation of voting schemes: A general result. Econometrica 41:587–601.

[Golowich, Narasimhan, and
Parkes2018]
Golowich, N.; Narasimhan, H.; and Parkes, D.
2018.
Deep learning for multifacility location mechanism design.
In
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, IJCAI18
, 261–267.  [Heo2013] Heo, E. 2013. Strategyproof rules for two public goods: double median rules. Social Choice and Welfare 41(4):895–922.
 [Levi, Shmoys, and Swamy2012] Levi, R.; Shmoys, D. B.; and Swamy, C. 2012. Lpbased approximation algorithms for capacitated facility location. Mathematical programming 131(12):365–379.
 [Lu et al.2010] Lu, P.; Sun, X.; Wang, Y.; and Zhu, Z. 2010. Asymptotically optimal strategyproof mechanisms for twofacility games. In Proceedings of the 11th ACM conference on Electronic commerce, 315–324.
 [Megiddo et al.1981] Megiddo, N.; Tamir, A.; Zemel, E.; and Chandrasekaran, R. 1981. An algorithm for the th longest path in a tree, with applications to location problems. SIAM Journal on Computing 10:328–337.
 [Megiddo, Zemel, and Hakimi1983] Megiddo, N.; Zemel, E.; and Hakimi, S. 1983. The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods 4:253–261.
 [Miyagawa2001] Miyagawa, E. 2001. Locating libraries on a street. Social Choice and Welfare 18(3):527–541.
 [Moulin1980] Moulin, H. 1980. On strategyproofness and single peakedness. Public Choice 35(4):437–455.
 [Pal, Tardos, and Wexler2001] Pal, M.; Tardos, T.; and Wexler, T. 2001. Facility location with nonuniform hard capacities. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 329–338.
 [Procaccia and Tennenholtz2009] Procaccia, A. D., and Tennenholtz, M. 2009. Approximate mechanism design without money. In Proceedings 10th ACM Conference on Electronic Commerce, 177–186.
 [Procaccia and Tennenholtz2013] Procaccia, A., and Tennenholtz, M. 2013. Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4):18:1–18:26.
 [Satterthwaite1975] Satterthwaite, M. 1975. Strategyproofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10:187–216.
 [Sui, Boutilier, and Sandholm2013] Sui, X.; Boutilier, C.; and Sandholm, T. 2013. Analysis and optimization of multidimensional percentile mechanisms. In Proceedings of the TwentyThird International Joint Conference on Artificial Intelligence, IJCAI ’13, 367–374.
Comments
There are no comments yet.