Pages that link to "Item:Q1365367"

The following pages link to Arrow's theorem and Turing computability (Q1365367):

Displaying 20 items.

• Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
• Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
• Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society (Q990505) (← links)
• The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience) (Q990626) (← links)
• On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem (Q1022421) (← links)
• The Nakamura numbers for computable simple games (Q1038709) (← links)
• Infinite populations, choice and determinacy (Q1615993) (← links)
• Nonanonymity and sensitivity of computable simple games (Q1763192) (← links)
• Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
• Acyclicity, anonymity, and prefilters (Q1985738) (← links)
• Superset-robust collective choice rules (Q2019358) (← links)
• Stable preference aggregation with infinite population (Q2171855) (← links)
• Quasi-stationary social welfare functions (Q2193073) (← links)
• Proving Arrow's theorem by \texttt{PROLOG} (Q2385186) (← links)
• On the computability of binary social choice rules in an infinite society and the halting problem (Q2479229) (← links)
• Computability of simple games: A characterization and application to the core (Q2482640) (← links)
• On continuity of Arrovian social welfare functions (Q2500706) (← links)
• Anonymity in large societies (Q2500715) (← links)
• Infinite-population approval voting: a proposal (Q6187757) (← links)
• Intergenerational equity and infinite-population ethics: a survey (Q6596167) (← links)