A note on binary strategy-proof social choice functions

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

MoreLess

Year of publication:	2022
Authors:	Basile, Achille ; De Simone, Anna ; Tarantino, Ciro
Published in:	Games. - ISSN 2073-4336. - Vol. 13.2022, 6, p. 1-19
Publisher:	Basel : MDPI
Subject:	binary social choice functions \| strategy-proofness \| indifference \| monotonicity \| Dedekind numbers

More details

Type of publication:	Article
Type of publication (narrower categories):	Article
Language:	English
Other identifiers:	10.3390/g13060078 [DOI] 1869727088 [GVK] hdl:10419/329989 [Handle]
Classification:	D71 - Social Choice; Clubs; Committees; Associations
Source:	EconStor

Persistent link: https://www.econbiz.de/10015471894