The Epistemic View of Belief Merging: Can We Track the Truth?

Total Page:16

File Type:pdf, Size:1020Kb

The Epistemic View of Belief Merging: Can We Track the Truth? The Epistemic View of Belief Merging: Can We Track the Truth? Patricia Everaere 1 and Sebastien´ Konieczny2 and Pierre Marquis2 Abstract. Belief merging is often described as the process of defin- In this paper we introduce a new point of view about belief merg- ing a base which best represents the beliefs of a group of agents (a ing, that goes beyond the usual synthesis view: the epistemic view. profile of belief bases). The resulting base can be viewed as a syn- Synthesis View: Under the synthesis view, belief merging aims at thesis of the input profile. In this paper another view of what belief characterizing a base which best represents the beliefs of the input merging aims at is considered: the epistemic view. Under this view profile. This is the view adopted in previous belief merging works. the purpose of belief merging is to best approximate the true state of Epistemic View: Under the epistemic view, the purpose of a belief the world. We point out a generalization of Condorcet’s Jury Theo- merging process is to best approximate the true state of the world. rem from the belief merging perspective. Roughly, we show that if the beliefs of sufficiently many reliable agents are merged then in In the general case, no agent has a perfect view of the real world, her the limit the true state of the world is identified. We introduce a new beliefs are pervaded with uncertainty: An agent typically does not know which one of the models of her postulate suited to the truth tracking issue. We identify some merg- • ing operators from the literature which satisfy it and other operators base represents the true state of the world, She is not even ensured that the true state of the world is really which do not. • among the models of her base.3 Belief merging under the epistemic view can be considered as a way 1 Introduction to circumvent such an uncertainty at the group level, by tracking the In many areas of computer science, including distributed databases true state of the world. Interestingly, the truth tracking issue discrimi- and multi-agent systems, one needs to synthesize pieces of informa- nates belief merging from goal merging. Indeed, the concept of truth tion issued from several sources. What makes this problem difficult tracking is meaningless when goals are considered: there is no no- is, among other things, that the information sources typically contra- tion of ”true goal” which would be analogous to the true state of the dict each other. When the available pieces of information are beliefs world in the goal merging setting. represented in propositional logic, this problem is called (proposi- The problem of truth tracking has been studied for centuries in so- tional) belief merging. Many different belief merging operators have cial choice and in political science, in order to justify the foundations been pointed out so far. In this paper we focus on the purely logical of decisions made by jury trials. The main theoretical result here is case, i.e., we assume that belief bases are sets of propositional formu- Condorcet’s Jury Theorem [7]. This theorem states that if a jury is lae (see e.g. [2, 20, 12, 11, 9]). Other operators have been provided composed of reliable and independent individuals who aim at deter- in more general settings, such as weighted logics (possibilistic logic mining the right answer to a yes/no question, then the probability that or settings based on ordinal conditional functions) [3, 16, 4], which the decision made by the jury is the right one tends to 1 as the size of prove useful when more information are available (especially, when the jury tends to infinity. all the pieces of belief are not equally certain). In these more general In this paper we formalize the truth tracking issue from a belief settings, the merging problem becomes close to preorder (preference) merging perspective. We show that some belief merging operators aggregation, as studied in social choice theory [1, 19]. can be used to identify the true state of the world by considering suf- Logical properties of merging operators have been investigated in ficiently many reliable, homogeneous and independent agents. To be several works [20, 14, 12]. In [12] a set of logical properties have more precise, we present a generalization of Condorcet’s Jury Theo- been put forward to characterize the family of IC (Integrity Con- rem under uncertainty (i.e., when each base may have several mod- straints) merging operators. IC merging operators have been advo- els). We introduce a Truth Tracking (TT) postulate, and we point cated to be suited to both belief merging and goal merging. Even if IC operators satisfying it and other IC operators which do not. This it might look strange at a first glance that very different concepts, shows that (TT) is independent of the (conjunction of the) IC postu- such as goals and beliefs, can be handled in the same way with re- lates. We also provide experimental results in order to investigate the spect to aggregation, the adequacy of IC merging operators to propo- convergence speed of truth tracking for the belief merging operator dD ,⌃ sitional merging (whatever goals or beliefs are to be merged) has not ∆ . In most cases the number of agents to be considered for en- been challenged so far. This makes sense since in both cases merging suring that the merged base identifies the true state of the world with aims at synthesizing the information represented in the given profile high probability is not so large. of propositional bases. 3 If one supposes that the agent is ensured that the true state of the world is a model of her belief base, then one talks about “knowledge” this 1 LIFL-CNRS, USTL, France, email: [email protected] assumption is the only difference between belief and knowledge − and 2 CRIL-CNRS, Universite´ d’Artois, France, email: [email protected], marq- knowledge merging is not so interesting, since the only sensible knowledge− [email protected] merging operator is conjunction. The rest of the paper is organized as follows. In the next section, 3 Condorcet’s Jury Theorem and Extensions we give some formal preliminaries. Then we recall Condorcet’s Jury Theorem, and some of its generalizations. In the third section we We first consider a profile Ec of n agents where each agent i votes point out new generalizations of Condorcet’s Jury Theorem suited to for an alternative, let us say a state of the world !i . Among the ? 2W the belief merging perspective. Then we introduce the (TT) postulate possible states of the world is the true one ! . and we show that IC postulates and (TT) are logically independent. The hypotheses used in Condorcet’s Jury Theorem are that agents Finally we present the experimental results we obtained and we dis- are both independent and reliable. Since several notions of relia- cuss them. For space reasons, we report the proof of the main result bility will be considered in the following, we call the first one R1- (Theorem 3), and omit the other ones. reliability: The R1-reliability pi of an agent i is the probability that i gives • ? 2 Preliminaries the true state of the world, i.e., pi = P ([Ki]= ! ). { } We consider a propositional language defined from a finite set of An agent i is R1-reliable if her R1-reliability is strictly greater L • propositional variables and the usual connectives. than 0.5. (R1) P For any subset c of , c denotes the number of elements of c. The majority rule simply returns as result the interpretation which P | | An interpretation (or state of the world) is a total function from receives a strict majority of votes. Formally, let us first define the P to 0, 1 . The set of all interpretations is noted . The true state of notion of score s(!) of a state of the world ! with respect to a profile { } ? W the world is noted ! . An interpretation ! is a model of a formula Ec of complete bases: s(!)= !i Ec s.t. !i = ! . |{ 2 }| φ if and only if it makes it true in the usual truth functional 2L way. [φ] denotes the set of models of formula φ, i.e., [φ]= ! Definition 1 (Majority) Given a profile Ec of n complete bases, the { 2 ! = φ . majority rule m is defined as: m(Ec)=! if s(!) >n/2. W| | } A base K denotes the set of beliefs of an agent, it is a finite set of propositional formulae, interpreted conjunctively. We identify K We are now ready to recall Condorcet’s Jury Theorem. In this the- with the conjunction of its elements. Basically, a base K represents orem, only two alternatives are considered so that each agent votes a set [K] of states of the world. for one of them: A profile E denotes the beliefs from the group of n agents that ? are involved in the merging process. In the following, agents ex- Theorem 1 ([7]) Consider a set = !,! consisting of two W { } press sometimes a single world, only. In this case, a profile Ec is possible states of the world and a profile Ec of complete bases from a vector of complete bases. In order to avoid heavy notations, we a set of n independent and R1-reliable agents sharing the same R1- assimilate each complete base with its model and write such pro- reliability. The probability that the majority rule on this profile re- ? files as Ec = !1,...,!n .
Recommended publications
  • Social Choice Theory Christian List
    1 Social Choice Theory Christian List Social choice theory is the study of collective decision procedures. It is not a single theory, but a cluster of models and results concerning the aggregation of individual inputs (e.g., votes, preferences, judgments, welfare) into collective outputs (e.g., collective decisions, preferences, judgments, welfare). Central questions are: How can a group of individuals choose a winning outcome (e.g., policy, electoral candidate) from a given set of options? What are the properties of different voting systems? When is a voting system democratic? How can a collective (e.g., electorate, legislature, collegial court, expert panel, or committee) arrive at coherent collective preferences or judgments on some issues, on the basis of its members’ individual preferences or judgments? How can we rank different social alternatives in an order of social welfare? Social choice theorists study these questions not just by looking at examples, but by developing general models and proving theorems. Pioneered in the 18th century by Nicolas de Condorcet and Jean-Charles de Borda and in the 19th century by Charles Dodgson (also known as Lewis Carroll), social choice theory took off in the 20th century with the works of Kenneth Arrow, Amartya Sen, and Duncan Black. Its influence extends across economics, political science, philosophy, mathematics, and recently computer science and biology. Apart from contributing to our understanding of collective decision procedures, social choice theory has applications in the areas of institutional design, welfare economics, and social epistemology. 1. History of social choice theory 1.1 Condorcet The two scholars most often associated with the development of social choice theory are the Frenchman Nicolas de Condorcet (1743-1794) and the American Kenneth Arrow (born 1921).
    [Show full text]
  • Bounds on the Competence of a Homogeneous Jury
    Theory Dec. (2012) 72:89–112 DOI 10.1007/s11238-010-9216-5 Bounds on the competence of a homogeneous jury Alexander Zaigraev · Serguei Kaniovski Published online: 5 May 2010 © Springer Science+Business Media, LLC. 2010 Abstract In a homogeneous jury, the votes are exchangeable correlated Bernoulli random variables. We derive the bounds on a homogeneous jury’s competence as the minimum and maximum probability of the jury being correct, which arise due to unknown correlations among the votes. The lower bound delineates the downside risk associated with entrusting decisions to the jury. In large and not-too-competent juries the lower bound may fall below the success probability of a fair coin flip—one half, while the upper bound may not reach a certainty. We also derive the bounds on the voting power of an individual juror as the minimum and maximum probability of her/his casting a decisive vote. The maximum is less than one, while the minimum of zero can be attained for infinitely many combinations of distribution moments. Keywords Dichotomous choice · Correlated votes · Linear programming JEL Classification C61 · D72 1 Introduction The literature on Condorcet’s Jury Theorem studies the expertise of a group of experts. In a criminal jury, the experts are sworn jurors whose common purpose is to convict A. Zaigraev Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopin str. 12/18, 87-100 Toru´n, Poland e-mail: [email protected] S. Kaniovski (B) Austrian Institute of Economic Research (WIFO), P.O. Box 91, 1103 Vienna, Austria e-mail: [email protected] 123 90 A.
    [Show full text]
  • Jury Theorems
    Jury Theorems Franz Dietrich Kai Spiekermann Paris School of Economics & CNRS London School of Economics Working Paper 1 August 2016 Abstract We give a review and critique of jury theorems from a social-epistemology per- spective, covering Condorcet's (1785) classic theorem and several later refine- ments and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the `wisdom of crowds'. In particular, we argue (i) that there is a fundamental tension between voters' independence and voters' competence, hence between the two premises of most jury theorems; (ii) that the (asymptotic) conclusion that `huge groups are infallible', reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (non- asymptotic) conclusion that `larger groups are more reliable', also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the `wisdom of crowds'. 1 Introduction Jury theorems form the technical core of arguments for the `wisdom of crowds', the idea that large democratic decision-making bodies outperform small undemocratic ones when it comes to identifying factually correct alternatives. The popularity of jury theorems has spread across various disciplines such as economics, politi- cal science, philosophy, and computer science. A `jury theorem' is a mathematical theorem about the probability of correctness of majority decisions between two al- ternatives. The existence of an objectively correct (right, better) alternative is the main metaphysical assumption underlying jury theorems. This involves an epis- temic, outcome-based rather than purely procedural conception of democracy: the goal of democratic decision-making is to `track the truth', not to fairly represent 1 people's views or preferences (Cohen 1986).
    [Show full text]
  • Extending the Condorcet Jury Theorem to a General Dependent Jury
    Extending the Condorcet Jury Theorem to a general dependent jury Bezalel Peleg1 and Shmuel Zamir2’3 December 9, 2010 Abstract We investigate necessary and sufficient conditions for the existence of Bayesian- Nash equilibria that satisfy the Condorcet Jury Theorem (CJT). In the Bayesian game Gn among n jurors, we allow for arbitrary distribution on the types of jurors. In particular, any kind of dependency is possible. If each juror i has a “constant strategy”, σ i (that is, a strategy that is independent of the size n i of the jury), ≥ such that σ = (σ 1,σ 2,...,σ n ...) satisfies the CJT, then by McLennan (1998) there exists a Bayesian-Nash equilibrium that also satisfies the CJT. We translate the CJT condition on sequences of constant strategies into the following problem: (**) For a given sequence of binary random variables X = (X 1,X 2,...,X n,...) with joint distribution P, does the distribution P satisfy the asymptotic part of the CJT ? We provide sufficient conditions and two general (distinct) necessary conditions for (**). We give a complete solution to this problem when X is a sequence of exchange- able binary random variables. Introduction The simplest way to present our problem is by quoting Condorcet’s classic result (see Young (1997)): Theorem 1. (CJT–Condorcet 1785) Let n voters (n odd) choose between two alternatives that have equal likelihood of being correct a priori. Assume that voters make their judgements independently and that each has the same 1 probability p of being correct ( 2 < p < 1). Then, the probability that the group makes the correct judgement using simple majority rule is n h n h ∑ [n!/h!(n h)!]p (1 p) − h=(n+1)/2 − − which approaches 1 as n becomes large.
    [Show full text]
  • Epistemic Democracy: Generalizing the Condorcet Jury Theorem*
    version 9 January 2001 – to appear in Journal of Political Philosophy Epistemic Democracy: Generalizing the Condorcet Jury Theorem* CHRISTIAN LIST Nuffield College, Oxford and ROBERT E. GOODIN Philosophy and Social & Political Theory, Australian National University Classical debates, recently rejoined, rage over the question of whether we want our political outcomes to be right or whether we want them to be fair. Democracy can be (and has been) justified in either way, or both at once. For epistemic democrats, the aim oF democracy is to "track the truth."1 For them, democracy is more desirable than alternative forms of decision-making because, and insoFar as, it does that. One democratic decision rule is more desirable than another according to that same standard, so far as epistemic democrats are concerned.2 For procedural democrats, the aim of democracy is instead to embody certain procedural virtues.3 Procedural democrats are divided among themselves over what those virtues might be, as well as over which procedures best embody them. But all procedural democrats agree on the one central point 2 that marks them off from epistemic democrats: for procedural democrats, democracy is not about tracking any "independent truth of the matter"; instead, the goodness or rightness of an outcome is wholly constituted by the fact of its having emerged in some procedurally correct manner.4 Sometimes there is no tension between epistemic and procedural democrats, with all strands of democratic theory pointing in the same direction. That is the case where there are only two options beFore us. Then epistemic democrats, appealing to Condorcet's jury theorem, say the correct outcome is most likely to win a majority of votes.5 Procedural democrats of virtually every stripe agree.
    [Show full text]
  • Condorcet Jury Theorem: the Dependent Case Bezalel Peleg and Shmuel Zamir1 Center for the Study of Rationality the Hebrew University of Jerusalem
    Condorcet Jury Theorem: The dependent case Bezalel Peleg and Shmuel Zamir1 Center for the Study of Rationality The Hebrew University of Jerusalem. Abstract We provide an extension of the Condorcet Theorem. Our model includes both the Nitzan-Paroush framework of “unequal competencies” and Ladha’s model of “corre- lated voting by the jurors.” We assume that the jurors behave “informatively”; that is, they do not make a strategic use of their information in voting. Formally, we consider a sequence of binary random variables X = (X1,X2,...,Xn,...) with range in 0,1 and a joint probability distribution P. The pair (X,P) is said to satisfy the Con- { } Σn n dorcet Jury Theorem (CJT) if limn ∞ P i=1Xi > 2 = 1. For a general (dependent) distribution P we provide necessary→ as well as sufficient conditions for the CJT that establishes the validity of the CJT for a domain that strictly (and naturally) includes the domain of independent jurors. In particular we provide a full characterization of the exchangeable distributions that satisfy the CJT. We exhibit a large family of dis- 1 ∞ Σn Σ tributions P with liminfn n(n 1) i=1 j=iCov(Xi,Xj) > 0 that satisfy the CJT. We → − 6 do that by “interlacing” carefully selected pairs (X,P) and (X ′,P′). We then proceed to project the distributions P on the planes (p,y), and (p,y∗) where p = liminfn ∞ pn, 2 → y = liminfn ∞ E(Xn pn) , y∗ = liminfn ∞ E Xn pn , pn = (p1 + p2,... + pn)/n, → − → | − | and Xn = (X1 + X2,... + Xn)/n. We determine all feasible points in each of these planes.
    [Show full text]
  • Public Economics
    Public Economics (Master PPD & APE) (EHESS & Paris School of Economics) Thomas Piketty Academic year 2017-2018 Lecture 8: Normative and intertemporal theories of social and fiscal justice (check on line for updated versions) • “Public Economics”: see complete Syllabus here • Lectures 1-7 and 11-12 by A. Bozio and J. Grenet • You have already covered lots of topics, including optimal taxation of labor income. Now we’re going to focus on intertemporal issues and capital taxation: • Lecture 8: Normative and intertemporal theories of fiscal and social justice (Monday November 6th 2017) • Lecture 9: Capital income, inheritance & wealth taxes over time & across countries (Monday November 13th 2017) • Lecture 10: Optimal taxation of capital income, inheritance & wealth (Tuesday November 21st 2017) Roadmap of lecture 8 • Do conflicts about inequality and the role of government come from different interests, different values/objectives, or different beliefs systems about the the economy is working? • A simple model of inequality and beliefs • The dimensions of political conflict and beliefs systems about inequality: taxation vs education vs globalization • The problem of intertemporal justice: how much capital and debt should we leave to our children? • Aggregating different interests/values/beliefs: Arrow’s impossibility theorem, Condorcet’s paradox & majority cycles • Condorcet’s jury theorem & the constructive view of political institutions • Q.: Do conflicts about inequality and the role of government come from different interests, different values/objectives, or different beliefs systems about the society and the economy are working? • A.: Probably from all three dimensions. But the « different beliefs systems » view appears to be more powerful to explain observed conflicting attitudes toward inequality.
    [Show full text]
  • Minorities and Storable Votes
    Columbia University Department of Economics Discussion Paper Series Minorities and Storable Votes Alessandra Casella Thomas Palfrey Raymond Riezman Discussion Paper No.: 0506-02 Department of Economics Columbia University New York, NY 10027 August 2005 Minorities and Storable Votes∗ Alessandra Casella† Thomas Palfrey‡ Raymond Riezman§ August 25, 2005 Abstract The paper studies a simple voting system that has the potential to increase the power of minorities without sacrificing aggregate efficiency. Storable votes grant each voter a stock of votes to spend as desired over a series of binary decisions. By accumulating votes on issues that it deems most important, the minority can win occasionally. But because the ma- jority typically can outvote it, the minority wins only if its strength of preference is high and the majority’s strength of preference is low. The result is that with storable votes, aggregate efficiency either falls little or in fact rises. The theoretical predictions of our model are confirmed by a series of experiments: the frequency of minority victories, the relative payoff of the minority versus the majority, and the aggregate payoffsall match the theory. ∗We gratefully acknowledge financial support from the National Science Foundation, grant number SES-0214013, PLESS, CASSEL, and SSEL. We acknowledge helpful comments from participants of the conference in tribute to Jean-Jacques Laffont in Toulouse, June 30- July 2, 2005, the Econometric Society 2005 World Congress in London, and seminars at the Institute for Advanced Study in Princeton, the University of Venice, and CORE. †Columbia University, Greqam, NBER, CEPR, [email protected] ‡Princeton University, [email protected] §University of Iowa, [email protected] 1Introduction Recent decades have witnessed great efforts at designing democratic institutions, at many levels.
    [Show full text]
  • Chevron for Juries
    Wayne State University Law Faculty Research Publications Law School 2015 Chevron for Juries William Ortman Wayne State University Follow this and additional works at: https://digitalcommons.wayne.edu/lawfrp Part of the Administrative Law Commons, Legislation Commons, and the Supreme Court of the United States Commons Recommended Citation William Ortman, Chevron for Juries, 36 CARDOZO L. REV. 1287 (2015) This Article is brought to you for free and open access by the Law School at DigitalCommons@WayneState. It has been accepted for inclusion in Law Faculty Research Publications by an authorized administrator of DigitalCommons@WayneState. CHEVRON FOR JURIES William Ortmant Chevron U.S.A., Inc. v. Natural Resources Defense Council, Inc. rests on two now-familiar premises. First, for some statutes, the traditionaltools of statutory interpretationmore readily yield a range of plausible meanings than a single correct reading. Second, judges are not always the officials best positioned to select one interpretationof a statute from among the plausible options. Chevron relied on these premises to decide that when a courtfinds ambiguity in a statute administered by an agency, it must defer to the agency's interpretationof the statute, so long as it is reasonable. But while administrative law provided a doctrinal context for the Court's decision, Chevron's interpretive premises were about statutes generally, not statutes administeredby agencies. Commentators seldom recognize the general nature of Chevron's interpretivepremises. This Article shines a spotlight on it by applying the premises to a class of statutes outside administrative law. Judges, it argues, are not the best-situated actors in our legal system to pick from among the legally plausible readings of statutes that govern the conduct of the generalpublic.
    [Show full text]
  • On Bayesian-Nash Equilibria Satisfying the Condorcet Jury Theorem: the Dependent Case
    On Bayesian-Nash Equilibria Satisfying the Condorcet Jury Theorem: The Dependent Case Bezalel Peleg and Shmuel Zamir1’2 January 14, 2010 Abstract We investigate sufficient conditions for the existence of Bayesian-Nash equilibria that satisfy the Condorcet Jury Theorem (CJT). In the Bayesian game Gn among n ju- rors, we allow for arbitrary distribution on the types of jurors. In particular, any kind of dependency is possible. If each juror i has a “constant strategy”, σ i (that is, a strat- egy that is independent of the size n i of the jury), such that σ = (σ 1,σ 2,...,σ n ...) satisfies the CJT, then by McLennan≥ (1998) there exists a Bayesian-Nash equilibrium that also satisfies the CJT. We translate the CJT condition on sequences of constant strategies into the following problem: (**) For a given sequence of binary random variables X = (X 1,X 2,...,X n,...) with joint distribution P, does the distribution P satisfy the asymptotic part of the CJT ? We provide sufficient conditions and two general (distinct) necessary conditions for (**). We give a complete solution to this problem when X is a sequence of exchange- able binary random variables. Introduction The simplest way to present our problem is by quoting Condorcet’s classic result (see Young (1997)): Theorem 1. (CJT–Condorcet 1785) Let n voters (n odd) choose between two alternatives that have equal likelihood of being correct a priori. Assume that voters make their judgements independently and that each has the same 1 probability p of being correct ( 2 < p < 1). Then, the probability that the group makes the correct judgement using simple majority rule is n h n h ∑ [n!/h!(n h)!]p (1 p) − h=(n+1)/2 − − which approaches 1 as n becomes large.
    [Show full text]
  • The Premises of Condorcetis Jury Theorem Are Not Simultaneously
    The premises of Condorcet’sjury theorem are not simultaneously justi…ed Franz Dietrich1 March 2008 Abstract Condorcet’s famous jury theorem reaches an optimistic conclusion on the correctness of majority decisions, based on two controversial premises about voters: they should be competent and vote independently, in a technical sense. I carefully analyse these premises and show that: (i) whether a premise is justi…ed depends on the notion of probability considered; (ii) no such notion renders both premises simultaneously justi…ed. Especially the independence assumption should be weakened. 1 Introduction Roughly stated, the classic Condorcet Jury Theorem2 (CJT) asserts that, if a group (jury, population, etc.) takes a majority vote between two alternatives of which exactly one is objectively ’correct’,and if the voters satisfy two technical conditions – competence and independence –, then the probability that the majority picks the correct alternative increases to one (certainty) as the group size tends to in…nity. Though mathematically elementary, this result is striking in its overly positive conclusion. If majority judgments are indeed most probably correct in large societies, majoritarian democracy receives strong support from an epistemic perspective. This paper goes back to the very basics and aims to answer whether the theorem’s two premises are justi…ed. The answer will be seen to depend in a rather clear-cut way on the kind of probability (uncertainty3) considered; unfortunately, in each case exactly one of the premises is not justi…ed. A central distinction will be whether only voting behaviour or also the decision problem voters face is subject to uncertainty. I suggest that this distinction marks the di¤erence between two versions in which the basic CJT can be found in the literature;4 I accordingly label these versions the …xed-problem CJT and the 1 Maastricht University & LSE.
    [Show full text]
  • Gil Delannoi (Ed.)
    DIRECT DEMOCRACY AND SORTITION Gil Delannoi (ed.) Les Cahiers du CEVIPOF Avril 2012, n°56 DIRECT DEMOCRACY AND SORTITION CONFERENCE, PARIS, CEVIPOF, OCTOBER 6TH-7TH 2011 Gil DELANNOI SCIENCES PO, CEVIPOF LAURENCE MOREL UNIVERSITÉ DE LILLE-II BARBARA GOODWIN UNIVERSITY OF EAST ANGLIA PETER STONE TRINITY COLLEGE, DUBLIN ANTOINE CHOLLET UNIVERSITÉ DE LAUSANNE OLIVER DOWLEN CO-ORGANISATEUR DU PROGRAMME DE RECHERCHE SUR LE TIRAGE AU SORT These papers were presented during the first session of the Research Programme on sortition funded by Sciences Po and held at the CEVIPOF in October 2011. This session was organised by Gil Delannoi, one of the organisers of the Programme. The other two organisers are Oliver Dowlen and Peter Stone. The second session was held in November 2011 and the third in May 2012. A fourth session will be held in October 2012. More are planned. th th CONFERENCE, Paris, CEVIPOF, October 6 -7 2011 CONTENTS ON SEVERAL KINDS OF DEMOCRACY GIL DELANNOI ..................................................................................................... 5 SORTITION AND CONTEMPORARY DEMOCRACY LAURENCE MOREL ................................................................ 19 1. WHAT IS SORTITION? ................................................................................................................. 19 A. A mechanism for selecting alternatives .................................................................................................... 19 1. Randomly .........................................................................................................................................
    [Show full text]