5,128 research outputs found

    Facility Location Games with Ordinal Preferences

    Get PDF
    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 over the facilities. Our goal is to design strategyproof mechanisms that elicit truthful information (preferences and/or locations) from the agents and locate the facilities to minimize both maximum and total cost objectives as well as to maximize both minimum and total utility objectives. For the four possible objectives, we consider the 2-facility settings in which only preferences are private, or locations are private. For each possible combination of the objectives and settings, we provide lower and upper bounds on the approximation ratios of strategyproof mechanisms, which are asymptotically tight up to a constant. Finally, we discuss the generalization of our results beyond two facilities and when the agents can misreport both locations and preferences

    Mechanism Design for Facility Location Problems: A Survey

    Get PDF
    The study of approximate mechanism design for facility location problems has been in the center of research at the intersection of artificial intelligence and economics for the last decades, largely due to its practical importance in various domains, such as social planning and clustering. At a high level, the goal is to design mechanisms to select a set of locations on which to build a set of facilities, aiming to optimize some social objective and ensure desirable properties based on the preferences of strategic agents, who might have incentives to misreport their private information such as their locations. This paper presents a comprehensive survey of the significant progress that has been made since the introduction of the problem, highlighting the different variants and methodologies, as well as the most interesting directions for future research

    Non-Cooperative Facility Location Games: a Survey

    Get PDF
    The Facility Location problem is a well-know NP-Hard combinatorial optimization problem. It models a diverse set of situations where one aims to provide a set of goods or services via a set of facilities F to a set of clients T, also called terminals. There are opening costs for each facility in F and connection costs for each pair of facility and client, if such facility attends this client. A central authority wants to determine the solution with minimum cost, considering both opening and connection costs, in such a way that all clients are attended by one facility. In this survey we are interested in the non-cooperative game version of this problem, where instead of having a central authority, each client is a player and decides where to con- nect himself. In doing so, he aims to minimize his own costs, given by the connection costs and opening costs of the facility, which may be shared among clients using the same facility. This problem has several applications as well, specially in distributed scenarios where a central authority is too expensive or even infeasible to exist. In this paper we present a survey describing different variants of this problem and reviewing several results about it, as well as adapting results from existing literature concerning the existence of equilibria, Price of Anarchy and Price of Stability. We also point out open problems that remain to be addressed.

    The Strategy-Proof Provision of Public Goods under Congestion and Crowding Preferences

    Get PDF
    We examine the strategy-proof provision of excludable public goods when agents care not only about the level of provision of a public good, but also the number of consumers. We show that on such domains strategy- proof and efficient social choice functions satisfying an outsider independence condition must be rigid in that they must always assign a fixed number of consumers, regardless of individual desires to participate. The fixed number depends on the attitudes of agents regarding group size - being small when congestion effects dominate (individuals prefer to have fewer other consumers) and large when cost sharing effects dominate (agents prefer to have more consumers). A hierarchical rule selects which consumers participate and a variation of a generalized median rule to selects the level of the public good. Under heterogeneity in agents' views on the optimal number of consumers, strategy-proof, efficient, and outsider independent social choice functions are much more limited and in an important case must be dictatorial.Public Goods, Congestion, Club Goods, Strategy-Proof
    • …
    corecore