On the computability of binary social choice rules in an infinite society and the halting problem
From MaRDI portal
Publication:2479229
DOI10.1016/j.amc.2007.07.059zbMath1148.91014MaRDI QIDQ2479229
Publication date: 26 March 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.07.059
Related Items
On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem, COMPUTABLE ECONOMICS: RECONSTRUCTING THE NONCONSTRUCTIVE
Cites Work