SearcharxivSearch

arXiv subjects

Achille Basile

Publications and source records attributed to Achille Basile.

5 recordsLinked to original sources

The character of non-manipulable collective choices between two alternatives

We consider classes of non-manipulable social choice functions with range of cardinality at most two within a set of at least two alternatives. We provide the functional form for each of the classes we consider. This functional form is a characterization that explicitly describes how a social choice function of that particular class selects the collective choice corresponding to a profile. We provide a unified formulation of these characterizations using the new concept of "character". The choice of the character, depending on the class of social choice functions, gives the functional form of all social choice functions of the class.

econ.TH

On the relation between Preference Reversal and Strategy-Proofness

We analyze the relation between strategy-proofness and preference reversal in the case that agents may declare indifference. Interestingly, Berga and Moreno (2020), have recently derived preference reversal from group strategy-proofness of social choice functions on strict preferences domains if the range has no more than three elements. We extend this result and at the same time simplify it. Our analysis points out the role of individual strategy-proofness in deriving the preference reversal property, giving back to the latter its original individual nature (cfr. Eliaz, 2004). Moreover, we show that the difficulties Berga and Moreno highlighted relaxing the assumption on the cardinality of the range, disappear under a proper assumption on the domain. We introduce the concept of complete sets of preferences and show that individual strategy-proofness is sufficient to obtain the preference reversal property when the agents' feasible set of orderings is complete. This covers interesting cases like single peaked preferences, rich domains admitting regular social choice functions, and universal domains. The fact that we use individual rather than group strategy-proofness, allows to get immediately some of the known, and some new, equivalences between individual and group strategy-proofness. Finally, we show that group strategy-proofness is only really needed to obtain preference reversal if there are infinitely many voters.

econ.TH

Geometry of anonymous binary social choices that are strategy-proof

Let $V$ be society whose members express preferences about two alternatives, indifference included. Identifying anonymous binary social choice functions with binary functions $f=f(k,m)$ defined over the integer triangular grid $G=\{(k,m)\in \mathbb{N}_0\times\mathbb{N}_0 : k+m\le |V|\} $, we show that every strategy-proof, anonymous social choice function can be described geometrically by listing, in a sequential manner, groups of segments of G, of equal (maximum possible) length, alternately horizontal and vertical, representative of preference profiles that determine the collective choice of one of the two alternatives. Indeed, we show that every function which is anonymous and strategy-proof can be described in terms of a sequence of nonnegative integers $(q_1, q_2, \cdots, q_s)$ corresponding to the cardinalities of the mentioned groups of segments. We also analyze the connections between our present representation with another of our earlier representations involving sequences of majority quotas. A Python code is available with the authors for the implementation of any such social choice function.

econ.TH

The structure of two-valued strategy-proof social choice functions with indifference

We give a structure theorem for all coalitionally strategy-proof social choice functions whose range is a subset of cardinality two of a given larger set of alternatives. We provide this in the case where the voters/agents are allowed to express indifference and the domain consists of profiles of preferences over a society of arbitrary cardinality. The theorem, that takes the form of a representation formula, can be used to construct all functions under consideration.

econ.TH

Anonymous, non-manipulable, binary social choice

Let V be a finite society whose members express weak orderings (hence also indifference, possibly) about two alternatives. We show a simple representation formula that is valid for all, and only, anonymous, non-manipulable, binary social choice functions on V . The number of such functions is $2^{n+1}$ if V contains $n$ agents.

econ.TH