On the computability of binary social choice rules in an infinite society and the halting problem

Yasuhito Tanaka. On the computability of binary social choice rules in an infinite society and the halting problem. Applied Mathematics and Computation, 197(2):598-603, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.