Contents
16 found
Order:
  1. Why Arrow's Theorem Matters for Political Theory Even If Preference Cycles Never Occur.Sean Ingham - forthcoming - Public Choice.
    Riker (1982) famously argued that Arrow’s impossibility theorem undermined the logical foundations of “populism”, the view that in a democracy, laws and policies ought to express “the will of the people”. In response, his critics have questioned the use of Arrow’s theorem on the grounds that not all configurations of preferences are likely to occur in practice; the critics allege, in particular, that majority preference cycles, whose possibility the theorem exploits, rarely happen. In this essay, I argue that the critics’ (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Democratic Deliberation and Social Choice: A Review.Christian List - 2018 - In André Bächtiger, Jane Mansbridge, John Dryzek & Mark Warren (eds.), Oxford Handbook of Deliberative Democracy. Oxford University Press.
    In normative political theory, it is widely accepted that democracy cannot be reduced to voting alone, but that it requires deliberation. In formal social choice theory, by contrast, the study of democracy has focused primarily on the aggregation of individual opinions into collective decisions, typically through voting. While the literature on deliberation has an optimistic flavour, the literature on social choice is more mixed. It is centred around several paradoxes and impossibility results identifying conflicts between different intuitively plausible desiderata. In (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  3. Single-peakedness and semantic dimensions of preferences.Daniele Porello - 2016 - Logic Journal of the IGPL 24 (4).
    Among the possible solutions to the paradoxes of collective preferences, single-peakedness is significant because it has been associated to a suggestive conceptual interpretation: a single-peaked preference profile entails that, although individuals may disagree on which option is the best, they conceptualize the choice along a shared unique dimension, i.e. they agree on the rationale of the collective decision. In this article, we discuss the relationship between the structural property of singlepeakedness and its suggested interpretation as uni-dimensionality of a social choice. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  4. Deliberation, single-peakedness, and the possibility of meaningful democracy: evidence from deliberative polls.Christian List, Robert Luskin, James Fishkin & Iain McLean - 2013 - Journal of Politics 75 (1):80–95.
    Majority cycling and related social choice paradoxes are often thought to threaten the meaningfulness of democracy. But deliberation can prevent majority cycles – not by inducing unanimity, which is unrealistic, but by bringing preferences closer to single-peakedness. We present the first empirical test of this hypothesis, using data from Deliberative Polls. Comparing preferences before and after deliberation, we find increases in proximity to single-peakedness. The increases are greater for lower versus higher salience issues and for individuals who seem to have (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   21 citations  
  5. On the elusive notion of meta-agreement.Valeria Ottonelli & Daniele Porello - 2013 - Politics, Philosophy and Economics 12 (1):68-92.
    Public deliberation has been defended as a rational and noncoercive way to overcome paradoxical results from democratic voting, by promoting consensus on the available alternatives on the political agenda. Some critics have argued that full consensus is too demanding and inimical to pluralism and have pointed out that single-peakedness, a much less stringent condition, is sufficient to overcome voting paradoxes. According to these accounts, deliberation can induce single-peakedness through the creation of a ‘meta-agreement’, that is, agreement on the dimension according (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  6. A proof-theoretical view of collective rationality.Daniele Porello - 2013 - In Proceedings of the 23rd International Joint Conference of Artificial Intelligence (IJCAI 2013).
    The impossibility results in judgement aggregation show a clash between fair aggregation procedures and rational collective outcomes. In this paper, we are interested in analysing the notion of rational outcome by proposing a proof-theoretical understanding of collective rationality. In particular, we use the analysis of proofs and inferences provided by linear logic in order to define a fine-grained notion of group reasoning that allows for studying collective rationality with respect to a number of logics. We analyse the well-known paradoxes in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  7. (1 other version)The theory of judgment aggregation: an introductory review.Christian List - 2012 - Synthese 187 (1):179-207.
    This paper provides an introductory review of the theory of judgment aggregation. It introduces the paradoxes of majority voting that originally motivated the field, explains several key results on the impossibility of propositionwise judgment aggregation, presents a pedagogical proof of one of those results, discusses escape routes from the impossibility and relates judgment aggregation to some other salient aggregation problems, such as preference aggregation, abstract aggregation and probability aggregation. The present illustrative rather than exhaustive review is intended to give readers (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   10 citations  
  8. Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections.Stephane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello & Joel Uckelman - 2011 - In Stephane Airiau, Ulle Endriss, Umberto Grandi, Daniele Porello & Joel Uckelman (eds.), {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011. pp. 18--23.
    Many collective decision making problems have a combinatorial structure: the agents involved must decide on multiple issues and their preferences over one issue may depend on the choices adopted for some of the others. Voting is an attractive method for making collective decisions, but conducting a multi-issue election is challenging. On the one hand, requiring agents to vote by expressing their preferences over all combinations of issues is computationally infeasible; on the other, decomposing the problem into several elections on smaller (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. The Logical Space of Democracy.Christian List - 2011 - Philosophy and Public Affairs 39 (3):262-297.
    Can we design a perfect democratic decision procedure? Condorcet famously observed that majority rule, our paradigmatic democratic procedure, has some desirable properties, but sometimes produces inconsistent outcomes. Revisiting Condorcet’s insights in light of recent work on the aggregation of judgments, I show that there is a conflict between three initially plausible requirements of democracy: “robustness to pluralism”, “basic majoritarianism”, and “collective rationality”. For all but the simplest collective decision problems, no decision procedure meets these three requirements at once; at most (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   18 citations  
  10. Ranking judgments in Arrow’s setting.Daniele Porello - 2010 - Synthese 173 (2):199-210.
    In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit. Ranking judgments were introduced in order to state the logical connections between the impossibility theorem of aggregating sets of judgments and Arrow’s theorem. I present a proof of the theorem concerning ranking judgments as a corollary of Arrow’s theorem, extending the translation between preferences and judgments defined in List and Pettit to the conditions on the aggregation procedure.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  11. Voti e altri buchi elettorali. Che cos’è un voto? Come si contano i voti? E i voti contano davvero?Roberto Casati & Achille C. Varzi - 2008 - Rivista di Estetica 37:169-194.
    A philosophical dialogue on the functioning, the limits, and the paradoxes of our electoral practices, dealing with such basic questions as: What is a vote? How do we count votes? And do votes really count?
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. Judgment aggregation by quota rules: Majority voting generalized.Franz Dietrich & Christian List - 2007 - Journal of Theoretical Politics 19 (4):391-424.
    The widely discussed "discursive dilemma" shows that majority voting in a group of individuals on logically connected propositions may produce irrational collective judgments. We generalize majority voting by considering quota rules, which accept each proposition if and only if the number of individuals accepting it exceeds a given threshold, where different thresholds may be used for different propositions. After characterizing quota rules, we prove necessary and sufficient conditions on the required thresholds for various collective rationality requirements. We also consider sequential (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   35 citations  
  13. Judgment aggregation with consistency alone.Franz Dietrich & Christian List - 2007 - Maastricht University.
    All existing impossibility theorems on judgment aggregation require individual and collective judgment sets to be consistent and complete, arguably a demanding rationality requirement. They do not carry over to aggregation functions mapping profiles of consistent individual judgment sets to consistent collective ones. We prove that, whenever the agenda of propositions under consideration exhibits mild interconnections, any such aggregation function that is "neutral" between the acceptance and rejection of each proposition is dictatorial. We relate this theorem to the literature.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   14 citations  
  14. Arrow's theorem in judgment aggregation.Franz Dietrich & Christian List - 2007 - Social Choice and Welfare 29 (1):19-33.
    In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we thereby (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   83 citations  
  15. (1 other version)Majority voting on restricted domains.Franz Dietrich & Christian List - 2007 - Journal of Economic Theory 145 (2):512-543.
    In judgment aggregation, unlike preference aggregation, not much is known about domain restrictions that guarantee consistent majority outcomes. We introduce several conditions on individual judgments su¢ - cient for consistent majority judgments. Some are based on global orders of propositions or individuals, others on local orders, still others not on orders at all. Some generalize classic social-choice-theoretic domain conditions, others have no counterpart. Our most general condition generalizes Sen’s triplewise value-restriction, itself the most general classic condition. We also prove a (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   18 citations  
  16. Strategy-proof judgment aggregation.Franz Dietrich & Christian List - 2005 - Economics and Philosophy 23 (3):269-300.
    Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   51 citations