Can I read The Computational Complexity of Choice Sets on EtoBox?

The Computational Complexity of Choice Sets by Felix Brandt; Felix Fischer; Paul Harrenstein is a Computer Science article available to read on EtoBox.

What is The Computational Complexity of Choice Sets about?

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of these criteria can be formulated in terms of choice sets that single out reasonable alternatives based on the preferences of the voters. In this paper, we consider choice sets whose definition merely relies on the pairwise majority relation. These sets include the __Copeland set__, the __Smith set__, the __Schwartz set__, __von Neumann‐Morgenstern stable sets__, the __Banks set__, and the __Slater set__. We investigate the relationships between these sets and completely characterize their computational complexity, which allows us to obtain hardness results for entire classes of social choice rules (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

Who reads The Computational Complexity of Choice Sets?

Author

Felix Brandt; Felix Fischer; Paul Harrenstein

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Ltd.; Wiley (ISSN 0044-3050)

Published

2009

Language

EN

Field

Computer Science (Physical Sciences)