False-Name-Proofness in Facility Location Problem on the Real Line

  • Taiki Todo
  • Atsushi Iwasaki
  • Makoto Yokoo
Conference paper

DOI: 10.1007/978-3-642-17572-5_50

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)
Cite this paper as:
Todo T., Iwasaki A., Yokoo M. (2010) False-Name-Proofness in Facility Location Problem on the Real Line. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg

Abstract

Recently, mechanism design without monetary transfers is attracting much attention, since in many application domains on Internet, introducing monetary transfers is impossible or undesirable. Mechanism design studies how to design mechanisms that result in good outcomes even when agents strategically report their preferences. However, in highly anonymous settings such as the Internet, declaring preferences dishonestly is not the only way to manipulate the mechanism. Often, it is possible for an agent to pretend to be multiple agents, and submit multiple reports using different identifiers, e.g., different e-mail addresses. Such false-name manipulations are more likely to occur in a mechanism without monetary transfers, since submitting multiple reports would be less risky in such a mechanism. In this paper, we formalize false-name manipulations in facility location problems on the real line and discuss the effect of such manipulations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Taiki Todo
    • 1
  • Atsushi Iwasaki
    • 1
  • Makoto Yokoo
    • 1
  1. 1.Department of InformaticsKyushu UniversityFukuokaJapan

Personalised recommendations