Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Facility Location Games with Group Externalities

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13595))

Included in the following conference series:

  • 932 Accesses

Abstract

We develop a formal model of facility location games with group externalities in one dimension: there is a set of agents on an interval [0, L], a facility will be built to serve both the individual activities and the group activities. Some agents are interested in individual activities, while others like group activities. The goal is to design a mechanism that is non-manipulable and respects unanimity while (approximately) optimizing an objective function. We consider two social objectives, the social utility and the minimum utility. We prove that some previous mechanisms cannot handle this scenario. For each objective, we discuss about different ways of manipulation, and show both upper bounds and lower bounds of approximation ratios for deterministic truthful mechanisms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Anastasiadis, E., Deligkas, A.: Heterogeneous facility location games. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 623–631 (2018)

    Google Scholar 

  2. Chan, H., Ratsikas, A.F., Li, B., Li, M., Wang, C.: Mechanism design for facility location problem: a survey. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Survey Track (2021)

    Google Scholar 

  3. Cheng, Y., Yu, W., Zhang, G.: Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor. Comput. Sci. 497, 154–163 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Feigenbaum, I., Sethuraman, J.: Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location models. In: Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)

    Google Scholar 

  5. Fong, C.K.K., Li, M., Lu, P., Todo, T., Yokoo, M.: Facility location games with fractional preferences. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)

    Google Scholar 

  6. Li, M., Mei, L., Xu, Y., Zhang, G., Zhao, Y.: Facility location games with externalities. In: Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems, pp. 1443–1451 (2019)

    Google Scholar 

  7. Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 315–324 (2010)

    Google Scholar 

  8. Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437–455 (1980). https://doi.org/10.1007/BF00128122

    Article  Google Scholar 

  9. Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 177–186 (2009)

    Google Scholar 

  10. Serafino, P., Ventre, C.: Heterogeneous facility location without money on the line. In: ECAI 2014, pp. 807–812. IOS Press (2014)

    Google Scholar 

  11. Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: Twenty-Ninth AAAI Conference on Artificial Intelligence (2015)

    Google Scholar 

  12. Wikipedia contributors: Group buying – Wikipedia, the free encyclopedia (2022). https://en.wikipedia.org/w/index.php?title=Group_buying &oldid=1088713942. Accessed 29 June 2022

  13. Zhou, H., Li, M., Chan, H.: Strategyproof mechanisms for group-fair facility location problems. In: Raedt, L.D. (ed.) Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23–29 July 2022, pp. 613–619. ijcai.org (2022)

    Google Scholar 

  14. Zou, S., Li, M.: Facility location games with dual preference. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp. 615–623 (2015)

    Google Scholar 

Download references

Acknowledgements

The work described in this paper was supported by a grant from Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. CityU 11200518). We would like to thank the anonymous reviewers for their very useful feedback.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Houyu Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, H. (2022). Facility Location Games with Group Externalities. In: Zhang, Y., Miao, D., Möhring, R. (eds) Computing and Combinatorics. COCOON 2022. Lecture Notes in Computer Science, vol 13595. Springer, Cham. https://doi.org/10.1007/978-3-031-22105-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22105-7_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22104-0

  • Online ISBN: 978-3-031-22105-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics