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

Yasuhito Tanaka. Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society. Applied Mathematics and Computation, 192(1):168-174, 2007. [doi]

Abstract

Abstract is missing.