Reasoning about Social Choice Functions

Details Reasoning about Social Choice Functions Reasoning about Social Choice Functions

2011-02-16

arxiv.org/abs/1102.3341v1

Computer Science

Multiagent Systems

Scientific paper

10.1007/s10992-011-9189-z

We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the logic is decidable, and give a complete axiomatization. To demonstrate the value of the logic, we show in particular how it can be applied to the problem of determining whether a social choice function is strategy-proof.

Affiliated with

Also associated with

No associations

Rating

Reasoning about Social Choice Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reasoning about Social Choice Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reasoning about Social Choice Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417330