• Neu
Puppe / Slinko | Condorcet Domains | E-Book | www2.sack.de
E-Book

E-Book, Englisch, 215 Seiten

Reihe: Studies in Choice and Welfare

Puppe / Slinko Condorcet Domains

The Mathematics of Coherent Collective Decision-Making
Erscheinungsjahr 2026
ISBN: 978-3-032-15116-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

The Mathematics of Coherent Collective Decision-Making

E-Book, Englisch, 215 Seiten

Reihe: Studies in Choice and Welfare

ISBN: 978-3-032-15116-2
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark



This book offers a comprehensive account of Condorcet domains—structured sets of preference orders in which the pairwise majority relation remains transitive for any odd-numbered group of voters. These domains form the foundation for normatively robust voting procedures and enable strong possibility results in incentive-compatible mechanism design.

Well-known examples include single-peaked, single-crossing, and group-separable domains. The study of Condorcet domains bridges multiple disciplines, including economics, political science, mathematics, and computer science, and has seen significant theoretical advances in recent years.

This monograph systematically presents these developments, covering both foundational concepts and cutting-edge results. It will be of interest to economists, mathematicians, and scholars in related fields seeking a deep understanding of preference aggregation and its structural underpinnings.


— Prof. Hervé Moulin, Adam Smith Business School, University of Glasgow, United Kingdom

Puppe / Slinko Condorcet Domains jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Basic concepts and results.- Single-peaked domains and generalisations.- Single-crossing domains.- Peak-pit Condorcet domains.- Domains defined by alternating schemes.- Compositions and decompositions of Condorcet domains.- Symmetric Condorcet domains.- Constructions of large Condorcet domains.- Dittrich’s classification of maximal Condorcet domains on four alternatives.-  Arrovian aggregation and strategy-proof social choice.- Condorcet domains of weak and partial orders.


Clemens Puppe  is Professor of Economic Theory at the Karlsruhe Institute of Technology (KIT), where he also serves as co-director of the Institute of Economics. He studied Mathematics and Philosophy at Heidelberg University and the Free University of Berlin, and earned his Ph.D. from the University of Karlsruhe with a thesis on individual decision-making under uncertainty. His research focuses on microeconomic theory, particularly decision theory and social choice theory, with contributions to the measurement of freedom, diversity theory, judgment aggregation, and strategy-proof voting rules.

Prof. Puppe has held academic positions at the University of Vienna, the University of Bonn, and visiting appointments at institutions including Harvard University, the University of Auckland, and Oxford University. He is co-editor of the   and served as managing editor of   from 2012 to 2024.

Arkadii M. Slinko is currently Professor of Mathematics at the University of Auckland, New Zealand. Before taking this position in 1993 he was a Senior Research Fellow of the interdisciplinary Institute of Systems Analysis of Russian Academy of Sciences in Moscow. He has published extensively in a wide range of journals in mathematics, computer science, economics, and politics. His current research focuses on the mathematics of social choice, game theory, and secret sharing.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.