Results 81 to 90 of about 410 (96)
Some of the next articles are maybe not open access.

Two Proofs of the Gibbard-Satterthwaite Theorem on the Possibility of a Strategy-Proof Social Choice Function

1978
We present two proofs of a result which was formulated independently by A. Gibbard [2] and M. Satterthwaite [3]. Their theorem provides an attractive new way of viewing Arrow’s classic result on Social Welfare Functions [1]. By requiring that strategic considerations cannot be beneficially employed, it frees the statement of the ‘General Possibility ...
David Schmeidler
exaly   +2 more sources

Strategyproofness and the Gibbard-Satterthwaite Theorem

Synthesis Lectures on Artificial Intelligence and Machine Learning, 2018
Meir Reshef
exaly   +2 more sources

A Comment on the Gibbard–Satterthwaite Theorem

The B.E. Journal of Theoretical Economics
Abstract This paper re-examines the Gibbard–Satterthwaite theorem when some anomalous choice functions are allowed. We show non-dictatorial social aggregators that limit manipulation and non-dictatorial social aggregators do not permit manipulation.
Daniel Sandroni, Alvaro Sandroni
openaire   +1 more source

Arrow’s Theorem and the Gibbard-Satterthwaite Theorem

2014
In many voting systems, each voter must produce a ranked preference order of all candidates mentioned, and no ties are allowed. Such systems are called ordinal . However some voting systems, called cardinal , allow the voters to evaluate candidates separately, and a voter could say two candidates were equal.
openaire   +1 more source

Yet Another Very Short Proof of the Gibbard-Satterthwaite Theorem

SSRN Electronic Journal, 2015
We give a direct and very short proof of the famous Gibbard-Satterthwaite theorem [Alan Gibbard (1977) and Mark Satterthwaite (1975)]. The proof is based on investigating the properties of one critical preference profile constructed from those alternatives that individuals are not decisive on.
openaire   +1 more source

Parallel proofs of Arrow’s and the Gibbard-Satterthwaite theorem [PDF]

open access: possible, 2005
Arrow’s and the Gibbard-Satterthwaite theorems are proved using a common proof strategy based on a dictatorship result for choice functions. One of the instrumental results obtained shows the inconsistency between the basic assumption in each of these theorems and a mild majority principle.
openaire  

A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives

SIAM Journal on Computing, 2011
Gil Kalai, Noam Nisan, Ehud Friedgut
exaly  

Home - About - Disclaimer - Privacy