DIFFERENT APPROACHES TO THE AGGREGATION OF PREFERENCES

DOI10.1080/01969728208927704zbMATH Open0506.90005OpenAlexW2020833358MaRDI QIDQ4744016FDOQ4744016

Authors: Walburga Rödding 

Publication date: 1982

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969728208927704

zbMATH Keywords

finite automataunsolvabilityTuring machinesweighting functionaggregation of preferencesnetwork of automatamajority principlebest alternativesstop-problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Individual preferences (91B08) Social choice (91B14) Automata and formal grammars in connection with logical questions (03D05) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35)

This page was built for publication: DIFFERENT APPROACHES TO THE AGGREGATION OF PREFERENCES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744016)