Coalitional Structure of the Muller-Satterthwaite Theorem

نویسندگان

  • Pingzhong Tang
  • Tuomas Sandholm
چکیده

The Muller-Satterthwaite theorem states that social choice functions that satisfy unanimity and monotonicity are also dictatorial. Unlike Arrow’s theorem, it does not assume that the function produces a transitive social ordering. Wilson showed that a voting process under Arrow’s conditions can be interpreted as a strong and proper simple game—as defined by von Neumann and Morgenstern. We show this to be the case also under the Muller-Satterthwaite conditions. Our main theorem, which we prove using two very different approaches—one partially automated and one manual—is that a winning coalition coincides with a blocking coalition under unanimity and monotonicity. This might be of independent interest. We also show that this can be used to generate a short proof of the Muller-Satterthwaite theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)

This paper is an attempt to examine the main theorems of social choice theory from the viewpoint of constructive mathematics. We examine the Gibbard–Satterthwaite theorem [A.F. Gibbard, Manipulation of voting schemes: a general result, Econometrica 41 (1973) 587–601; M.A. Satterthwaite, Strategyproofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and soc...

متن کامل

Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society

This paper investigates the computability problem of the Gibbard–Satterthwaite theorem [A.F. Gibbard, Manipulation of voting schemes: a general result, Econometrica 41 (1973) 587–601; M.A. Satterthwaite, Strategyproofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions, Journal of Economic Theory 10 (1975) 187–217] of social choic...

متن کامل

Arrow ’ s theorem and the Gibbard - Satterthwaite theorem : a unified approach *

The connection between Arrow’s theorem and the Gibbard-Satterthwaite theorem is further strengthened by providing a single proof that yields both results.  2001 Elsevier Science B.V. All rights reserved.

متن کامل

Social Choice Theory in HOL Arrow and Gibbard-Satterthwaite

This article presents formalizations in higher-order logic of two proofs of Arrow’s impossibility theorem due to Geanakoplos. The Gibbard-Satterthwaite theorem is derived as a corollary. Lacunae found in the literature are discussed.

متن کامل

COALITIONAL GAME WITH FUZZY PAYOFFS AND CREDIBILISTIC SHAPLEY VALUE

Coalitional game deals with situations that involve cooperations among players, and there are different solution concepts such as the core,the Shapley value and the kernel. In many situations, there is no way to predict the payoff functions except for the expert experiencesand subjective intuitions, which leads to the coalitional game with fuzzy payoffs. Within the framework of credibility theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012