Sequential Voting with Externalities: Herding in Social Networks

Slides:



Advertisements
Similar presentations
Introduction Simple Random Sampling Stratified Random Sampling
Advertisements

Reaching Agreements II. 2 What utility does a deal give an agent? Given encounter  T 1,T 2  in task domain  T,{1,2},c  We define the utility of a.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 3.1.Dynamic Games of Complete but Imperfect Information Lecture
This Segment: Computational game theory Lecture 1: Game representations, solution concepts and complexity Tuomas Sandholm Computer Science Department Carnegie.
3. Basic Topics in Game Theory. Strategic Behavior in Business and Econ Outline 3.1 What is a Game ? The elements of a Game The Rules of the.
Stackelberg -leader/follower game 2 firms choose quantities sequentially (1) chooses its output; then (2) chooses it output; then the market clears This.
Mark Wang John Sturm Sanjeev Kulkarni Paul Cuff.  Basic Background – What is the problem?  Condorcet = IIA  Survey Data  Pairwise Boundaries = No.
Introduction to Game theory Presented by: George Fortetsanakis.
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Tuesday. 2.Second test covers up through today’s material, and will be “pseudo-cumulative”
Short introduction to game theory 1. 2  Decision Theory = Probability theory + Utility Theory (deals with chance) (deals with outcomes)  Fundamental.
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.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Competition Among Asymmetric Sellers with Fixed Supply Uriel Feige ( Weizmann Institute of Science ) Ron Lavi ( Technion and Yahoo! Labs ) Moshe Tennenholtz.
Games with Sequential Moves
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
ECON6036 1st semester Format of final exam Same as the mid term
Chapter Twenty-Eight Game Theory. u Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents.
Chapter 6 Extensive Games, perfect info
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.
Two-Stage Games APEC 8205: Applied Game Theory Fall 2007.
1 EC9B6 Voting and Communication Lecture 1 Prof. Francesco Squintani
Unit 6 – Data Analysis and Probability
Chapter 9 Games with Imperfect Information Bayesian Games.
3.1. Strategic Behavior Matilde Machado.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Microeconomics Course E John Hey. Examinations Go to Read.
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
Game-theoretic analysis tools Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
Competitive Prices as a Ranking System over Networks Ehud Lehrer and Ady Pauzner Tel Aviv University.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Mechanism Design with Strategic Mediators Moran Feldman EPFL Joint work with: Moshe Babaioff, Microsoft Research Moshe Tennenholtz, Technion.
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Extensive Form Games With Perfect Information (Illustrations)
Empirical Aspects of Plurality Elections David R. M. Thompson, Omer Lev, Kevin Leyton-Brown & Jeffrey S. Rosenschein COMSOC 2012 Kraków, Poland.
Lec 23 Chapter 28 Game Theory.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.
Game Theory Georg Groh, WS 08/09 Verteiltes Problemlösen.
Arrow’s Impossibility Theorem
Mixed Strategies Keep ‘em guessing.
Satisfaction Games in Graphical Multi-resource Allocation
Microeconomics Course E
Introduction to Game Theory
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Introduction to Game Theory
To Whom the Revenue Goes: A Network Economic Analysis of the Price War in the Wireless Telecommunication Industry Vaggelis G. Douros, Petri Mähönen   Institute.
Discrete Probability Distributions
Econ 805 Advanced Micro Theory 1
Multiagent Systems Extensive Form Games © Manfred Huber 2018.
Multiagent Systems Game Theory © Manfred Huber 2018.
Horizontal Differentiation
Games with Imperfect Information Bayesian Games
Multiagent Systems Repeated Games © Manfred Huber 2018.
Some practice questions
Molly W. Dahl Georgetown University Econ 101 – Spring 2009
Chapter 15: Game Theory: The Mathematics Lesson Plan of Competition
Lecture Game Theory.
Definition of Renegotiation-safe
Implementation in Bayes-Nash equilibrium
Presentation transcript:

Sequential Voting with Externalities: Herding in Social Networks Noga Alon, Moshe Babaioff, Ron Karidi, Ron Lavi, Moshe Tennenholtz Presented by Erez Shabat

Sequential Voting - Model Users vote either “like” or “dislike” (only 2 alternatives) Voting is sequential Each voter has a preferred alternative (type) Voters type are drawn independently from some prior distribution Votes are not anonymous

Sequential Voting - Model Utility externalities: voters value voting for the chosen winner Voters have utility function depending on 3 things only: the voter’s preference, the vote, and the chosen alternative Voters aim to maximize their utility

Examples Social network voting Committee voting Presidential primaries

Utility variables Assuming a voter prefers A over B, denote the utilities as: - voter votes A and A is chosen - voter votes A and B is chosen - voter votes B and B is chosen - voter votes B and A is chosen Assume the following holds

Utility variables For example, if the voters only care about conforming with the winner then = > =

2 Variants Infinite and countable number of voters, winner is announced when the gap in votes is at least some large number M. Finite population of size n (at least 3), the chosen alternative is the one with the most votes.

Result 1 When the winner is declared when the gap in votes is at least M: Increasing M does not result in aggregation of preferences of more voters in the decision The threshold start for herding is independent of M, and only depends on

Result 2 There are cases in which sequential voting is strictly better than simultaneous voting in the sense that it chooses the most preferred alternative with higher probability.

Result 2 More formally: For any number of voters n, there exists utility parameters, and a non-symmetric prior probability with a slight advantage for B Sincere voting is not a Nash equilibrium of simultaneous voting The strategies generating a “herd that follows the first voter” is the unique subgame-perfect equilibrium in sequential voting

Result 2 With these strategies the probability that the “correct” outcome is chosen is strictly higher than the probability it will be chosen in any Nash equilibrium of simultaneous voting

Further Work The paper considers only pure strategies Only 2 alternatives, either A or B Symmetric utility function All voters get equals weight