Proceedings of the Annual Conference of JSAI
Online ISSN : 2758-7347
33rd (2019)
Session ID : 2E1-J-1-03
Conference information

Mechanism Design for Facility Location via SAT Solving
*Nodoka OKADAYuho WADATaiki TODOMakoto YOKOO
Author information
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Abstract

We consider the problem of locating one facility on discrete grids with variable populations. An agent's preference is single-peaked or single-dipped, depending on whether she wants to access the facility (a public good), or be far from it (a public bad). In this paper, we clarify whether or not there exists a mechanism which satisfies both false-name-proofness and Pareto efficiency on a discrete grid by using SAT solver. Concretely, we reveal the existense about the appropreate mechanism on a grid which size is less than 3×3, further the impossibility besides those grids. Moreover, we also clarify the impossibility about ontoness on grids which size is over 2×3.

Content from these authors
© 2019 The Japanese Society for Artificial Intelligence
Previous article Next article
feedback
Top