Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/329989 
Year of Publication: 
2022
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 13 [Issue:] 6 [Article No.:] 78 [Year:] 2022 [Pages:] 1-19
Publisher: 
MDPI, Basel
Abstract: 
Let 𝝫𝑛 be the set of the binary strategy-proof social choice functions referred to a group of n voters who are allowed to declare indifference between the alternatives. We provide a recursive way to obtain the set 𝝫𝑛+1 from the set 𝝫𝑛. Computing the cardinalities?𝑛presents difficulties as the computation of the Dedekind numbers. The latter give the analogous number of social choice functions when only strict preferences are admitted. A comparison is given for the known values. Based on our results, we present a graphical description of the binary strategy-proof social choice functions in the case of three voters.
Subjects: 
binary social choice functions
strategy-proofness
indifference
monotonicity
Dedekind numbers
JEL: 
D71
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.