Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences

Tomohiro Ono, Taiki Todo, Makoto Yokoo

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

3 Citations (Scopus)

Abstract

We consider the problem of locating facilities on a discrete acyclic graph, where agents’ locations are publicly known and the agents are requested to report their demands, i.e., which facilities they want to access. In this paper, we study the effect of manipulations by agents that utilize vacant vertices. Such manipulations are called rename or false-name manipulations in game theory and mechanism design literature. For locating one facility on a path, we carefully compare our model with traditional ones and clarify their differences by pointing out that some existing results in the traditional model do not carry over to our model. For locating two facilities, we analyze the existing and new mechanisms from a perspective of approximation ratio and provide non-trivial lower bounds. Finally, we introduce a new mechanism design model where richer information is available to the mechanism designer and show that under the new model false-name-proofness does not always imply population monotonicity.

Original languageEnglish
Title of host publicationPRIMA 2017
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 20th International Conference, Proceedings
PublisherSpringer Verlag
Pages163-179
Number of pages17
ISBN (Print)9783319691305
DOIs
Publication statusPublished - Jan 1 2017
Event20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017 - Nice, France
Duration: Oct 30 2017Nov 3 2017

Publication series

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

Other

Other20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017
CountryFrance
CityNice
Period10/30/1711/3/17

Fingerprint

Discrete Location
Facility Location
Manipulation
Mechanism Design
Model
Game theory
Game Theory
Monotonicity
False
Lower bound
Imply
Path
Approximation
Graph in graph theory

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ono, T., Todo, T., & Yokoo, M. (2017). Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences. In PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings (pp. 163-179). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10621 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-319-69131-2_10

Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences. / Ono, Tomohiro; Todo, Taiki; Yokoo, Makoto.

PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. Springer Verlag, 2017. p. 163-179 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10621 LNAI).

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

Ono, T, Todo, T & Yokoo, M 2017, Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences. in PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10621 LNAI, Springer Verlag, pp. 163-179, 20th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2017, Nice, France, 10/30/17. https://doi.org/10.1007/978-3-319-69131-2_10
Ono T, Todo T, Yokoo M. Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences. In PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. Springer Verlag. 2017. p. 163-179. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-69131-2_10
Ono, Tomohiro ; Todo, Taiki ; Yokoo, Makoto. / Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences. PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Proceedings. Springer Verlag, 2017. pp. 163-179 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{95798854ea394713979e03db4883da08,
title = "Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences",
abstract = "We consider the problem of locating facilities on a discrete acyclic graph, where agents’ locations are publicly known and the agents are requested to report their demands, i.e., which facilities they want to access. In this paper, we study the effect of manipulations by agents that utilize vacant vertices. Such manipulations are called rename or false-name manipulations in game theory and mechanism design literature. For locating one facility on a path, we carefully compare our model with traditional ones and clarify their differences by pointing out that some existing results in the traditional model do not carry over to our model. For locating two facilities, we analyze the existing and new mechanisms from a perspective of approximation ratio and provide non-trivial lower bounds. Finally, we introduce a new mechanism design model where richer information is available to the mechanism designer and show that under the new model false-name-proofness does not always imply population monotonicity.",
author = "Tomohiro Ono and Taiki Todo and Makoto Yokoo",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-69131-2_10",
language = "English",
isbn = "9783319691305",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "163--179",
booktitle = "PRIMA 2017",
address = "Germany",

}

TY - GEN

T1 - Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences

AU - Ono, Tomohiro

AU - Todo, Taiki

AU - Yokoo, Makoto

PY - 2017/1/1

Y1 - 2017/1/1

N2 - We consider the problem of locating facilities on a discrete acyclic graph, where agents’ locations are publicly known and the agents are requested to report their demands, i.e., which facilities they want to access. In this paper, we study the effect of manipulations by agents that utilize vacant vertices. Such manipulations are called rename or false-name manipulations in game theory and mechanism design literature. For locating one facility on a path, we carefully compare our model with traditional ones and clarify their differences by pointing out that some existing results in the traditional model do not carry over to our model. For locating two facilities, we analyze the existing and new mechanisms from a perspective of approximation ratio and provide non-trivial lower bounds. Finally, we introduce a new mechanism design model where richer information is available to the mechanism designer and show that under the new model false-name-proofness does not always imply population monotonicity.

AB - We consider the problem of locating facilities on a discrete acyclic graph, where agents’ locations are publicly known and the agents are requested to report their demands, i.e., which facilities they want to access. In this paper, we study the effect of manipulations by agents that utilize vacant vertices. Such manipulations are called rename or false-name manipulations in game theory and mechanism design literature. For locating one facility on a path, we carefully compare our model with traditional ones and clarify their differences by pointing out that some existing results in the traditional model do not carry over to our model. For locating two facilities, we analyze the existing and new mechanisms from a perspective of approximation ratio and provide non-trivial lower bounds. Finally, we introduce a new mechanism design model where richer information is available to the mechanism designer and show that under the new model false-name-proofness does not always imply population monotonicity.

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

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

U2 - 10.1007/978-3-319-69131-2_10

DO - 10.1007/978-3-319-69131-2_10

M3 - Conference contribution

AN - SCOPUS:85034248849

SN - 9783319691305

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

SP - 163

EP - 179

BT - PRIMA 2017

PB - Springer Verlag

ER -