Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society (Q990505)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society |
scientific article; zbMATH DE number 5776997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society |
scientific article; zbMATH DE number 5776997 |
Statements
Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society (English)
0 references
1 September 2010
0 references
type two computability
0 references
social choice function
0 references
the gibbard-satterthwaite theorem
0 references
infinite society
0 references
strategy-proofness
0 references
dictator
0 references
0 references
