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]

@article{Tanaka07b,
  title = {Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society},
  author = {Yasuhito Tanaka},
  year = {2007},
  doi = {10.1016/j.amc.2007.02.130},
  url = {http://dx.doi.org/10.1016/j.amc.2007.02.130},
  tags = {social},
  researchr = {https://researchr.org/publication/Tanaka07b},
  cites = {0},
  citedby = {0},
  journal = {Applied Mathematics and Computation},
  volume = {192},
  number = {1},
  pages = {168-174},
}