Introduction to Game Theory and Strategic Behavior Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns.

Slides:



Advertisements
Similar presentations
Nagel: Unraveling in Guessing Games: An Experimental Study Economics 328 Spring 2005.
Advertisements

Introduction to Game Theory Networked Life CSE 112 Spring 2005 Prof. Michael Kearns.
Introduction to Game Theory
Ultimatum Game Two players bargain (anonymously) to divide a fixed amount between them. P1 (proposer) offers a division of the “pie” P2 (responder) decides.
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.
1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.
The basics of Game Theory Understanding strategic behaviour.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
Chapter 6 Game Theory © 2006 Thomson Learning/South-Western.
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Introduction to Network Mathematics (3) - Simple Games and applications Yuedong Xu 16/05/2012.
Nash Equilibria By Kallen Schwark 6/11/13 Fancy graphs make everything look more official!
Game Theory Eduardo Costa. Contents What is game theory? Representation of games Types of games Applications of game theory Interesting Examples.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Economics 202: Intermediate Microeconomic Theory 1.HW #6 on website. Due Thursday. 2.No new reading for Thursday, should be done with Ch 8, up to page.
An Introduction to Game Theory Part I: Strategic Games
GAME THEORY.
Chapter 6 © 2006 Thomson Learning/South-Western Game Theory.
Introduction to (Networked) Game Theory Networked Life NETS 112 Fall 2014 Prof. Michael Kearns.
Game Theory Analysis Sidney Gautrau. John von Neumann is looked at as the father of modern game theory. Many other theorists, such as John Nash and John.
GAME THEORY By Ben Cutting & Rohit Venkat. Game Theory: General Definition  Mathematical decision making tool  Used to analyze a competitive situation.
Eponine Lupo.  Game Theory is a mathematical theory that deals with models of conflict and cooperation.  It is a precise and logical description of.
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.
Algoritmi per Sistemi Distribuiti Strategici
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Behavioral Game Theory: A Brief Introduction Networked Life CSE 112 Spring 2005 Prof. Michael Kearns Supplementary slides courtesy of Colin Camerer, CalTech.
THE PROBLEM OF MULTIPLE EQUILIBRIA NE is not enough by itself and must be supplemented by some other consideration that selects the one equilibrium with.
1 Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.
An introduction to game theory Today: The fundamentals of game theory, including Nash equilibrium.
Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.
News and Notes 3/18 Two readings in game theory assigned Short lecture today due to 10 AM fire drill HW 2 handed back today, midterm handed back Tuesday.
QR 38, 2/22/07 Strategic form: dominant strategies I.Strategic form II.Finding Nash equilibria III.Strategic form games in IR.
Introduction to Game Theory and Networks Networked Life CSE 112 Spring 2007 Prof. Michael Kearns.
Introduction to Game Theory, Behavior and Networks Networked Life CIS 112 Spring 2008 Prof. Michael Kearns.
Today: Some classic games in game theory
Social Choice Session 7 Carmen Pasca and John Hey.
Game Theory, Strategic Decision Making, and Behavioral Economics 11 Game Theory, Strategic Decision Making, and Behavioral Economics All men can see the.
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Intermediate Microeconomics
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.
THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Chapters 29, 30 Game Theory A good time to talk about game theory since we have actually seen some types of equilibria last time. Game theory is concerned.
Experimental Economics NSF short course David Laibson August 11, 2005.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
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.
Strategic Behavior in Business and Econ Static Games of complete information: Dominant Strategies and Nash Equilibrium in pure and mixed strategies.
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013.
Strategic Game Theory for Managers. Explain What is the Game Theory Explain the Basic Elements of a Game Explain the Importance of Game Theory Explain.
Intermediate Microeconomics Game Theory. So far we have only studied situations that were not “strategic”. The optimal behavior of any given individual.
Lec 23 Chapter 28 Game Theory.
Oligopoly and Game Theory Topic Students should be able to: Use simple game theory to illustrate the interdependence that exists in oligopolistic.
Experiments and “Rational” Behavior, 5/1/07. Beauty Contest Game Each person choose a number from 0 to 100. We will average these numbers. The person.
John Forbes Nash John Forbes Nash, Jr. (born June 13, 1928) is an American mathematician whose works in game theory, differential geometry, and partial.
Chapter 12 Game Theory Presented by Nahakpam PhD Student 1Game Theory.
Game Theory By Ben Cutting & Rohit Venkat.
Game theory basics A Game describes situations of strategic interaction, where the payoff for one agent depends on its own actions as well as on the actions.
Intermediate Microeconomics
Project BEST Game Theory.
Introduction to Game Theory
Introduction to (Networked) Game Theory
Unit 4 SOCIAL INTERACTIONS.
Multiagent Systems Game Theory © Manfred Huber 2018.
Introduction to (Networked) Game Theory
Introduction to (Networked) Game Theory
UNIT II: The Basic Theory
Game Theory: The Nash Equilibrium
Presentation transcript:

Introduction to Game Theory and Strategic Behavior Networked Life MKSE 112 Fall 2012 Prof. Michael Kearns

percent expected to attend percent who will actually attend 100% Attendance Dynamics: Concave equilibrium: 100%

percent currently using FB (vs. G+) probability of adopting FB 100% Market Share Dynamics: Polarizing equilibrium: 0% equilibrium: 100% unstable equilibrium: 50% Let’s also revisit the segregation simulator

Game Theory for Fun and Profit The “Beauty Contest” Game Write your name and an integer between 0 and 100 Let X denote the average of all the numbers Whoever’s number is closest to (2/3)X wins $10 Split in case of ties

Game Theory A mathematical theory designed to model: –how rational individuals should behave –when individual outcomes are determined by collective behavior –strategic behavior Rational usually means selfish --- but not always Rich history, flourished during the Cold War Traditionally viewed as a subject of economics Subsequently applied by many fields –evolutionary biology, social psychology… now computer science Perhaps the branch of pure math most widely examined outside of the “hard” sciences

Prisoner’s Dilemma Cooperate = deny the crime; defect = confess guilt of both Claim that (defect, defect) is an equilibrium: –if I am definitely going to defect, you choose between -10 and -8 –so you will also defect –same logic applies to me Note unilateral nature of equilibrium: –I fix a behavior or strategy for you, then choose my best response Claim: no other pair of strategies is an equilibrium But we would have been so much better off cooperating… cooperatedefect cooperate-1, -1-10, defect-0.25, -10-8, -8

Penny Matching What are the equilibrium strategies now? There are none! –if I play heads then you will of course play tails –but that makes me want to play tails too –which in turn makes you want to play heads –etc. etc. etc. But what if we can each (privately) flip coins? –the strategy pair (1/2, 1/2) is an equilibrium Such randomized strategies are called mixed strategies headstails heads1, 00, 1 tails0, 11, 0

The World According to Nash A mixed strategy for a player is a distribution on their available actions –e.g. 1/3 rock, 1/3 paper, 1/3 scissors Joint mixed strategy for N players: –a probability distribution for each player (possibly different) –assume everyone knows all the distributions –but the “coin flips” used to select from player P’s distribution known only to P “private randomness” so only player P knows their actual choice of action can people randomize? (more later) Joint mixed strategy is an equilibrium if: –for every player P, their distribution is a best response to all the others i.e. cannot get higher (average or expected) payoff by changing distribution only consider unilateral deviations by each player! –Nash 1950: every game has a mixed strategy equilibrium! –no matter how many rows and columns there are –in fact, no matter how many players there are Thus known as a Nash equilibrium A major reason for Nash’s Nobel Prize in economics

Facts about Nash Equilibria While there is always at least one, there might be many –zero-sum games: all equilibria give the same payoffs to each player –non zero-sum: different equilibria may give different payoffs! Equilibrium is a static notion –does not suggest how players might learn to play equilibrium –does not suggest how we might choose among multiple equilibria Nash equilibrium is a strictly competitive notion –players cannot have “pre-play communication” –bargains, side payments, threats, collusions, etc. not allowed Computing Nash equilibria for large games is difficult

Behavioral Game Theory: What do People Really Do? (Slides adapted from Colin Camerer, CalTech)

Behavioral Game Theory and Game Practice Game theory: how rational individuals should behave Who are these rational individuals? BGT: looks at how people actually behave –experiment by setting up real economic situations –account for people’s economic decisions –don’t break game theory when it works Fit a model to observations, not “rationality”

Beauty Contest Analysis Some number of players try to guess a number that is 2/3 of the average guess. The answer can’t be between 68 and no use guessing in that interval. It is dominated. But if no one guesses in that interval, the answer won’t be greater than 44. But if no one guesses more than 44, the answer won’t be greater than 29… Everyone should guess 0! And good game theorists might… But they’d lose…

Ultimatum Game Proposer has $10 Offers x to Responder (keeps $10-x) What should the Responder do? –Self-interest: Take any x > 0 –Empirical: Reject x = $2 half the time

How People Ultimatum-Bargain Thousands of games have been played in experiments… In different cultures around the world With different stakes With different mixes of men and women By students of different majors Etc. etc. etc. Pretty much always, two things prove true: 1.Player 1 offers close to, but less than, half (40% or so) 2.Player 2 rejects low offers (20% or less)

Ultimatum offers across societies (mean shaded, mode is largest circle…)

Behavioral Game Theory: Some Key Themes Bounded Rationality: Humans don’t have unlimited computational/reasoning capacity (Beauty Contest) Inequality Aversion: Humans often deviate from equilibrium towards “fairness” (Ultimatum) Mixed Strategies: Humans can generate “random” values within limits; better if paid.

Game Theory Review Specify a game by payoffs to each player under all possible joint actions –matrix or “normal form” games Nash equilibrium: choice of actions (a1,a2) for the players such that –a1 is a best response to a2, a2 is a best response to a1 (e.g. (confess, confess) in PD) –neither player can unilaterally improve their payoff –More generally, every player is best-responding to the other N-1 players Nash equilibria always exist; players may need to randomize A static, instantaneous concept –no notion of dynamics, repeated or gradual play, learning, etc. Examples so far: –small number of players (2) –small number of actions per player (e.g. deny or confess) –no notion of network

Games on Networks Large number of players Large number of actions Network mediates the interactions between players and payoffs –player’s payoff depends only on local interactions Don’t need exhaustive table to specify payoffs –instead specify payoffs for each configuration of the local neighborhood Often consider dynamic, gradual interactions –but (Nash) equilibrium still a valuable guide

Example: Schelling’s Segregation Model Large number of players: 2500 in demo Large number of actions: all currently empty cells Network mediates the interactions: grid network –any player’s payoff depends on only their neighboring cells Don’t need exhaustive table to specify payoffs –payoff = 1 if at least X% like neighbors; else payoff = 0 Often consider dynamic, gradual interactions –unhappy (payoff=0) players move to empty cell, may improve payoff –simulation converges to a Nash equilibrium (all players payoff=1)

Example: Driving to Work “Players” are commuters driving to work (large number) –each has their own origin and destination –wants to minimize their driving time Actions are routes they could take (large number) –multiple freeway choices, surface roads, etc. Network of roads intermediates payoffs –player’s driving time depends only on how many other players are driving same roads –cost (= -payoff): sum of latencies on series of roads chosen Very complex game; still has a Nash equilibrium Equivalent to Internet routing How inefficient can the equilibrium outcome be?

Consensus and Coordination in Networks Players are individuals in a social network Actions are simple choices of colors to adopt Social network intermediates payoffs and information –only see color choices of your neighbors –payoff determined by your color choices and neighbors’ Consensus: want to agree on common color Differentiation: want to be a different color than neighbors Biased voting: want to agree on a common color, but “care” which color How does network structure influence individual and collective behavior?

Trading and Bargaining in Networks Players are individuals in a social network Actions are financial –trading: barter offers (e.g. trade 1 unit of Milk for 2 units of Wheat) –bargaining: proposals for splitting $1 (as in Ultimatum Game) Social network intermediates payoffs and information –Can only trade/bargain with your neighbors –payoff determined by what deals you strike with neighbors How does network position influence player wealth? What does equilibrium predict, and what do players actually do?

Summary Coming lectures examine games and economic interactions on networks Will move back and forth between theory and experimental results Experiments conducted in offline class at University of Pennsylvania Common themes: –equilibrium predictions vs. behavior –effects of network structure on individual and collective outcome