Showing 1 - 1 of 1
A social welfare function for a denumerable society satisfies Pairwise Computability if for each pair (x,y) of alternatives, there exists an algorithm that can decide from any description of each profile on {x,y} whether the society prefers x to y. I prove that if a social welfare function...
Persistent link: https://www.econbiz.de/10005753427