False-Name-Proof Facility Location on Wheel Graphs

Koji Osoegawa; Taiki Todo; Makoto Yokoo

doi:10.1007/978-3-031-21203-1_9

False-Name-Proof Facility Location on Wheel Graphs

Koji Osoegawa, Taiki Todo, Makoto Yokoo

Intelligence Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we consider the study of two classes of mechanism design problems for locating a facility on a wheel graph with k≥ 4 vertices, where a vertex is located at the center, which is surrounded by a cycle graph with k- 1 vertices and connected to each vertex in the cycle. Two domains of agents’ preferences are considered; the single-peaked domain and the single-dipped domain. We are interested in the existence of anonymous social choice functions that are false-name-proof and Pareto efficient. For both domains of preferences, we provide the necessary and sufficient condition on the graph parameter k to guarantee the existence of such social choice functions. Namely, for the single-peaked preference domain, such social choice functions exist if and only if k≤ 5. On the other hand, for the single-dipped preference domain, such social choice functions exist if and only if k≤ 7.

Original language	English
Title of host publication	PRIMA 2022
Subtitle of host publication	Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings
Editors	Reyhan Aydoğan, Natalia Criado, Victor Sanchez-Anguix, Jérôme Lang, Marc Serramia
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	139-155
Number of pages	17
ISBN (Print)	9783031212024
DOIs	https://doi.org/10.1007/978-3-031-21203-1_9
Publication status	Published - 2023
Event	24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020 - Valencia , Spain Duration: Nov 16 2022 → Nov 18 2022

Publication series

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

Conference

Conference	24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020
Country/Territory	Spain
City	Valencia
Period	11/16/22 → 11/18/22

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-031-21203-1_9

Cite this

Osoegawa, K., Todo, T., & Yokoo, M. (2023). False-Name-Proof Facility Location on Wheel Graphs. In R. Aydoğan, N. Criado, V. Sanchez-Anguix, J. Lang, & M. Serramia (Eds.), PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings (pp. 139-155). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13753 LNAI). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-21203-1_9

False-Name-Proof Facility Location on Wheel Graphs. / Osoegawa, Koji; Todo, Taiki ; Yokoo, Makoto.

PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. ed. / Reyhan Aydoğan; Natalia Criado; Victor Sanchez-Anguix; Jérôme Lang; Marc Serramia. Springer Science and Business Media Deutschland GmbH, 2023. p. 139-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13753 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Osoegawa, K, Todo, T & Yokoo, M 2023, False-Name-Proof Facility Location on Wheel Graphs. in R Aydoğan, N Criado, V Sanchez-Anguix, J Lang & M Serramia (eds), PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13753 LNAI, Springer Science and Business Media Deutschland GmbH, pp. 139-155, 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020, Valencia , Spain, 11/16/22. https://doi.org/10.1007/978-3-031-21203-1_9

Osoegawa K, Todo T , Yokoo M. False-Name-Proof Facility Location on Wheel Graphs. In Aydoğan R, Criado N, Sanchez-Anguix V, Lang J, Serramia M, editors, PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. Springer Science and Business Media Deutschland GmbH. 2023. p. 139-155. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-21203-1_9

Osoegawa, Koji ; Todo, Taiki ; Yokoo, Makoto. / False-Name-Proof Facility Location on Wheel Graphs. PRIMA 2022: Principles and Practice of Multi-Agent Systems - 24th International Conference, Proceedings. editor / Reyhan Aydoğan ; Natalia Criado ; Victor Sanchez-Anguix ; Jérôme Lang ; Marc Serramia. Springer Science and Business Media Deutschland GmbH, 2023. pp. 139-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d00015b499164f73a705bdc1684ace97,

title = "False-Name-Proof Facility Location on Wheel Graphs",

abstract = "In this paper, we consider the study of two classes of mechanism design problems for locating a facility on a wheel graph with k≥ 4 vertices, where a vertex is located at the center, which is surrounded by a cycle graph with k- 1 vertices and connected to each vertex in the cycle. Two domains of agents{\textquoteright} preferences are considered; the single-peaked domain and the single-dipped domain. We are interested in the existence of anonymous social choice functions that are false-name-proof and Pareto efficient. For both domains of preferences, we provide the necessary and sufficient condition on the graph parameter k to guarantee the existence of such social choice functions. Namely, for the single-peaked preference domain, such social choice functions exist if and only if k≤ 5. On the other hand, for the single-dipped preference domain, such social choice functions exist if and only if k≤ 7.",

author = "Koji Osoegawa and Taiki Todo and Makoto Yokoo",

note = "Funding Information: Acknowledgements. This work is partially supported by JSPS KAKENHI Grant Numbers JP20H00587, JP20H00609, and JP21H04979. Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020 ; Conference date: 16-11-2022 Through 18-11-2022",

year = "2023",

doi = "10.1007/978-3-031-21203-1_9",

language = "English",

isbn = "9783031212024",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "139--155",

editor = "Reyhan Aydoğan and Natalia Criado and Victor Sanchez-Anguix and J{\'e}r{\^o}me Lang and Marc Serramia",

booktitle = "PRIMA 2022",

address = "Germany",

}

TY - GEN

T1 - False-Name-Proof Facility Location on Wheel Graphs

AU - Osoegawa, Koji

AU - Todo, Taiki

AU - Yokoo, Makoto

N1 - Funding Information: Acknowledgements. This work is partially supported by JSPS KAKENHI Grant Numbers JP20H00587, JP20H00609, and JP21H04979. Publisher Copyright: © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

PY - 2023

Y1 - 2023

N2 - In this paper, we consider the study of two classes of mechanism design problems for locating a facility on a wheel graph with k≥ 4 vertices, where a vertex is located at the center, which is surrounded by a cycle graph with k- 1 vertices and connected to each vertex in the cycle. Two domains of agents’ preferences are considered; the single-peaked domain and the single-dipped domain. We are interested in the existence of anonymous social choice functions that are false-name-proof and Pareto efficient. For both domains of preferences, we provide the necessary and sufficient condition on the graph parameter k to guarantee the existence of such social choice functions. Namely, for the single-peaked preference domain, such social choice functions exist if and only if k≤ 5. On the other hand, for the single-dipped preference domain, such social choice functions exist if and only if k≤ 7.

AB - In this paper, we consider the study of two classes of mechanism design problems for locating a facility on a wheel graph with k≥ 4 vertices, where a vertex is located at the center, which is surrounded by a cycle graph with k- 1 vertices and connected to each vertex in the cycle. Two domains of agents’ preferences are considered; the single-peaked domain and the single-dipped domain. We are interested in the existence of anonymous social choice functions that are false-name-proof and Pareto efficient. For both domains of preferences, we provide the necessary and sufficient condition on the graph parameter k to guarantee the existence of such social choice functions. Namely, for the single-peaked preference domain, such social choice functions exist if and only if k≤ 5. On the other hand, for the single-dipped preference domain, such social choice functions exist if and only if k≤ 7.

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

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

U2 - 10.1007/978-3-031-21203-1_9

DO - 10.1007/978-3-031-21203-1_9

M3 - Conference contribution

AN - SCOPUS:85142754580

SN - 9783031212024

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

SP - 139

EP - 155

BT - PRIMA 2022

A2 - Aydoğan, Reyhan

A2 - Criado, Natalia

A2 - Sanchez-Anguix, Victor

A2 - Lang, Jérôme

A2 - Serramia, Marc

PB - Springer Science and Business Media Deutschland GmbH

T2 - 24th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2020

Y2 - 16 November 2022 through 18 November 2022

ER -