Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Gibbard–Satterthwaite theorem

Index Gibbard–Satterthwaite theorem

In social choice theory, the Gibbard–Satterthwaite theorem is a result published independently by philosopher Allan Gibbard in 1973 and economist Mark Satterthwaite in 1975. [1]

21 relations: Allan Gibbard, American Mathematical Monthly, Arrow's impossibility theorem, Borda count, Duggan–Schwartz theorem, Duncan Black, Gibbard's theorem, Lewis Carroll, Mark Satterthwaite, Mechanism design, Michael Dummett, Noam Nisan, Quasilinear utility, Ranked voting, Robin Farquharson, Social choice theory, Tactical voting, Total order, Utility, Vickrey–Clarke–Groves auction, Weak ordering.

Allan Gibbard

Allan Gibbard (born 1942) is the Richard B. Brandt Distinguished University Professor of Philosophy Emeritus at the University of Michigan, Ann Arbor.

New!!: Gibbard–Satterthwaite theorem and Allan Gibbard · See more »

American Mathematical Monthly

The American Mathematical Monthly is a mathematical journal founded by Benjamin Finkel in 1894.

New!!: Gibbard–Satterthwaite theorem and American Mathematical Monthly · See more »

Arrow's impossibility theorem

In social choice theory, Arrow's impossibility theorem, the general possibility theorem or Arrow's paradox is an impossibility theorem stating that when voters have three or more distinct alternatives (options), no ranked voting electoral system can convert the ranked preferences of individuals into a community-wide (complete and transitive) ranking while also meeting a specified set of criteria: unrestricted domain, non-dictatorship, Pareto efficiency and independence of irrelevant alternatives.

New!!: Gibbard–Satterthwaite theorem and Arrow's impossibility theorem · See more »

Borda count

The Borda count is a family of single-winner election methods in which voters rank options or candidates in order of preference.

New!!: Gibbard–Satterthwaite theorem and Borda count · See more »

Duggan–Schwartz theorem

The Duggan–Schwartz theorem (named after John Duggan and Thomas Schwartz) is a result about voting systems designed to choose a nonempty set of winners from the preferences of certain individuals, where each individual ranks all candidates in order of preference.

New!!: Gibbard–Satterthwaite theorem and Duggan–Schwartz theorem · See more »

Duncan Black

Duncan Black (23 May 1908 – 14 January 1991) was a Scottish economist who laid the foundations of social choice theory.

New!!: Gibbard–Satterthwaite theorem and Duncan Black · See more »

Gibbard's theorem

In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973.

New!!: Gibbard–Satterthwaite theorem and Gibbard's theorem · See more »

Lewis Carroll

Charles Lutwidge Dodgson (27 January 1832 – 14 January 1898), better known by his pen name Lewis Carroll, was an English writer, mathematician, logician, Anglican deacon, and photographer.

New!!: Gibbard–Satterthwaite theorem and Lewis Carroll · See more »

Mark Satterthwaite

Mark Allen Satterthwaite is an economist at the Kellogg School of Management at Northwestern University in Evanston, Illinois.

New!!: Gibbard–Satterthwaite theorem and Mark Satterthwaite · See more »

Mechanism design

Mechanism design is a field in economics and game theory that takes an engineering approach to designing economic mechanisms or incentives, toward desired objectives, in strategic settings, where players act rationally.

New!!: Gibbard–Satterthwaite theorem and Mechanism design · See more »

Michael Dummett

Sir Michael Anthony Eardley Dummett, FBA (27 June 192527 December 2011) was an English philosopher, described as "among the most significant British philosophers of the last century and a leading campaigner for racial tolerance and equality." He was, until 1992, Wykeham Professor of Logic at the University of Oxford.

New!!: Gibbard–Satterthwaite theorem and Michael Dummett · See more »

Noam Nisan

Noam Nisan (נעם ניסן; born June 20, 1961) is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem.

New!!: Gibbard–Satterthwaite theorem and Noam Nisan · See more »

Quasilinear utility

In economics and consumer theory, quasilinear utility functions are linear in one argument, generally the numeraire.

New!!: Gibbard–Satterthwaite theorem and Quasilinear utility · See more »

Ranked voting

Ranked voting describes certain voting systems in which voters rank outcomes in a hierarchy on the ordinal scale (ordinal voting systems).

New!!: Gibbard–Satterthwaite theorem and Ranked voting · See more »

Robin Farquharson

Reginald Robin Farquharson (3 October 1930 – 1 April 1973) was an academic whose interest in mathematics and politics led him to work on game theory.

New!!: Gibbard–Satterthwaite theorem and Robin Farquharson · See more »

Social choice theory

Social choice theory or social choice is a theoretical framework for analysis of combining individual opinions, preferences, interests, or welfares to reach a collective decision or social welfare in some sense.

New!!: Gibbard–Satterthwaite theorem and Social choice theory · See more »

Tactical voting

In voting methods, tactical voting (or strategic voting or sophisticated voting or insincere voting) occurs, in elections with more than two candidates, when a voter supports another candidate more strongly than their sincere preference in order to prevent an undesirable outcome.

New!!: Gibbard–Satterthwaite theorem and Tactical voting · See more »

Total order

In mathematics, a linear order, total order, simple order, or (non-strict) ordering is a binary relation on some set X, which is antisymmetric, transitive, and a connex relation.

New!!: Gibbard–Satterthwaite theorem and Total order · See more »

Utility

Within economics the concept of utility is used to model worth or value, but its usage has evolved significantly over time.

New!!: Gibbard–Satterthwaite theorem and Utility · See more »

Vickrey–Clarke–Groves auction

A Vickrey–Clarke–Groves (VCG) auction is a type of sealed-bid auction of multiple items.

New!!: Gibbard–Satterthwaite theorem and Vickrey–Clarke–Groves auction · See more »

Weak ordering

In mathematics, especially order theory, a weak ordering is a mathematical formalization of the intuitive notion of a ranking of a set, some of whose members may be tied with each other.

New!!: Gibbard–Satterthwaite theorem and Weak ordering · See more »

Redirects here:

Gibbard-Satterthwaite, Gibbard-Satterthwaite theorem, Gibbard-satterthwaite Theorem, Gibbard-satterthwaite theorem.

References

[1] https://en.wikipedia.org/wiki/Gibbard–Satterthwaite_theorem

OutgoingIncoming
Hey! We are on Facebook now! »