Another induction proof of the Gibbard–Satterthwaite theorem

Economics Letters 105 (3):239–241 (2009)
  Copy   BIBTEX

Abstract

This paper provides an alternative proof of the Gibbard–Satterthwaite theorem.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Strategy-proof judgment aggregation.Franz Dietrich & Christian List - 2005 - Economics and Philosophy 23 (3):269-300.
Theorems and Models in Political Theory: An Application to Pettit on Popular Control.Sean Ingham - 2015 - The Good Society 24 (1):98-117.
Fermat’s Last Theorem Proved by Induction (and Accompanied by a Philosophical Comment).Vasil Penchev - 2020 - Metaphilosophy eJournal (Elsevier: SSRN) 12 (8):1-8.
A Geometric Look at Manipulation.Jan van Eijck - unknown
Social Choice Theory and Deliberative Democracy: A Reconciliation.Christian List & John Dryzek - 2003 - British Journal of Political Science 33 (1):1-28.
Strategy-proof belief merging.Aditya Ghose & Thomas Meyer - unknown
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
Truth and feasible reducibility.Ali Enayat, Mateusz Łełyk & Bartosz Wcisło - 2020 - Journal of Symbolic Logic 85 (1):367-421.
A note on Gibbard’s proof.Justin Khoo - 2013 - Philosophical Studies 166 (S1):153-164.
Tait's conservative extension theorem revisited.Ryota Akiyoshi - 2010 - Journal of Symbolic Logic 75 (1):155-167.
A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
A note on Bar Induction in Constructive Set Theory.Michael Rathjen - 2006 - Mathematical Logic Quarterly 52 (3):253-258.
Gleason's theorem has a constructive proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
The impossibility of non-manipulable probability aggregation.Franz Dietrich & Christian List - 2023

Analytics

Added to PP
2024-01-02

Downloads
9 (#1,259,520)

6 months
9 (#317,960)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references