IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i2d10.1007_s10878-025-01258-7.html
   My bibliography  Save this article

Agent-constrained truthful facility location games

Author

Listed:
  • Argyrios Deligkas

    (Royal Holloway University of London)

  • Mohammad Lotfi

    (Sharif University of Technology)

  • Alexandros A. Voudouris

    (University of Essex)

Abstract

We consider a truthful facility location game in which there is a set of agents with private locations on the line of real numbers, and the goal is to place a number of facilities at different locations chosen from the set of those reported by the agents. Given a feasible solution, each agent suffers an individual cost that is either its total distance to all facilities (sum-variant) or its distance to the farthest facility (max-variant). For both variants, we show tight bounds on the approximation ratio of strategyproof mechanisms in terms of the social cost, the total individual cost of the agents.

Suggested Citation

  • Argyrios Deligkas & Mohammad Lotfi & Alexandros A. Voudouris, 2025. "Agent-constrained truthful facility location games," Journal of Combinatorial Optimization, Springer, vol. 49(2), pages 1-24, March.
    • Handle: RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-025-01258-7
    DOI: 10.1007/s10878-025-01258-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01258-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01258-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Qi Zhao & Wenjing Liu & Qingqin Nong & Qizhi Fang, 2023. "Constrained heterogeneous facility location games with max-variant cost," Journal of Combinatorial Optimization, Springer, vol. 45(3), pages 1-20, April.
    2. Deligkas, Argyrios & Filos-Ratsikas, Aris & Voudouris, Alexandros A., 2023. "Heterogeneous facility location with limited resources," Games and Economic Behavior, Elsevier, vol. 139(C), pages 200-215.
    3. Gai, Ling & Liang, Mengpei & Wang, Chenhao, 2024. "Two-facility-location games with mixed types of agents," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gai, Ling & Liang, Mengpei & Wang, Chenhao, 2024. "Two-facility-location games with mixed types of agents," Applied Mathematics and Computation, Elsevier, vol. 466(C).
    2. Sina Abbasi & Maryam Moosivand & Ilias Vlachos & Mohammad Talooni, 2023. "Designing the Location–Routing Problem for a Cold Supply Chain Considering the COVID-19 Disaster," Sustainability, MDPI, vol. 15(21), pages 1-24, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:49:y:2025:i:2:d:10.1007_s10878-025-01258-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.