SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location

Nodoka Okada, Taiki Todo, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In the literature of mechanism design, market mechanisms have been developed by professionals based on their experience. The concept of automated mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof mechanisms, which enables a quite compact representation of target mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof mechanism for a slightly modified problem of locating a public good.

Original languageEnglish
Title of host publicationPRIMA 2019
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings
EditorsMatteo Baldoni, Mehdi Dastani, Beishui Liao, Yuko Sakurai, Rym Zalila Wenkstern
PublisherSpringer
Pages321-337
Number of pages17
ISBN (Print)9783030337919
DOIs
Publication statusPublished - Jan 1 2019
Event22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019 - Turin, Italy
Duration: Oct 28 2019Oct 31 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11873 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019
CountryItaly
CityTurin
Period10/28/1910/31/19

Fingerprint

Mechanism Design
Facility Location
Grid
Boolean Satisfiability
Extendability
False
Unknown
Target
Demonstrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Okada, N., Todo, T., & Yokoo, M. (2019). SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location. In M. Baldoni, M. Dastani, B. Liao, Y. Sakurai, & R. Zalila Wenkstern (Eds.), PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings (pp. 321-337). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11873 LNAI). Springer. https://doi.org/10.1007/978-3-030-33792-6_20

SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location. / Okada, Nodoka; Todo, Taiki; Yokoo, Makoto.

PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings. ed. / Matteo Baldoni; Mehdi Dastani; Beishui Liao; Yuko Sakurai; Rym Zalila Wenkstern. Springer, 2019. p. 321-337 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11873 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Okada, N, Todo, T & Yokoo, M 2019, SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location. in M Baldoni, M Dastani, B Liao, Y Sakurai & R Zalila Wenkstern (eds), PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11873 LNAI, Springer, pp. 321-337, 22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019, Turin, Italy, 10/28/19. https://doi.org/10.1007/978-3-030-33792-6_20
Okada N, Todo T, Yokoo M. SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location. In Baldoni M, Dastani M, Liao B, Sakurai Y, Zalila Wenkstern R, editors, PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings. Springer. 2019. p. 321-337. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-33792-6_20
Okada, Nodoka ; Todo, Taiki ; Yokoo, Makoto. / SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location. PRIMA 2019: Principles and Practice of Multi-Agent Systems - 22nd International Conference, Proceedings. editor / Matteo Baldoni ; Mehdi Dastani ; Beishui Liao ; Yuko Sakurai ; Rym Zalila Wenkstern. Springer, 2019. pp. 321-337 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c09e6f6d0bfa4634804a7185f3ee4493,
title = "SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location",
abstract = "In the literature of mechanism design, market mechanisms have been developed by professionals based on their experience. The concept of automated mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof mechanisms, which enables a quite compact representation of target mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof mechanism for a slightly modified problem of locating a public good.",
author = "Nodoka Okada and Taiki Todo and Makoto Yokoo",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-33792-6_20",
language = "English",
isbn = "9783030337919",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "321--337",
editor = "Matteo Baldoni and Mehdi Dastani and Beishui Liao and Yuko Sakurai and {Zalila Wenkstern}, Rym",
booktitle = "PRIMA 2019",

}

TY - GEN

T1 - SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location

AU - Okada, Nodoka

AU - Todo, Taiki

AU - Yokoo, Makoto

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In the literature of mechanism design, market mechanisms have been developed by professionals based on their experience. The concept of automated mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof mechanisms, which enables a quite compact representation of target mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof mechanism for a slightly modified problem of locating a public good.

AB - In the literature of mechanism design, market mechanisms have been developed by professionals based on their experience. The concept of automated mechanism design (AMD), initiated by Sandholm (2002), is a ground-breaking computer-aided framework to develop market mechanisms. In this paper, we apply a very recent AMD approach based on Boolean Satisfiability (SAT) to the mechanism design of false-name-proof facility location. We first provide a general theoretical characteristic of false-name-proof mechanisms, which enables a quite compact representation of target mechanisms. Our approach successfully reproduces several known results in the literature on false-name-proof facility locations over discrete structures. Furthermore, some unknown mechanisms are discovered for locating a public good on a 2-by-2 grid, and an impossibility result is revealed for locating a public bad, with an additional mild assumption, on a 2-by-3 grid. Finally, we demonstrate the extendability of our approach, by providing a new false-name-proof mechanism for a slightly modified problem of locating a public good.

UR - http://www.scopus.com/inward/record.url?scp=85076402663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85076402663&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-33792-6_20

DO - 10.1007/978-3-030-33792-6_20

M3 - Conference contribution

AN - SCOPUS:85076402663

SN - 9783030337919

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 321

EP - 337

BT - PRIMA 2019

A2 - Baldoni, Matteo

A2 - Dastani, Mehdi

A2 - Liao, Beishui

A2 - Sakurai, Yuko

A2 - Zalila Wenkstern, Rym

PB - Springer

ER -