1 EC9B6 Voting and Communication Lecture 1 Prof. Francesco Squintani

Slides:



Advertisements
Similar presentations
Game Theory Lecture 4 Game Theory Lecture 4.
Advertisements

Nash Equilibrium: Illustrations
EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
Non myopic strategy Truth or Lie?. Scoring Rules One important feature of market scoring rules is that they are myopic strategy proof. That means that.
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
1 EC9A4 Social Choice and Voting Lecture 3 EC9A4 Social Choice and Voting Lecture 3 Prof. Francesco Squintani
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
Voting for Public Goods (Fisher, Ch. 3) © Allen C. Goodman 2015.
Median Voter Theorem- Nash Equilibrium The median voter theory, also known as the median voter theorem or Black's theorem, is a famous voting theorem.
ECO290E: Game Theory Lecture 5 Mixed Strategy Equilibrium.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Lectures 7&8 Revisit Elections Now range is left-wing or right-wing politics. Candidate-Voter model Assume even distribution of voters. Voters will vote.
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Negotiation A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Game-theoretic analysis tools Necessary for building nonmanipulable automated negotiation systems.
NOGA ALON, MOSHE BABAIOFF, RON KARIDI, RON LAVI, MOSHE TENNENHOLTZ PRESENTED BY EREZ SHABAT Sequential Voting with Externalities: Herding in Social Networks.
Chapter 2 Discrete Random Variables
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
1 Utility Theory. 2 Option 1: bet that pays $5,000,000 if a coin flipped comes up tails you get $0 if the coin comes up heads. Option 2: get $2,000,000.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.

An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Yale lectures 3 and 4 review Iterative deletion of dominated strategies. Ex: two players choose positions on political spectrum. Endpoints become repeatedly.
The Politics of Lineland Last time: She blinded me with Science Why and how should we study legislatures and legislators? Today Introduction to spatial.
Off-the-peak preferences and the outcome of elections Francisco Martínez-Mora University of Leicester and FEDEA & M. Socorro Puy Universidad de Málaga.
Reshef Meir Jeff Rosenschein Hebrew University of Jerusalem, Israel Maria Polukarov Nick Jennings University of Southampton, United Kingdom COMSOC 2010,
Simulating Normal Random Variables Simulation can provide a great deal of information about the behavior of a random variable.
Games in the normal form- An application: “An Economic Theory of Democracy” Carl Henrik Knutsen 5/
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
EC941 - Game Theory Francesco Squintani Lecture 3 1.
PROBLEM 4.
Voting for Public Goods (Fisher, Ch. 3) © Allen C. Goodman 2009.
EC941 - Game Theory Prof. Francesco Squintani Lecture 2 1.
EC941 - Game Theory Francesco Squintani 1 Lecture 1.
8 CHAPTER Public Sector Demand PUBLIC SECTOR ECONOMICS: The Role of Government in the American Economy Randall Holcombe.
Monetary Economics Game and Monetary Policymaking.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
1 EC9A4 Social Choice and Voting Lecture 1 EC9A4 Social Choice and Voting Lecture 1 Prof. Francesco Squintani
EC941 - Game Theory Prof. Francesco Squintani Lecture 5 1.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Elections. How candidates are chosen – After candidates declare that they are running and fill their petition, parties must choose who will run Not all.
Elections and Strategic Voting: Condorcet and Borda E. Maskin Harvard University.
Lecture 5A Mixed Strategies and Multiplicity Not every game has a pure strategy Nash equilibrium, and some games have more than one. This lecture shows.
1 EC9A4 Social Choice and Voting Lecture 2 EC9A4 Social Choice and Voting Lecture 2 Prof. Francesco Squintani
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. CHOOSING.
Decision theory under uncertainty
If the majority of people find themselves somewhere close to the middle and the goal of politicians is to earn the most votes, why don’t see more politicians.
Institutional Analysis Lecture 7: Political Parties.
Arrow’s Impossibility Theorem. Question: Is there a public decision making process, voting method, or “Social Welfare Function” (SWF) that will tell us.
EC941 - Game Theory Prof. Francesco Squintani Lecture 6 1.
Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland.
How Should Presidents Be Elected? E. Maskin Institute for Advanced Study.
Nash Bargaining Solution and Alternating Offer Games MIT Game Theory.
7 th Grade Civics Miss Smith *pgs  Must be ___ years old by a set ____ before the next ________  Voter _________ protects your vote  No one.
Citizen Candidate Model Advanced Political Economics Fall 2011 Riccardo Puglisi.
The Political Economics Approach Advanced Political Economics Fall 2011 Riccardo Puglisi The Political Economics Approach.
The Political Economics Approach Advanced Political Economics Fall 2013 Riccardo Puglisi The Political Economy Approach.
Political Economics Riccardo Puglisi Lecture 1 Content: The Political Economics Approach Methodological Tools Majoritarian Elections.
Behavioral Finance Biases Feb 23 Behavioral Finance Economics 437.
Social Choice Lectures 14 and 15 John Hey. Lectures 14 and 15: Arrow’s Impossibility Theorem and other matters Plan of lecture: Aggregation of individual.
Political Economics Riccardo Puglisi Lecture 2 Content: Probabilistic Voting Model.
Lecture 7 Price competition. Bertrand’s Model of Oligopoly Strategic variable price rather than output. Single good produced by n firms Cost to firm i.
How do voters make up their minds?
Chapter 2 Discrete Random Variables
Advanced Political Economics
Sequential Voting with Externalities: Herding in Social Networks
Horizontal Differentiation
Moderating Government
Advanced Political Economics
Presentation transcript:

1 EC9B6 Voting and Communication Lecture 1 Prof. Francesco Squintani

2 Preview of the lecture We will introduce single-peaked utilities. We will prove Black’s theorem: Majority voting is socially fair when utilities are single-peaked. We will prove Median Voter Convergence in the Downsian model of elections. We will introduce the citizen candidate model.

3 Voting Models Voting models are non-cooperative games that model elections. They can study one-shot elections, or repeated elections. There may be 2 or more candidates. Candidates’ strategic decisions may include whether and when to run in the election, with which promised policy platform, campaign spending, and so on.

4 Downsian Elections There are 2 candidates, i=1,2. Candidates care only about winning the election. Candidates i=1,2 simultaneously commit to policies x i if elected. Policies are real numbers. There is a continuum of voters, with diverse ideologies k, with cumulative distribution F. The utility of a voter with ideology k if policy x is implemented is u(x,k)= L(|x-k|), with L’<0. After candidates choose platforms, each citizen votes, and candidate with the most votes wins. If x 1 = x 2, then the election is tied.

5 For any ideology distribution F, let the median policy m be such that 1/2 of voters' ideologies y > m & 1/2 of ideologies y < m : F (m) = 1/2. Median Voter Theorem: The unique Nash Equilibrium of the Downsian Election model is such that candidates i choose x i = m, and tie the election.

6 Proof. Fix any x 1 = x 2. Because L’<0, each voter with ideology k votes for the candidate i that minimizes |x i -k|. Hence, if x i < x j, candidate i’s vote share is F(½ ( x 1 + x 2 ) ), and candidate j’s is 1- F(½ ( x 1 + x 2 ) ). For either candidate i, if x i = m, then candidate j’s best response is BR j = {x j : |x j - m|< |x i - m|}. Candidate j wins the election. But if j plays any x j such that |x j - m|< |x i - m|, the best response of i cannot be x i.

7 If i plays x i, i loses the election. But i can at least tie by playing m. Hence, there cannot be any Nash equilibrium where either candidate i plays x i = m. Suppose both candidates play x 1 = x 2 = m, then all voters are indifferent between x 1 and x 2, and the election is tied. If either candidate i deviates and plays x i = m, then she loses the election. So, there is unique Nash equilibrium: x 1 = x 2 = m.

8 Assume that F is symmetric around m, i.e., F(x) = 1 – F(2m-x), for all x. Let us compare the voter welfare from profile x 1 = x 2 = m, with any profile x’ 1, x’ 2 = 2m – x’ 1. Each platform x’ 1 and x’ 2 is voted by 1/2 of voters. So, if voters are risk averse, L’’ < 0, then they all prefer the sure outcome x 1 = x 2 = m, to the `bet’ x’ 1, x’ 2 which has expected value equal to m.

9 Downsian Elections with Ideological Candidates Suppose that candidate i’s ideology is k i, with k 1 < m < k 2, and m - k 1 < k 2 – m. The utility of candidate i if policy x is implemented is u(x, k i )= L(|x- k i |), with L’<0. Theorem: The unique Nash Equilibrium is such that candidates i choose x i = m, and tie.

10 Proof. Again, for any x 1 = x 2, if x i < x j, candidate i’s vote share is F(½ ( x 1 + x 2 ) ), and candidate j’s is 1- F(½ ( x 1 + x 2 ) ). Suppose that x 1 < m, then candidate 2 wins and implement x 2 by choosing x 2 in (x 1, 2m - x 1 ). Hence, if x 1 < 2m- k 2, then BR 2 (x 1 )={k 2 }, and if 2m- k 2 < x 1 < m, then BR 2 (x 1 ) is empty. But if x 2 = k 2, then BR 1 (x 2 ) is empty. If m < x 1 < k 2, then BR 2 (x 1 )=[x 1, +∞). If x 1 > k 2, then BR 2 (x 1 )={k 2 }. But if x 2 > x 1 >m or x 2 = k 2, then x 1 not in BR 1 (x 2 ).

11 Hence, we conclude that there cannot be any Nash Equilibrium with x 1 = m or x 2 = m. Suppose that candidate i chooses x i = m. Then, regardless of the choice x j, the implemented policy is m. Hence, BR j (x i ) = (-∞, +∞). We conclude that the unique Nash Equilibrium is such that x 1 = x 2 = m, and the election is tied.

12 Conclusion 12 We have introduced single-peaked utilities. We have proved Black’s theorem: Majority voting is socially fair when utilities are single-peaked. We have proved Median Voter Convergence in the Downsian model of elections. We have introduced citizen candidate models.

13 Preview of the next Lecture We will introduce ideology and uncertainty in the Downsian model, to represent `probabilistic elections with responsible parties.’ We will derive the equilibrium of this model and prove that responsible parties yield higher welfare to the electorate than opportunistic parties.