1998•SSRN Electronic JournalOpen access

Minimal Manipulability and Interjacency For Two-Person Social Choice Functions

Peter Fristrup, Hans Keiding

Abstract

This paper investigates the number of profiles at which a social choice function is manipulable. It is found that there is a lower bound on this number when the social choice function is assumed non-dictatorial. Also, any number between this lower bound and the maximal number of profiles may be obtained as the number of manipulable profiles of some social choice function.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Upper and lower bounds, Social choice theory, Function (biology), Mathematical economics, Combinatorics, Mathematics, Mathematical analysis, Evolutionary biology