On the Fishburn social choice function

2015 ◽  
Vol 11 (2) ◽  
pp. n/a-n/a ◽  
Author(s):  
Eric Kamwa
Author(s):  
Alec Sandroni ◽  
Alvaro Sandroni

AbstractArrow (1950) famously showed the impossibility of aggregating individual preference orders into a social preference order (together with basic desiderata). This paper shows that it is possible to aggregate individual choice functions, that satisfy almost any condition weaker than WARP, into a social choice function that satisfy the same condition (and also Arrow’s desiderata).


2021 ◽  
Vol 16 (4) ◽  
pp. 1195-1220
Author(s):  
Ujjwal Kumar ◽  
Souvik Roy ◽  
Arunava Sen ◽  
Sonal Yadav ◽  
Huaxia Zeng

The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are “neighbors.” A social choice function is locally strategy‐proof if no type of a voter can gain by misrepresentation to a type that is a neighbor of her true type. A social choice function is strategy‐proof if no type of a voter can gain by misrepresentation to an arbitrary type. Local‐global equivalence (LGE) is satisfied if local strategy‐proofness implies strategy‐proofness. The paper identifies a condition on the graph that characterizes LGE. Our notion of “localness” is perfectly general. We use this feature of our model to identify notions of localness according to which various models of multidimensional voting satisfy LGE. Finally, we show that LGE for deterministic social choice functions does not imply LGE for random social choice functions.


Sign in / Sign up

Export Citation Format

Share Document