Intro Prefs & Voting Electoral comp. Voter Turnout Agency GIP SIP Rent seeking Partisans. Political Economics. Dr. Marc Gronwald Dr.

Similar documents
Problems with Group Decision Making

Problems with Group Decision Making

Public Choice. Slide 1

Chapter 1 Practice Test Questions

Answers to Practice Problems. Median voter theorem, supermajority rule, & bicameralism.

Chapter 10. The Manipulability of Voting Systems. For All Practical Purposes: Effective Teaching. Chapter Briefing

Voting Protocols. Introduction. Social choice: preference aggregation Our settings. Voting protocols are examples of social choice mechanisms

The Manipulability of Voting Systems. Check off these skills when you feel that you have mastered them.

Arrow s Impossibility Theorem

Lecture 16: Voting systems

The Impossibilities of Voting

MATH4999 Capstone Projects in Mathematics and Economics Topic 3 Voting methods and social choice theory

Political Economy. Pierre Boyer and Alessandro Riboni. École Polytechnique - CREST

Main idea: Voting systems matter.

Voting Criteria: Majority Criterion Condorcet Criterion Monotonicity Criterion Independence of Irrelevant Alternatives Criterion

Lecture 12: Topics in Voting Theory

1.6 Arrow s Impossibility Theorem

Social welfare functions

Political Economics Handout. The Political Economics of Redistributive Policies. Vincenzo Galasso

Mathematics and Social Choice Theory. Topic 4 Voting methods with more than 2 alternatives. 4.1 Social choice procedures

Median voter theorem - continuous choice

Electing the President. Chapter 12 Mathematical Modeling

Introduction to Theory of Voting. Chapter 2 of Computational Social Choice by William Zwicker

Social Choice Theory. Denis Bouyssou CNRS LAMSADE

Chapter 9: Social Choice: The Impossible Dream Lesson Plan

Name Date I. Consider the preference schedule in an election with 5 candidates.

Elections with Only 2 Alternatives

Notes for Session 7 Basic Voting Theory and Arrow s Theorem

12.2 Defects in Voting Methods

Political Economics II Spring Lectures 4-5 Part II Partisan Politics and Political Agency. Torsten Persson, IIES

answers to some of the sample exercises : Public Choice

Fairness Criteria. Majority Criterion: If a candidate receives a majority of the first place votes, that candidate should win the election.

Chapter 4: Voting and Social Choice.

Introduction to the Theory of Voting

Measuring Fairness. Paul Koester () MA 111, Voting Theory September 7, / 25

Fairness Criteria. Review: Election Methods

Voting rules: (Dixit and Skeath, ch 14) Recall parkland provision decision:

Electing the President. Chapter 17 Mathematical Modeling

Election Theory. How voters and parties behave strategically in democratic systems. Mark Crowley

PROBLEM SET #2: VOTING RULES

CS 886: Multiagent Systems. Fall 2016 Kate Larson

Introduction to Social Choice

Rationality & Social Choice. Dougherty, POLS 8000

Homework 7 Answers PS 30 November 2013

VOTING ON INCOME REDISTRIBUTION: HOW A LITTLE BIT OF ALTRUISM CREATES TRANSITIVITY DONALD WITTMAN ECONOMICS DEPARTMENT UNIVERSITY OF CALIFORNIA

Make the Math Club Great Again! The Mathematics of Democratic Voting

Recall: Properties of ranking rules. Recall: Properties of ranking rules. Kenneth Arrow. Recall: Properties of ranking rules. Strategically vulnerable

Economics 470 Some Notes on Simple Alternatives to Majority Rule

Voting. Suppose that the outcome is determined by the mean of all voter s positions.

The Borda count in n-dimensional issue space*

Social Choice & Mechanism Design

The Problem with Majority Rule. Shepsle and Bonchek Chapter 4

University of Toronto Department of Economics. Party formation in single-issue politics [revised]

Decision making and problem solving Lecture 10. Group techniques Voting MAVT for group decisions

Mathematical Thinking. Chapter 9 Voting Systems

POSITIVE POLITICAL THEORY

CSC304 Lecture 16. Voting 3: Axiomatic, Statistical, and Utilitarian Approaches to Voting. CSC304 - Nisarg Shah 1

CSC304 Lecture 14. Begin Computational Social Choice: Voting 1: Introduction, Axioms, Rules. CSC304 - Nisarg Shah 1

Write all responses on separate paper. Use complete sentences, charts and diagrams, as appropriate.

Josh Engwer (TTU) Voting Methods 15 July / 49

Math for Liberal Arts MAT 110: Chapter 12 Notes

Approaches to Voting Systems

Exercises For DATA AND DECISIONS. Part I Voting

Voting System: elections

MATH 1340 Mathematics & Politics

Algorithms, Games, and Networks February 7, Lecture 8

Voter Turnout, Income Inequality, and Redistribution. Henning Finseraas PhD student Norwegian Social Research

Voting Definitions and Theorems Spring Dr. Martin Montgomery Office: POT 761

2-Candidate Voting Method: Majority Rule

Lecture 11. Voting. Outline

The mathematics of voting, power, and sharing Part 1

Voting: Issues, Problems, and Systems, Continued

First Principle Black s Median Voter Theorem (S&B definition):

Part IIB Paper Outlines

Voting and preference aggregation

Democratic Rules in Context

Majority cycles in national elections

Voting and preference aggregation

(67686) Mathematical Foundations of AI June 18, Lecture 6

3. Public Choice in a Direct Democracy

1 Electoral Competition under Certainty

The actual midterm will probably not be multiple choice. You should also study your notes, the textbook, and the homework.

PUBLIC FUNDING OF POLITICAL PARTIES

Public finances, efficiency and equity: what are the trade-offs?

Rock the Vote or Vote The Rock

Math for Liberal Studies

Many Social Choice Rules

Published in Canadian Journal of Economics 27 (1995), Copyright c 1995 by Canadian Economics Association

Intro to Contemporary Math

Strategic Voting and Strategic Candidacy

Voting Lecture 3: 2-Candidate Voting Spring Morgan Schreffler Office: POT Teaching.

The Mathematics of Voting

Campaign Contributions as Valence

Social Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides

The Mathematics of Voting. The Mathematics of Voting

Topics in Applied Economics I: Explaining Economic Policy

Head-to-Head Winner. To decide if a Head-to-Head winner exists: Every candidate is matched on a one-on-one basis with every other candidate.

VOTING TO ELECT A SINGLE CANDIDATE

Desirable properties of social choice procedures. We now outline a number of properties that are desirable for these social choice procedures:

Computational Social Choice: Spring 2007

Transcription:

Political Economics Dr. Marc Gronwald Dr. Silke Uebelmesser Ludwig-Maximilians University Munich Summer term 2010

Motivation Total government spending as fraction of GDP in the late 1990s: Sweden: 60%; Continental Europe: 50%; Japan, Switzerland, United States: 35% Spending on the unemployed as fraction of total public spending: ranges from 2% to 17% within the EU-15 Unemployment insurance replacement rate: ranges from 20% to 90% in the EU-15 Public debt as fraction of GDP: Norway: 40%; Italy and Belgium: 120% Inflation: UK: 8%; Germany: 3%

Motivation Growth of government took off in many industrial countries in the mid 1930s as well as in the late 1960s Slowdown after World War II and in the late 1980s

Motivation Economic policy varies greatly across time and place But there are also common patterns

Motivation Why is policy the way it is? What is policy ought to be?

Keywords Social Choice / Voting rules / Preferences Median voter / Condorcet winner Electoral competition / Motivation of politicians Rational voters / Probabilistic voting

Table of contents 1 Introduction(DR) 2 Preferences and voting (DR) 3 Voter turnout (DR) 4 Electoral competition (SÜ) 5 Agency problems (SÜ) 6 General-interest politics (SÜ) 7 Special-interest politics (DR) 8 Applications

Textbook literature Grossman, G.M. and E. Helpman (2001), Special Interest Politics, Cambridge, Mass: MIT Press. Mueller, D. (2003), Public Choice III, Cambridge University Press, Cambridge. Persson, T. and G. Tabellini (2000), Political Economics Explaining Economic Policy, MIT Press, Cambridge.

2. Preferences and voting

2.1 Voting rules Consider 7 voters and 4 alternative policies (A, B, C, D). The voters preferences over the alternatives are defined in the following Table: 1 2 3 4 5 6 7 1st A A A B B C C. B B B C C D D. C C C A D A A 4th D D D D A B B Table 1: Preferences I How should we aggregate these individual preferences into social preferences?

2.1 Voting rules At least 4 different voting rules can be distinguished: Majority/Plurality rule: All alternatives are voted on simultaneously. The alternative which receives the maximum number of votes is selected in the political process. A:3; B:2; C:2 A wins

2.1 Voting rules Pairwise voting without agenda setting (open agenda): Multiple voting rounds - in each round voting takes place over two alternatives (pairwise voting). The winning alternative is opposed against another option. The winning option in this round is opposed against another untested option and so on. The alternative which beats all other alternatives in a pairwise vote is the winner (Condorcet winner). A vs B 5:2; A vs C 3:4; C vs D 7:0; C vs B 2:5; B vs D 5:2; B vs A 2:5 No Condorcet winner exists

2.1 Voting rules Pairwise voting with agenda setting (closed agenda): The agenda setter determines the order of pairwise voting. The alternative which survives the last round is the winner. For instance, A vs B 5:2; A vs C 3:4; C vs D 7:0; C wins A vs C 3:4; C vs B 2: 5; B vs D 5:2; B wins D vs C 0:7; C vs B 2: 5; B vs A 2:5; A wins

2.1 Voting rules Borda rule: All alternatives are voted on simultaneously. Each voter receives k+(k-1)+(k-2)+..+(k-k) points which he/she can allocate to the alternatives. The most preferred alternative gets k points, the next most preferred one k-1 points... The winning alternative is the one with the maximum number of points. For k=1 the Borda rule and the Majority/Plurality rule coincide. k=1 A: 3; B: 2; C: 2 A wins k=2 A: 6; B: 7; C: 6; D: 2 B wins k=3 A: 12; B: 12; C: 13; D: 5 C wins

2.1 Voting rules Punchline: Even in this subset of possible political mechanisms the choice of the aggregation rule is decisive for the political outcome: The will of society is highly sensitive to the specifics of the political process and is thereby ambiguous.

2.1 Voting rules What are desirable voting rules? If voting rules lead to different outcomes how should society decide among them? Frequently mentioned desirable properties of voting rules comprise: Anonymity: This is one of the fundamental principles of democracy. The political outcome should not depend on the identity of the voters - only individual preferences should matter, i.e. a rich voter or a member e.g. of the political elite/aristocracy matters as much as any other voter. This principle rules out dictatorships.

2.1 Voting rules Neutrality: The voting rule should not introduce a bias in favor of one option. All options should be treated alike. Decisiveness: The voting rule must pick a winner. Positive responsiveness: Increasing the vote for the winning option should not lead to declare another option a winner.

2.1 Voting rules With only two alternatives we have a powerful result: Theorem (May s Theorem) With only two options the majority rule is the only voting rule which satisfies the requirements of anonymity, neutrality, decisiveness and positive responsiveness. Proof: See Mueller, 2003, p. 135. What happens if there are more than two alternatives?

2.1 Voting rules In the remaining part of this chapter, we study preference aggregation by pure majority rule which we define by means of the following assumptions: A1 Direct democracy. Voters do not elect political agents (as in a representative democracy) but rather decide on policy issues themselves. A2 Sincere voting. Every citizen votes for the alternative that delivers the highest level of utility according to his/her preferences. In other words, there is no strategic voting. A3 Open agenda. Voters decide among pairs of policy options such that the winner of one round is posed against a further alternative in the next round. The set of policies among one has to decide includes all feasible options.

2.2 Preferences: One-dimensional voting Example 2.1: Consider pairwise voting without an agenda setter. The preferences of three voters over three alternatives are as described in Table 2: 1 2 3 1st A B C. B C A 3rd C A B Table 2: Preferences II A vs. B: 2:1; A vs. C: 1:2; C vs. B: 1:2; B vs A: 1:2 and so on. Voting is cyclical.

2.2 Preferences: One-dimensional voting Fig 2.1 1 2 3 A B C Figure 1: Preferences II

2.2 Preferences: One-dimensional voting Voting cycles are closely linked to the concept of transitivity: Definition (Transitivity) If A is weakly preferred to B and B is weakly preferred to C, then A must be weakly preferred to C, i.e. if A B and B C, then A C. Discuss transitivity in example 2.1. We will derive in the following sections sufficient conditions for the existence of a well-defined majority winner in elections. In particular, we will introduce the single-peakedness and the single-crossing condition, respectively.

Median voter theorem with single-peakedness The concept of transitivity (and thus the existence of voting cycles) is related to the notion of single-peakedness. Definition (Single-peakedness) Let qi denote voter i s most preferred alternative. Then, if q q qi or q q qi, it follows that u i(q ) u i (q ). Are preferences in example 2.1 and the introductory example single-peaked?

Median voter theorem with single-peakedness Fig. 2.2 1,2,3 6,7 4 5 A B C D Figure 2: Preferences I

Median voter theorem with single-peakedness A condition for voting cycles not to arise is that individual preferences are single-peaked. More explicitly, Theorem (Median voter theorem (single-peakedness version)) If there is an odd number of voters, individual preferences are singled-peaked and the policy space is one-dimensional, then the median of the distribution of the voters most preferred alternatives wins in a pairwise vote. This policy alternative is referred to as the Condorcet winner. The voter whose most preferred alternative is the median of the distribution is called the median voter.