False-name-proof voting with costs over two alternatives

Liad Wagman and Vincent Conitzer ()

International Journal of Game Theory, 2014, vol. 43, issue 3, 599-618

Abstract: In open, anonymous settings such as the Internet, agents can participate in a mechanism multiple times under different identities. A mechanism is false-name-proof if no agent ever benefits from participating more than once. Unfortunately, the design of false-name-proof mechanisms has been hindered by a variety of negative results. In this paper, we show how some of these negative results can be circumvented by making the realistic assumption that obtaining additional identities comes at a (potentially small) cost. We consider arbitrary such costs and apply our results within the context of a voting model with two alternatives. Copyright Springer-Verlag Berlin Heidelberg 2014

Keywords: Mechanism design; False-name-proofness; Voting; Revelation principle; Anonymity (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00182-013-0397-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:43:y:2014:i:3:p:599-618

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-013-0397-3

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().